Minimal Subsidies in Expense Sharing Games

A key solution concept in cooperative game theory is the core. The core of an expense sharing game contains stable allocations of the total cost to the participating players, such that each subset of players pays at most what it would pay if acting on its own. Unfortunately, some expense sharing games have an empty core, meaning that the total cost is too high to be divided in a stable manner. In such cases, an external entity could choose to induce stability using an external subsidy. We call the minimal subsidy required to make the core of a game non-empty the Cost of Stability (CoS), adopting a recently coined term for surplus sharing games. We provide bounds on the CoS for general, subadditive and anonymous games, discuss the special case of Facility Games, as well as consider the complexity of computing the CoS of the grand coalition and of coalitional structures.

[1]  Joseph Naor,et al.  Non-Cooperative Cost Sharing Games via Subsidies , 2009, Theory of Computing Systems.

[2]  J. M. Bilbao,et al.  Cooperative Games on Combinatorial Structures , 2000 .

[3]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[4]  Moshe Tennenholtz,et al.  k-Implementation , 2003, EC '03.

[5]  Jeffrey S. Rosenschein,et al.  Coalitional skill games , 2008, AAMAS.

[6]  B. Peleg,et al.  Introduction to the Theory of Cooperative Games , 1983 .

[7]  Daniel Granot,et al.  Minimum cost spanning tree games , 1981, Math. Program..

[8]  R. J. Aumann,et al.  Cooperative games with coalition structures , 1974 .

[9]  Nikhil R. Devanur,et al.  Strategyproof cost-sharing mechanisms for set cover and facility location games , 2003, EC '03.

[10]  Ely Porat,et al.  Power and stability in connectivity games , 2008, AAMAS.

[11]  László Lovász,et al.  On the ratio of optimal integral and fractional covers , 1975, Discret. Math..

[12]  Vijay V. Vazirani,et al.  Applications of approximation algorithms to cooperative games , 2001, STOC '01.

[13]  Jeffrey S. Rosenschein,et al.  The Cost of Stability in Network Flow Games , 2009, MFCS.

[14]  Jeffrey S. Rosenschein,et al.  Power in threshold network flow games , 2009, Autonomous Agents and Multi-Agent Systems.

[15]  Ely Porat,et al.  Path disruption games , 2010, AAMAS.

[16]  Éva Tardos,et al.  Group strategy proof mechanisms via primal-dual algorithms , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[17]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[18]  Darko Skorin-Kapov On the core of the minimum cost steiner tree game in networks , 1995, Ann. Oper. Res..

[19]  Jörg Rothe,et al.  The Cost of Stability in Coalitional Games , 2009, SAGT.

[20]  Felix Brandt,et al.  Monotone cooperative games and their threshold versions , 2010, AAMAS.

[21]  Yoav Shoham,et al.  Marginal contribution nets: a compact representation scheme for coalitional games , 2005, EC '05.

[22]  Nicole Immorlica,et al.  Limitations of cross-monotonic cost sharing schemes , 2005, SODA '05.

[23]  Daniel J. Kleitman,et al.  Cost allocation for a spanning tree , 1973, Networks.

[24]  Jörg Rothe,et al.  The cost of stability in weighted voting games , 2009, AAMAS.

[25]  Rastislav Královič,et al.  Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings , 2009, MFCS.

[26]  Nimrod Megiddo,et al.  Cost allocation for steiner trees , 1978, Networks.