Evolutionary equilibrium in Bayesian routing games: Specialization and niche formation

Theoretical Computer Science

Volumn 411, Issue 7-9, 2010, Pages 1054-1074

  Berenbrink, Petra ^a   Schulte, Oliver ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Bayesian Nash Equilibrium; Congestion game; Game theory

Indexed keywords

BAYESIAN; BAYESIAN NASH EQUILIBRIA; CONGESTION GAME; CONGESTION GAMES; DIFFERENT SIZES; DIFFERENT SPEED; EVOLUTIONARY PROCESS; EVOLUTIONARY STABILITY; EVOLUTIONARY STABLE STRATEGIES; FIXED SIZE; MIXED STRATEGY; NASH EQUILIBRIA; PARALLEL LINKS; POSITIVE PROBABILITY; STABLE EQUILIBRIUM; STEADY STATE; STRATEGIC INTERACTIONS; TASK ALLOCATION; USER COMMUNITIES;

BAYESIAN NETWORKS; BIOLOGY; TELECOMMUNICATION NETWORKS; THREE TERM CONTROL SYSTEMS;

GAME THEORY;

EID: 74849133394     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.11.015     Document Type: Article

References (41)

1. Battigalli P., Gilli M., and Molinari M.C. Learning and Convergence to Equilibrium in Repeated Strategic Interactions: An Introductory Survey. Ricerche Economiche vol. 46 (1992) 335-377
2. R. Beier, A. Czumaj, P. Krysta, B. Vöcking, Computing equilibria for congestion games with (im)perfect information, in: Proc. 13th Annual Symposium on Discrete Algorithms, SODA, 2004, pp. 746-755
3. Berenbrink P., Goldberg L.A., Goldberg P., and Martin R. Utilitarian resource assignment. Journal of Discrete Algorithms 4 4 (2006) 567-587
4. P. Berenbrink, O. Schulte, Evolutionary equilibrium in Bayesian routing games: Specialization and Niche formation, in: Proc. of 15th European Symposium on Algorithms, ESA, 2007, pp. 29-40
5. N.A.R. Bhat, K. Leyton-Brown, Computing Nash equilibria of action-graph games, in: Proc. of 20th Conference on Uncertainty in Artificial Intelligence, UAI, 2004, pp. 35-42
6. Broom M., Cannings C., and Vickers G.T. Multi-player matrix games. Bulletin of Mathematical Biology 59 5 (1997) 931-952
7. George Christodoulou, E. Koutsoupias, The price of anarchy of finite congestion games, in: Proc. of the 37th Annual Symposium on Theory of Computing, STOC, 2005, pp. 67-73
8. A. Czumaj, B. Vöcking, Tight bounds for worst-case equilibria, in: Proc. of 13th Annual Symposium on Discrete Algorithms, SODA, 2002, pp. 413-420
9. A. Czumaj, P. Krysta, B. Vöcking, Selfish traffic allocation for server farms, in: Proc. of 34th Annual Symposium on Theory of Computing, STOC, 2002, pp. 287-296
10. Ely J.C., and Sandholm W.H. Evolution in Bayesian games I: Theory. Games and Economic Behavior 53 1 (2005) 83-109
11. Etessami K., and Lochbihler A. The computational complexity of evolutionarily stable strategies. Electronic Colloquium on Computational Complexity 55 (2004)
12. A. Fabrikant, A. Luthra, E.N. Maneva, C.H. Papadimitriou, S. Shenker, On a network creation game, in: Proc. of 22nd Symposium on Principles of Distributed Computing, PODC, 2003, pp. 347-351
13. R. Feldmann, M. Gairing, T. Lücking, B. Monien, M. Rode, Nashification and the coordination ratio for a selfish routing game, in: Proc.of 30th International Colloquium on Automata, Languages and Programming, ICALP, 2003, pp. 514-526
14. S. Fischer, B. Vöcking, On the evolution of selfish routing, in: Proc. of 12th European Symposium on Algorithms, ESA, 2004, pp. 323-334
15. D. Fotakis, S. Kontogiannis, E. Koutsoupias, M. Mavronicolas, P. Spirakis, The structure and complexity of Nash equilibria for a selfish routing game, in: Proc. of 29th International Colloquium on Automata, Languages, and Programming, ICALP, 2002, pp. 123-134
16. Gairing M., Monien B., and Tiemann K. Selfish routing with incomplete information. Theory of Computing Systems 42 1 (2008) 91-130
17. M. Gairing, T. Lücking, M. Mavronicolas, B. Monien, Computing Nash equilibria for scheduling on restricted parallel links, in: Proc. of the 36th Annual Symposium on Theory of Computing, STOC, 2004, pp. 613-622
18. Georgiou C., Pavlides T., and Philippou A. Selfish routing in the presence of network uncertainty. Parallel Processing Letters 19 1 (2009) 141-157
19. Govindan S., Reny P.J., and Robson A.J. A short proof of Harsanyi's purification theorem. Games and Economic Behavior 45 2 (2003) 369-374
20. Hammerstein P., and Selten R. Game Theory and Evolutionary Biology. In: Aumann R.J., and Hart S. (Eds). Handbook of Game Theory vol. 2 (1994), Elsevier 929-993 (Chapter 2)
21. Harsanyi J.C. Games with incomplete information played by 'Bayesian players', Parts I, II, and III. Management Science 14 (1967) 159-182 pp. 320-334, and pp. 486-502
22. Harsanyi J.C. Games with randomly disturbed payoffs: A new rationale for mixed-strategy equilibrium points. International Journal of Game Theory 2 (1973) 1-23
23. Hofbauer J., and Sandholm W.H. Evolution in games with randomly disturbed payoffs. Journal of Economic Theory 132 (2007) 47-69
24. M.S. Kearns, S. Suri, Networks preserving evolutionary equilibria and the power of randomization, in: Proc. of the 7th Conference on Electronic Commerce 2006, 2006, pp. 200-207
25. S. Kontogiannis, P. Spirakis, The contribution of game theory to complex systems, in: Proc. of 10th Panhellenic Conference on Informatics, PCI, 2005, pp. 101-112
26. E. Koutsoupias, C.H. Papadimitriou, Worst-case equilibria, in: Proc. of the 16th Annual Symposium on Theoretical Aspects of Computer Science, STACS, 1999, pp. 404-413
27. T. Lücking, M. Mavronicolas, B. Monien, M. Rode, A new model for selfish routing, in: Proc. of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS, 2004, pp. 547-558
28. M. Mavronicolas, I. Milchtaich, B. Monien, K. Tiemann, Congestion games with player-specific constants, in: Proc. of Mathematical foundations of Computer Science, MFCS, 2007, pp. 633-644
29. M. Mavronicolas, P. Spirakis, The price of selfish routing, in: Proc. of the 33rd Annual Symposium on Theory of Computing, STOC, 2001, pp. 510-519
30. Maynard Smith J. Evolution and the Theory of Games (1982), Cambridge University Press
31. Milchtaich I. Congestion games with player-specific payoff functions. Games and Economic Behavior 13 1 (1996) 111-124
32. Nash J.F. Equilibrium points in N-person games. Proceedings of the National Academy of Sciences of the United States of America 36 (1950) 48-49
33. Nowak M. Evolutionary Dynamics: Exploring the Equations of Life (2006), Belknap Press
34. Osborne M.J., and Rubinstein A. A Course in Game Theory (1994), MIT Press
35. C.H. Papadimitriou, T. Roughgarden, Computing equilibria in multi-player games, in: Proc. of the Symposium on Discrete algorithms, SODA, 2005, pp. 82-91
36. Rosenthal R.W. A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory 2 (1973) 65-67
37. Roughgarden T., and Tardos É. How bad is selfish routing?. Journal of the ACM 49 2 (2002) 236-259
38. Sandholm W.H. Evolutionary implementation and congestion pricing. Review of Economic Studies 69 (2002) 667-689
39. Sandholm W.H. Evolution in Bayesian games II: Stability of purified equilibrium. Journal of Economic Theory 136 1 (2007) 641-667
40. van Damme E. Stability and Perfection of Nash Equilibria. 2nd edition (1991), Springer-Verlag, Berlin
41. Weibull J. Evolutionary Game Theory (1995), The MIT Press, Cambridge, MA