Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games

Proceedings of the ACM Conference on Electronic Commerce

Volumn , Issue , 2010, Pages 73-82

  Bhalgat, Anand ^a   Chakraborty, Tanmoy ^a   Khanna, Sanjeev ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

approximation algorithms; cut games; party affiliation games; potential games; pure nash equilibrium

Indexed keywords

COMPUTING EQUILIBRIA; GENERAL CLASS; NASH DYNAMICS; NASH EQUILIBRIUM; PARTIAL ORDER; PARTY AFFILIATION GAMES; POLYNOMIAL FACTOR; POLYNOMIAL-TIME; POTENTIAL GAMES; PRE-PROCESSING; PURE NASH EQUILIBRIUM; SATISFIABILITY; STRONG CONTRAST;

CONGESTION CONTROL (COMMUNICATION); ELECTRONIC COMMERCE; POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 77954729853     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1807342.1807353     Document Type: Conference Paper

References (19)

1. H. Ackermann, H. Röglin, and B. Vöcking. On the impact of combinatorial structure on congestion games. In FOCS, pages 613-622, 2006.
2. E. Anshelevich, A. Dasgupta, J. M. Kleinberg, É. Tardos, T. Wexler, and T. Roughgarden. The price of stability for network design with fair cost allocation. In FOCS, pages 295-304, 2004.
3. B. Awerbuch, Y. Azar, A. Epstein, V. S. Mirrokni, and A. Skopalik. Fast convergence to nearly optimal solutions in potential games. In ACM Conference on Electronic Commerce, pages 264-273, 2008.
4. M.-F. Balcan, A. Blum, and Y. Mansour. Improved equilibria via public service advertising. In SODA, pages 728-737, 2009.
5. A. Bhalgat, T. Chakraborty, and S. Khanna. Nash dynamics in congestion games with similar resources. In WINE, pages 362-373, 2009.
6. S. Chien and A. Sinclair. Convergence to approximate nash equilibria in congestion games. In SODA, pages 169-178, 2007.
7. G. Christodoulou, V. S. Mirrokni, and A. Sidiropoulos. Convergence and approximation in potential games. In STACS, pages 349-360, 2006.
8. A. Fabrikant, C. H. Papadimitriou, and K. Talwar. The complexity of pure nash equilibria. In STOC, pages 604-612, 2004.
9. M. X. Goemans, E. L. Li, V. S. Mirrokni, and M. Thottan. Market sharing games applied to content distribution in ad-hoc networks. In MobiHoc, pages 55-66, 2004.
10. D. S. Johnson, C. H. Papadimitriou, and M. Yannakakis. How easy is local search? J. Comput. Syst. Sci., 37(1):79-100, 1988.
11. S. Khanna, M. Sudan, and D. P. Williamson. A complete classification of the approximability of maximization problems derived from boolean constraint satisfaction. In STOC, pages 11-20, 1997.
12. M. W. Krentel. On finding and verifying locally optimal solutions. SIAM J. Comput., 19(4):742-749, 1990.
13. D. Monderer and L. S. Shapley. Potential games. Games and Economic Behavior, 14:124-143, 1996.
14. S. Poljak. Integer linear programs and local search for max-cut. SIAM J. Comput., 24(4):822-839, 1995.
15. R. W. Rosenthal. A class of games possessing pure-strategy nash equilibria. International Journal of Game Theory, 2:65-67, 1973.
16. T. Roughgarden and É. Tardos. How bad is selfish routing? J. ACM, 49(2):236-259, 2002.
17. T. J. Schaefer. The complexity of satisfiability problems. In STOC, pages 216-226, 1978.
18. A. A. Schäffer and M. Yannakakis. Simple local search problems that are hard to solve. SIAM J. Comput., 20(1):56-87, 1991.
19. A. Skopalik and B. Vöcking. Inapproximability of pure nash equilibria. In STOC, pages 355-364, 2008.