Minimal subsidies in expense sharing games

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

Volumn 6386 LNCS, Issue M4D, 2010, Pages 347-358

  Meir, Reshef ^a   Bachrach, Yoram ^b   Rosenschein, Jeffrey S ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b MICROSOFT RESEARCH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ANONYMOUS GAMES; COOPERATIVE GAME THEORY; EMPTY CORE; KEY SOLUTION; TOTAL COSTS;

TRANSITION METAL COMPOUNDS;

GAME THEORY;

EID: 78649546946     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16170-4_30     Document Type: Conference Paper

References (25)

1. Aumann, R. J., Dréze, J. H.: Cooperative games with coalition structures. International Journal of Game Theory 3, 217-237 (1974)
2. Aziz, H., Brandt, F., Harrenstein, P.: Monotone cooperative games and their threshold versions. In: AAMAS 2010, pp. 1017-1024 (2010)
3. Bachrach, Y., Elkind, E., Meir, R., Pasechnik, D., Zuckerman, M., Rothe, J., Rosenschein, J. S.: The cost of stability in coalitional games. In: Mavronicolas, M., Papadopoulou, V. G. (eds.) SAGT 2009. LNCS, vol. 5814, pp. 122-134. Springer, Heidelberg (2009)
4. Bachrach, Y., Meir, R., Zuckerman, M., Rothe, J., Rosenschein, J. S.: The cost of stability in weighted voting games (extended abstract). In: AAMAS 2009, pp. 1289-1290 (2009)
5. Bachrach, Y., Rosenschein, J. S.: Coalitional skill games. In: AAMAS 2008, pp. 1023-1030 (2008)
6. Bachrach, Y., Rosenschein, J. S.: Power in threshold network flow games. Autonomous Agents and Multi-Agent Systems 18(1), 106-132 (2009)
7. Bachrach, Y., Rosenschein, J. S., Porat, E.: Power and stability in connectivity games. In: AAMAS 2008, pp. 999-1006 (2008)
8. Bilbao, J. M.: Cooperative Games on Combinatorial Structures. Kluwer Publishers, Dordrecht (2000)
9. Brânzei, S., Larson, K.: Coalitional affinity games and the stability gap. In: IJCAI 2009, pp. 79-84 (2009)
10. Buchbinder, N., Lewin-Eytan, L., Naor, J (S.), Orda, A.: Non-cooperative cost sharing games via subsidies. In: Monien, B., Schroeder, U.-P. (eds.) SAGT 2008. LNCS, vol. 4997, pp. 337-349. Springer, Heidelberg (2008)
11. Claus, A., Kleitman, D. J.: Cost allocation for a spanning tree. Networks 3, 289-304 (1973)
12. Devanur, N. R., Mihail, M., Vazirani, V. V.: Strategyproof cost-sharing mechanisms for set cover and facility location games. Decision Support Systems 39, 11-22 (2005)
13. Granot, D., Huberman, G.: Minimum cost spanning tree games. Mathematical Programming 21, 1-18 (1981)
14. Ieong, S., Shoham, Y.: Marginal contribution nets: a compact representation scheme for coalitional games. In: ACM EC 2005, pp. 193-202 (2005)
15. Immorlica, N., Mahdian, M., Mirrokni, V. S.: Limitations of cross-monotonic cost sharing schemes. In: SODA 2005, pp. 602-611 (2005)
16. Jain, K., Vazirani, V. V.: Applications of approximation algorithms to cooperative games. In: STOC 2001, pp. 364-372 (2001)
17. Lovász, L.: On the ratio of optimal integral and fractional covers. Discrete Mathematics 13, 383-390 (1975)
18. Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. John Wiley & Sons, Chichester (1990)
19. Megiddo, N.: Cost allocation for steiner trees. Networks 8, 1-6 (1978)
20. Monderer, D., Tennenholtz, M.: k-implementation. In: ACM EC 2003, pp. 19-28 (2003)
21. Pál, M., Tardos, É.: Group strategy proof mechanisms via primal-dual algorithms. In: FOCS 2003, pp. 584-593 (2003)
22. Peleg, B., Sudhölter, P.: Introduction to the Theory of Cooperative Games. Kluwer Publishers, Dordrecht (2003)
23. Resnick, E., Bachrach, Y., Meir, R., Rosenschein, J. S.: The cost of stability in network flow games. In: Královič, R., Niwiński, D. (eds.) MFCS 2009. LNCS, vol. 5734, pp. 636-650. Springer, Heidelberg (2009)
24. Skorin-Kapov, D.: On the core of the minimum cost steiner tree game in networks. Annals of Operations Research 57, 233-249 (1995)
25. Vazirani, V. V.: Approximation Algorithms. Springer, Heidelberg (2001)