Strong equilibrium in cost sharing connection games
AbstractWe study network games in which each player wishes to connect his source and sink, and the cost of each edge is shared among its users either equally (in Fair Connection Games--FCG's) or arbitrarily (in General Connection Games--GCG's). We study the existence and quality of strong equilibria (SE)--strategy profiles from which no coalition can improve the cost of each of its members--in these settings. We show that SE always exist in the following games: (1) Single source and sink FCG's and GCG's. (2) Single source multiple sinks FCG's and GCG's on series parallel graphs. (3) Multi source and sink FCG's on extension parallel graphs. As for the quality of the SE, in any FCG with n players, the cost of any SE is bounded by H(n) (i.e., the harmonic sum), contrasted with the [Theta](n) price of anarchy. For any GCG, any SE is optimal.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal Games and Economic Behavior.
Volume (Year): 67 (2009)
Issue (Month): 1 (September)
Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/622836
Strong equilibrium Price of anarchy Strong price of anarchy Coalitions Cost sharing Network design;
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Monderer, Dov & Shapley, Lloyd S., 1996. "Potential Games," Games and Economic Behavior, Elsevier, vol. 14(1), pages 124-143, May.
- Bernheim, B. Douglas & Peleg, Bezalel & Whinston, Michael D., 1987. "Coalition-Proof Nash Equilibria I. Concepts," Journal of Economic Theory, Elsevier, vol. 42(1), pages 1-12, June.
- Hervé Moulin & Scott Shenker, 2001. "Strategyproof sharing of submodular costs:budget balance versus efficiency," Economic Theory, Springer, vol. 18(3), pages 511-533.
- Holzman, Ron & Law-Yone, Nissan, 1997. "Strong Equilibrium in Congestion Games," Games and Economic Behavior, Elsevier, vol. 21(1-2), pages 85-101, October.
- Milchtaich, Igal, 2006. "Network topology and the efficiency of equilibrium," Games and Economic Behavior, Elsevier, vol. 57(2), pages 321-346, November.
- Moulin, Herve & Shenker, Scott, 1992. "Serial Cost Sharing," Econometrica, Econometric Society, vol. 60(5), pages 1009-37, September.
- Holzman, Ron & Law-yone (Lev-tov), Nissan, 2003. "Network structure and strong equilibrium in route selection games," Mathematical Social Sciences, Elsevier, vol. 46(2), pages 193-205, October.
- Ruben Juarez & Rajnish Kumar, 2012.
"Implementing Efficient Graphs in Connection Networks,"
201203, University of Hawaii at Manoa, Department of Economics.
- Ruben Juarez & Rajnish Kumar, 2013. "Implementing efficient graphs in connection networks," Economic Theory, Springer, vol. 54(2), pages 359-403, October.
- Rajnish Kumar & Ruben Juarez, . "Implementing Efficient Graphs in Connection Networks," Departmental Working Papers 2011-03, Department of Economics, Louisiana State University.
- Ruben Juarez & Rajnish Kumar, 2010. "Implementing Efficient Graphs in Connection Networks," Working Papers 201022, University of Hawaii at Manoa, Department of Economics.
- Martin Hoefer, 2013. "Strategic cooperation in cost sharing games," International Journal of Game Theory, Springer, vol. 42(1), pages 29-53, February.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.