Strategic Cooperation in Cost Sharing Games
- Martin HoeferAffiliated withDept. of Computer Science, RWTH Aachen University
In this paper we consider a large variety of strategic cost sharing games with so-called arbitrary sharing based on various combinatorial optimization problems, such as vertex and set cover, facility location, and network design problems. We concentrate on the existence and computational complexity of strong equilibria, in which no coalition can decrease the cost of every member.
Our main result reveals a connection between strong equilibrium in strategic games and the core in traditional coalitional cost sharing games studied in economics. For set cover and facility location games this results in a tight characterization of the existence of strong equilibrium using the integrality gap of suitable linear programming formulations.In addition, we are able to show that in general the strong price of anarchy is always 1, whereas the price of anarchy is known to be Θ(n) for Nash equilibria. Finally, we indicate that the LP-approach can also be used to compute near-optimal and near-stable approximate strong equilibria.
- Strategic Cooperation in Cost Sharing Games
- Book Title
- Internet and Network Economics
- Book Subtitle
- 6th International Workshop, WINE 2010, Stanford, CA, USA, December 13-17, 2010. Proceedings
- pp 258-269
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- Additional Links
- Industry Sectors
- eBook Packages
To view the rest of this content please follow the download PDF link above.