Equilibria and efficiency loss in games on networks

Proceedings - 12th IEEE International Conference on Computational Science and Engineering, CSE 2009

Volumn 4, Issue , 2009, Pages 82-89

  Davis, Joshua R ^a   Goldman, Zachary ^b   Hilty, Jacob ^a   Koch, Elizabeth N ^a   Liben Nowell, David ^a   Sharp, Alexa ^c   Wexler, Tom ^b,c   Zhou, Emma ^a  

^a CARLETON COLLEGE   (United States)

^b DENISON UNIVERSITY   (United States)

^c OBERLIN COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COSTS AND BENEFITS; DIFFUSION OF INNOVATIONS; EFFICIENCY LOSS; GAME-THEORETIC PERSPECTIVES; GENERIC MECHANISM; GUARANTEED CONVERGENCE; MULTIPLAYER GAMES; NETWORKED GAMES; PRICE OF ANARCHY; PURE NASH EQUILIBRIUM; SOCIAL CONTEXT; SOCIAL NETWORKS; STRATEGIC DECISIONS; STRATEGIC INTERACTIONS;

BEHAVIORAL RESEARCH; COMPUTER SCIENCE;

GAME THEORY;

EID: 70849128247     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSE.2009.45     Document Type: Conference Paper

References (35)

1. M.-F. Balcan, A. Blum, and Y. Mansour, "Improved equilibria via public service advertising, " in Proc. Symp. on Discrete Algorithms (SODA), 2009, pp. 728-737.
2. A.-L. Barabási and R. Albert, "Emergence of scaling in random networks, " Science, vol. 286, pp. 509-512, 1999.
3. O. Ben-Zwi and A. Ronen, "The local and global price of anarchy of graphical games, " in Proc. Symp. on Algorithmic Game Theory (SAGT), 2008, pp. 255-266.
4. G. Christodoulou, V. Mirrokni, and A. Sidiropoulos, "Convergence and approximation in potential games, " in Proc. Symp. on Theoretical Aspects of CS (STACS), 2006, pp. 349-360.
5. M. Chwe, "Communication and coordination in social networks, " Rev. of Econ. Studies, vol. 67, no. 1, pp. 1-16, Jan. 2000.
6. C. Daskalakis and C. H. Papadimitriou, "Computing pure Nash equilibria in graphical games via Markov Random Fields, " in Proc. Conf. on Electronic Commerce (EC), 2006, pp. 91-99.
7. B. Dilkina, C. P. Gomes, and A. Sabharwal, "The impact of network topology on pure Nash equilibria in graphical games, " in AAAI Conference on Artificial Intelligence, 2007, pp. 42-49.
8. E. Elkind, L. A. Goldberg, and P. W. Goldberg, "Nash equilibria in graphical games on trees revisited, " in Proc. Conf. on Electronic Commerce (EC), 2006, pp. 100-109.
9. -, "Computing good Nash equilibria in graphical games, " in Proc. Conf. on Electronic Commerce (EC), 2007, pp. 162-171.
10. A. Fabrikant, C. Papadimitriou, and K. Talwar, "The complexity of pure Nash equilibria, " in Proc. Symp. on Theory of Computing (STOC), 2004, pp. 604-612.
11. D. Fudenberg and D. K. Levine, The Theory of Learning in Games. MIT Press, 1998.
12. A. Galeotti, S. Goyal, M. Jackson, F. Vega-Redondo, and L. Yariv, "Network games, " Rev. of Econ. Studies, 2009, to appear.
13. G. Gottlob, G. Greco, and F. Scarcello, "Pure Nash equilibria: hard and easy games, " Journal of Artificial Intelligence Research, vol. 24, pp. 357-406, 2005.
14. S. Goyal, Connections: An Introduction to the Economics of Networks. Princeton University Press, 2007.
15. N. Immorlica, J. Kleinberg, M. Mahdian, and T. Wexler, "The role of compatibility in the diffusion of technologies through social networks, " in Proc. Conf. on Electronic Commerce (EC), 2007, pp. 75-83.
16. M. Jackson and L. Yariv, "Diffusion on social networks, " Ećonomie Publique, vol. 16, no. 1, pp. 3-16, 2005.
17. -, "Diffusion of behavior and equilibrium properties in network games, " American Economic Review, vol. 97, no. 2, pp. 92-98, May 2007.
18. -, "Diffusion, strategic interaction, and social structure, " in Handbook of Social Economics, J. Benhabib, A. Bisin, and M. O. Jackson, Eds. Elsevier, 2009, to appear.
19. M. O. Jackson, Social and Economic Networks. Princeton University Press, 2008.
20. S. Kakade, M. Kearns, J. Langford, and L. Ortiz, "Correlated equilibria in graphical games, " in Proc. Conf. on Electronic Commerce (EC), 2003, pp. 42-47.
21. M. L. Katz and C. Shapiro, "Network externalities, competition, and compatibility, " Am. Econ. Rev., vol. 75, no. 3, pp. 424-440, 1985.
22. M. Kearns, "Graphical games, " in Algorithmic Game Theory, N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani, Eds. Cambridge University Press, 2007, pp. 159-178.
23. M. Kearns and S. Suri, "Networks preserving evolutionary equilibria and the power of randomization, " in Proc. Conf. on Electronic Commerce (EC), 2006, pp. 200-207.
24. M. J. Kearns, M. L. Littman, and S. P. Singh, "Graphical models for game theory, " in Proceedings of the Conference in Uncertainty in Artificial Intelligence (UAI), 2001, pp. 253-260.
25. J. Kleinberg, "The small-world phenomenon: An algorithmic perspective, " in Proc. Symp. on Theory of Computing (STOC), Jun. 2000, pp. 163-170.
26. S. J. Liebowitz and S. E. Margolis, "Network externality: An uncommon tragedy, " Journal of Economic Perspectives, vol. 8, no. 2, pp. 133-150, Spring 1994.
27. M. McPherson, L. Smith-Lovin, and J. M. Cook, "Birds of a feather: Homophily in social networks, " Annual Review of Sociology, vol. 27, pp. 415-444, Aug. 2001.
28. S. Morris, "Contagion, " Rev. of Econ. Studies, vol. 67, pp. 57-78, 2000.
29. J. Nash, "Non cooperative games, " Annals of Mathematics, vol. 54, pp. 286-295, 1951.
30. C. Papadimitriou, "The complexity of finding Nash equilibria, " in Algorithmic Game Theory, N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani, Eds. Cambridge Univ. Press, 2007, pp. 29-51.
31. E. Rogers, Diffusion of innovations, 4th ed. Free Press, 1995.
32. D. Strang and S. Soule, "Diffusion in organizations and social movements: From hybrid corn to poison pills, " Annual Review of Sociology, vol. 24, pp. 265-290, 1998.
33. T. Valente, Network Models of the Diffusion of Innovations. Hampton Press, 1995.
34. D. J. Watts and S. H. Strogatz, "Collective dynamics of 'smallworld' networks, " Nature, vol. 393, pp. 440-442, 1998.
35. H. P. Young, Individual Strategy and Social Structure: An Evolutionary Theory of Institutions. Princeton University Press, 1998.