Contribution games in networks

Algorithmica

Volumn 63, Issue 1-2, 2012, Pages 51-90

  Anshelevich, Elliot ^a   Hoefer, Martin ^b  

^a Rensselaer Polytechnic Institute   (United States)

^b RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Approximate equilibrium; Contribution games; Convergence; Equilibrium computation; Pairwise equilibrium; Price of anarchy; Strong equilibrium

Indexed keywords

APPROXIMATE EQUILIBRIUMS; CONTRIBUTION GAMES; CONVERGENCE; PRICE OF ANARCHY; STRONG EQUILIBRIUM;

FUNCTIONS;

EID: 84858864726     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-011-9520-7     Document Type: Article

References (33)

1. Ackermann, H., Goldberg, P., Mirrokni, V., Röglin, H., Vöcking, B.: Uncoordinated two-sided matching markets. SIAM J. Comput. 40(1), 92-106 (2011
2. Albers, S., Eilts, S., Even-Dar, E., Mansour, Y., Roditty, L.: On Nash equilibria for a network creation game. In: Proc. 17th Symp. Discrete Algorithms (SODA), pp. 89-98 (2006 (Pubitemid 43275228)
3. Alós-Ferrer, C., Weidenholzer, S.: Imitation in minimum effort network games. Unpublished manuscript (2010
4. Andelman, N., Feldman, M., Mansour, Y.: Strong price of anarchy. Games Econ. Behav. 65(2), 289-317 (2009
5. Anderson, S., Goeree, J., Holt, C.:Minimum-effort coordination games: Stochastic potential and logit equilibrium. Games Econ. Behav. 34(2), 177-199 (2001 (Pubitemid 33668150)
6. Anshelevich, E., Das, S., Naamad, Y.: Anarchy, stability, and utopia: Creating better matchings. In: Proc. 2nd Intl. Symp. Algorithmic Game Theory (SAGT), pp. 159-170 (2009
7. Babaioff, M., Feldman, M., Nisan, N.: Combinatorial agency. In: Proc. 7th Conf. Electronic Commerce (EC), p. 28 (2006
8. Babaioff, M., Feldman, M., Nisan, N.: Free-riding and free-labor in combinatorial agency. In: Proc. 2nd Intl. Symp. Algorithmic Game Theory (SAGT), pp. 109-121 (2009
9. Ballester, C., Calvó-Armengol, A., Zenou, Y.: Who's who in networks. Wanted: The key player. Econometrica 74(5), 1403-1417 (2006 (Pubitemid 44359263)
10. Bei, X., Chen, W., Teng, S.-H., Zhang, J., Zhu, J.: Bounded budget betweenness centrality game for strategic network formations. In: Proc. 17th European Symposium on Algorithms (ESA), pp. 227-238 (2009
11. Bhaskar, U., Fleischer, L., Hoy, D., Huang, C.-C.: Equilibria of atomic flow games are not unique. In: Proc. 20th Symp. Discrete Algorithms (SODA), pp. 748-757 (2009
12. Bloch, F., Dutta, B.: Communication networks with endogenous link strength. Games Econ. Behav. 66(1), 39-56 (2009
13. Bornstein, G., Gneezy, U., Nagel, R.: The effect of intergroup competition on group coordination: An experimental study. Games Econ. Behav. 41(1), 1-25 (2002
14. Bramoullé, Y., Kranton, R.: Public goods in networks. J. Econ. Theory 135(1), 478-494 (2007
15. Brandes, U., Hoefer, M., Nick, B.: Network creation games with disconnected equilibria. In: Proc. 4th Intl. Workshop Internet & Network Economics (WINE), pp. 394-401 (2008
16. Chakraborty, T., Kearns, M., Khanna, S.: Network bargaining: Algorithms and structural results. In: Proc. 10th Conf. Electronic Commerce (EC), pp. 159-168 (2009
17. Chaudhuri, A., Schotter, A., Sopher, B.: Talking ourselves to efficiency: Coordination in intergenerational minimum effort games with private, almost common and common knowledge of advice. Econ. J. 119(534), 91-122 (2008
18. Cominetti, R., Correa, J., Moses, N.S.: The impact of oligopolistic competition in networks. Oper. Res. 57(6), 1421-1437 (2009
19. Conitzer, V., Sandholm, T.: Expressive negotiation over donations to charities. In: Proc. 5th Conf. Electronic Commerce (EC), pp. 51-60 (2004
20. Corbo, J., Calvó-Armengol, A., Parkes, D.: The importance of network topology in local contribution games. In: Proc. 3rd Intl. Workshop Internet & Network Economics (WINE), pp. 388-395 (2007 (Pubitemid 351145011)
21. Daskalakis, C., Papadimitriou, C.: On a network generalization of the Minmax theorem. In: Proc. 36th Intl. Coll. Automata, Languages and Programming (ICALP), pp. 423-434 (2009
22. Davis, J., Goldman, Z., Hilty, J., Koch, E., Liben-Nowell, D., Sharp, A., Wexler, T., Zhou, E.: Equilibria and efficiency loss in games on networks. In: Proc. 2009 Intl. Conf. Computational Science and Engineering, vol. 4, pp. 82-89 (2009
23. Devetag, G., Ortmann, A.: When and why? A critical survey on coordination failure in the laboratory. Exp. Econ. 10(3), 331-344 (2007
24. Dufwenberg, M., Gneezy, U.: Gender and coordination. In: Rapoport, A., Zwick, R. (eds.) Experimental Business Research, vol. 3, pp. 253-262. Kluwer, Dordrecht (2005
25. Fabrikant, A., Luthera, A., Maneva, E., Papadimitriou, C., Shenker, S.: On a network creation game. In: Proc. 22nd Symp. Principles of Distributed Computing (PODC), pp. 347-351 (2003
26. Fatas, E., Neugebauer, T., Perote, J.: Within-team competition in the minimum effort coordination game. Pac. Econ. Rev. 11(2), 247-266 (2006 (Pubitemid 43842284)
27. Ghosh, A., Mahdian, M.: Charity auctions on social networks. In: Proc. 19th Symp. Discrete Algorithms (SODA), pp. 1019-1028 (2008
28. Gusfield, D., Irving, R.: The Stable Marriage Problem: Structure and Algorithms. MIT Press, Cambridge (1989
29. Hoefer, M., Suri, S.: Dynamics in network interaction games. In: Proc. 23rd Intl. Symp. Distributed Computing (DISC), pp. 294-308 (2009
30. Jackson, M.: Social and Economic Networks. Princeton University Press, Princeton (2008
31. Jackson, M.,Wolinsky, A.: A strategic model of social and economic networks. J. Econ. Theory 71(1), 44-74 (1996 (Pubitemid 126170094)
32. Kleinberg, J., Suri, S., Tardos, É., Wexler, T.: Strategic network formation with structural holes. In: Proc. 9th Conf. Electronic Commerce (EC), pp. 284-293 (2008
33. Kleinberg, J., Tardos, É.: Balanced outcomes in social exchange networks. In: Proc. 40th Symp. Theory of Computing (STOC), pp. 295-304 (2008