Nash dynamics in congestion games with similar resources

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5929 LNCS, Issue , 2009, Pages 362-373

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

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMMETRIC GAMES; COMPUTING EQUILIBRIA; CONGESTION GAMES; CONGESTION LEVEL; CONVERGENCE RESULTS; DELAY FUNCTION; LIVENESS; NASH DYNAMICS; POLYNOMIAL FACTOR; PURE NASH EQUILIBRIUM; STRATEGY SPACE;

CONGESTION CONTROL (COMMUNICATION); DYNAMICS; GAME THEORY; INTERNET; POLYNOMIALS; WINE;

ORTHOGONAL FUNCTIONS;

EID: 76649117165     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10841-9_33     Document Type: Conference Paper

References (12)

1. Ackermann, H., Röglin, H., Vöcking, B.: On the impact of combinatorial structure on congestion games. In: FOCS, pp. 613-622 (2006)
2. Awerbuch, B., Azar, Y., Epstein, A., Mirrokni, V.S., Skopalik, A.: Fast convergence to nearly optimal solutions in potential games. In: ACM Conference on Electronic Commerce, pp. 264-273 (2008)
3. Chien, S., Sinclair, A.: Convergence to approximate nash equilibria in congestion games. In: SODA, pp. 169-178 (2007)
4. Christodoulou, G., Mirrokni, V.S., Sidiropoulos, A.: Convergence and approximation in potential games. In: STACS, pp. 349-360 (2006)
5. Fabrikant, A., Papadimitriou, C.H., Talwar, K.: The complexity of pure nash equilibria. In: STOC, pp. 604-612 (2004)
6. Goemans, M.X., Li, L., Mirrokni, V.S., Thottan, M.: Market sharing games applied to content distribution in ad hoc networks. IEEE Journal on Selected Areas in Communications 24(5), 1020-1033 (2006)
7. Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: How easy is local search? J. Comput. Syst. Sci. 37(1), 79-100 (1988)
8. Nash, J.F.: Noncooperative games. Annals of Mathematics 54, 289-295 (1951)
9. Rosenthal, R.W.: A class of games possessing pure-strategy nash equilibria. International Journal of Game Theory 2, 65-67 (1973)
10. Roughgarden, T., Tardos, É.: How bad is selfish routing? J. ACM 49(2), 236-259 (2002)
11. Skopalik, A., Vöcking, B.: Inapproximability of pure nash equilibria. In: STOC, pp. 355-364 (2008)
12. Tardos, E., Wexler, T.: Network formation games and the potential function method. In: Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V. (eds.) Algorithmic Game Theory, ch. 19. Cambridge University, Cambridge (2007)