Strategic cooperation in cost sharing games
- 497 Downloads
We examine strategic cost sharing games with so-called arbitrary sharing based on various combinatorial optimization problems. These games have recently been popular in computer science to study cost sharing in the context of the Internet. We concentrate on the existence and computational complexity of strong equilibria (SE), in which no coalition can improve the cost of each of its members. Our main result reveals a connection to the core in coalitional cost sharing games studied in operations research. For set cover and facility location games this results in a tight characterization of the existence of SE using the integrality gap of suitable linear programming formulations. Furthermore, it allows to derive all existing results for SE in network design cost sharing games with arbitrary sharing via a unified approach. In addition, we show that in general there is no efficiency loss, i.e., the strong price of anarchy is always 1. Finally, we indicate how the LP-approach is useful for the computation of near-optimal and near-stable approximate SE.
KeywordsCost sharing Strong equilibrium Integrality gap Combinatorial optimization
Unable to display preview. Download preview PDF.
- Anshelevich E, Caskurlu B, Hate A (2010) Strategic multiway cut and multicut games. In: Proc. 8th intl. workshop approximation and online algorithms (WAOA), pp 1–12Google Scholar
- Aumann R (1959) Acceptable points in general cooperative n-person games. In: Contributions to the theory of games IV, vol 40 of annals of mathematics study. Princeton University Press, Princeton, pp 287–324Google Scholar
- Hoefer M (2010) Strategic cooperation in cost sharing games. In: Proc. 6th intl workshop Internet and network economics (WINE), pp 258–269Google Scholar
- Hoefer M, Krysta P (2005) Geometric network design with selfish agents. In: Proc. 11th conf. computing and combinatorics (COCOON), pp 167–178Google Scholar
- Immorlica N, Mahdian M, Mirrokni V (2008) Limitations of cross-monotonic cost sharing schemes. ACM Trans Algorithms 4(2). doi: 10.1145/1361192.1361201
- Jain K, Mahdian M (2007) Cost sharing. In: Nisan N, Tardos É, Roughgarden T, Vazirani V (eds) Algorithmic game theory, chapter 15. Cambridge University Press, CambridgeGoogle Scholar
- Jain K, Vazirani V (2001) Applications of approximation algorithms to cooperative games. In: Proc. 33rd symp. theory of computing (STOC), pp 364–372Google Scholar
- Leonardi S, Sankowski P (2007) Network formation games with local coalitions. In Proc. 26th symp. principles of distributed computing (PODC), pp 299–305Google Scholar
- Pál M, Tardos É (2003) Group strategyproof mechanisms via primal-dual algorithms. In: Proc. 44th symp. foundations of computer science (FOCS), pp 584–593Google Scholar
- Prodon A, Libeling TM, Gröflin H (1985) Steiner’s problem on two-trees. Technical report, Départment de Mathemátiques, EPF Lausanne. Working paper RO 850315Google Scholar
- Young HP (1994) Cost allocation. In: Aumann R, Hart S (eds) Handbook of game theory with economic applications vol 2, Chap 34. North-Holland Science Publishers, Amsterdam, pp 1194–1235Google Scholar