Strategic cooperation in cost sharing games

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6484 LNCS, Issue , 2010, Pages 258-269

  Hoefer, Martin ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION PROBLEMS; COST-SHARING GAMES; FACILITY LOCATIONS; INTEGRALITY GAPS; NASH EQUILIBRIA; NETWORK DESIGN PROBLEMS; PRICE OF ANARCHY; SET COVER; STRATEGIC COOPERATION; STRATEGIC GAME; STRONG EQUILIBRIUM; FACILITY LOCATION GAMES;

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; COST EFFECTIVENESS; INTERNET; WINE; COSTS; LINEAR PROGRAMMING; OPTIMIZATION;

COSTS; COST EFFECTIVENESS;

EID: 78650909080     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-17572-5_21     Document Type: Conference Paper

References (26)

1. Andelman, N., Feldman, M., Mansour, Y.: Strong price of anarchy. Games Econom. Behav. 65(2), 289-317 (2009)
2. Anshelevich, E., Cascurlu, B., Hate, A.: Strategic multiway cut and multicut games. In: Proc. 8th Intl. Workshop Approximation and Online Algorithms, WAOA (to appear, 2010)
3. Anshelevich, E., Caskurlu, B.: Exact and approximate equilibria for optimal group network formation. In: Fiat,A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 239-250. Springer, Heidelberg (2009)
4. Anshelevich, E., Dasgupta, A., Kleinberg, J., Roughgarden, T., Tardos, É., Wexler, T.: The price of stability for network design with fair cost allocation. SIAM J. Comput. 38(4), 1602-1623 (2008)
5. Anshelevich, E., Dasgupta, A., Tardos, É., Wexler, T.: Near-optimal network design with selfish agents. Theory of Computing 4, 77-109 (2008)
6. Anshelevich, E., Karagiozova, A.: Terminal backup, 3D matching, and covering cubic graphs. In: Proc. 39th Symp. Theory of Computing (STOC), pp. 391-400 (2007)
7. Aumann, R.: Acceptable points in general cooperative n-person games. In: Contributions to the Theory of Games IV. Annals of Mathematics Study, vol. 40, pp. 287-324. Princeton University Press, Princeton (1959)
8. Bird, C.: On cost allocation for a spanning tree: A game theoretic approach. Networks 6, 335-350 (1976)
9. Calinescu, G., Karloff, H., Rabani, Y.: An improved approximation algorithm for multiway cut. J. Comput. Syst. Sci. 60(3), 564-574 (2000)
10. Cardinal, J., Hoefer, M.: Non-cooperative facility location and covering games. Theoret. Comput. Sci. 411(16-18), 1855-1876 (2010)
11. Chekuri, C., Chuzhoy, J., Lewin-Eytan, L., Naor, J., Orda, A.: Non-cooperative multicast and facility location games. IEEE J. Sel. Area Comm. 25(6), 1193-1206 (2007)
12. Chen, H.-L., Roughgarden, T., Valiant, G.: Designing network protocols for good equilibria. SIAM J. Comput. 39(5), 1799-1832 (2010)
13. Deng, X., Ibaraki, T., Nagamochi, H.: Algorithmic aspects of the core of combinatorial optimization games. Math. Oper. Res. 24(3), 751-766 (1999)
14. Epstein, A., Feldman,M., Mansour, Y.: Strong equilibrium in cost sharing connection games. Games Econom. Behav. 67(1), 51-68 (2009)
15. Goemans, M., Skutella, M.: Cooperative facility location games. J. Algorithms 50(2), 194-214 (2004)
16. Goemans, M., Williamson, D.: A general approximation technique for constrained forest problems. SIAM J. Comput. 24(2), 296-317 (1995)
17. Granot, D.: A generalized linear production model: A unifying model. Math. Prog. 34, 212-222 (1986)
18. Granot, D., Huberman, G.: On minimum cost spanning tree games. Math. Prog. 21, 1-18 (1981)
19. Granot, D., Maschler, M.: Spanning network games. Intl. J. Game Theory 27, 467-500 (1998)
20. Hoefer, M.: Non-cooperative tree creation. Algorithmica 53(1), 104-131 (2009)
21. Hoefer, M.: Strategic cooperation in cost sharing games. arXiv 1003.3131 (March 2010)
22. Immorlica, N., Mahdian, M., Mirrokni, V.: Limitations of cross-monotonic cost sharing schemes. ACM Trans. Algorithms 4(2) (2008); Special Issue SODA 2005
23. Könemann, J., Leonardi, S., Schäfer, G., van Zwam, S.: A group-strategyproof cost sharing mechanism for the Steiner forest game. SIAM J. Comput. 37(5), 1319-1341 (2008)
24. Owen, G.: On the core of linear production games. Math. Prog. 9, 358-370 (1975)
25. Prodon, A., Libeling, T., Gröflin, H.: Steiner's problem on two-trees. Technical report, Départment de Mathemátiques, EPF Lausanne (1985); Working paper RO 850315
26. Tamir, A.: On the core of network synthesis games. Math. Prog. 50, 123-135 (1991)