Weighted congestion games with separable preferences

Games and Economic Behavior

Volumn 67, Issue 2, 2009, Pages 750-757

  Milchtaich, Igal ^a  

^a BAR ILAN UNIVERSITY   (Israel)

Author keywords

Congestion games; Finite improvement property; Potential; Pure equilibrium; Separable preferences

Indexed keywords

EID: 70349312947     PISSN: 08998256     EISSN: 10902473     Source Type: Journal    
DOI: 10.1016/j.geb.2009.03.009     Document Type: Article

References (19)

1. Brown J.S. Game theory and habitat selection. In: Dugatkin L.A., and Reeve H.K. (Eds). Game Theory and Animal Behavior (1998), Oxford Univ. Press, Oxford 188-220
2. Correa J.R., Schulz A.S., and Stier-Moses N.E. A geometric approach to the price of anarchy in nonatomic congestion games. Games Econ. Behav. 64 (2008) 457-469
3. Even-Dar E., Kesselman A., and Mansour Y. Convergence time to Nash equilibria. In: Baeten J.C.M., Lenstra J.K., Parrow J., and Woeginger G.J. (Eds). Automata, Languages and Programming (ICALP 2003). Lecture Notes in Comput. Sci. vol. 2719 (2003), Springer-Verlag, Berlin 502-513
4. Fabrikant A., Papadimitriou C., and Talwar K. The complexity of pure Nash equilibria. Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC 2004) (2004), ACM 604-612
5. Facchini G., Van Megen F., Borm P., and Tijs S. Congestion models and weighted Bayesian potential games. Theory Dec. 42 (1997) 193-206
6. Feller W. An Introduction to Probability Theory and Its Applications, vol. 1. third ed (1968), Wiley, New York
7. Fotakis D., Kontogiannis S., and Spirakis P. Selfish unsplittable flows. Theoret. Comput. Sci. 348 (2005) 226-239
8. Gairing M., Monien B., and Tiemann K. Routing (un-) splittable flow in games with player-specific linear latency functions. In: Bugliesi M., Preneel B., Sassone V., and Wegener I. (Eds). Automata, Languages and Programming (ICALP 2006), Part I. Lecture Notes in Comput. Sci. vol. 4051 (2006), Springer-Verlag, Berlin 501-512
9. Georgiou C., Pavlides T., and Philippou A. Network uncertainty in selfish routing. Proceedings of the 20th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2006) (2006), IEEE 85
10. Hollard G. On the existence of a pure strategy Nash equilibrium in group formation games. Econ. Lett. 66 (2000) 283-287
11. Konishi H., Le Breton M., and Weber S. Pure strategy Nash equilibrium in a group formation game with positive externalities. Games Econ. Behav. 21 (1997) 161-182
12. Libman L., and Orda A. Atomic resource sharing in noncooperative networks. Telecom. Systems 17 (2001) 385-409
13. Mavronicolas M., Milchtaich I., Monien B., and Tiemann K. Congestion games with player-specific constants. In: Kučera L., and Kučera A. (Eds). Mathematical Foundations of Computer Science (MFCS 2007). Lecture Notes in Comput. Sci. vol. 4708 (2007), Springer-Verlag, Berlin 633-644
14. Milchtaich I. Congestion games with player specific payoff functions. Games Econ. Behav. 13 (1996) 111-124
15. Milchtaich I. Network topology and the efficiency of equilibrium. Games Econ. Behav. 57 (2006) 321-346
16. Milchtaich I. The equilibrium existence problem in finite network congestion games. In: Spirakis P., Mavronicolas M., and Kontogiannis S. (Eds). Internet and Network Economics (WINE 2006). Lecture Notes in Comput. Sci. vol. 4286 (2006), Springer-Verlag, Berlin 87-98
17. Milchtaich, I., 2009. Network topology and equilibrium existence in weighted network congestion games. Mimeo
18. Monderer D., and Shapley L. Potential games. Games Econ. Behav. 14 (1996) 124-143
19. Rosenthal R.W. A class of games possessing pure-strategy Nash equilibria. Int. J. Game Theory 2 (1973) 65-67