Congestion games with player-specific constants

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

Volumn 4708 LNCS, Issue , 2007, Pages 633-644

  Mavronicolas, Marios ^a   Milchtaich, Igal ^b   Monien, Burkhard ^c   Tiemann, Karsten ^c  

^a UNIVERSITY OF CYPRUS   (Cyprus)

^b BAR ILAN UNIVERSITY   (Israel)

^c UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; FUNCTIONS;

LATENCY FUNCTIONS; NASH EQUILIBRIUM;

GAME THEORY;

EID: 38049018063     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74456-6_56     Document Type: Conference Paper

References (15)

1. Ackermann, H., Röglin, H., Vöcking, B.: On the Impact of Combinatorial Structure on Congestion Games. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 613-622. IEEE Computer Society Press, Los Alamitos (2006)
2. Dunkel, J., Schulz, A.: On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol. 4286, pp. 50-61. Springer, Heidelberg (2006)
3. Fabrikant, A., Papadimitriou, C.H., Talwar, K.: The Complexity of Pure Nash Equilibria. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pp. 604-612. ACM Press, New York (2004)
4. Facchini, G., van Megan, F., Borm, P., Tijs, S.: Congestion Models and Weighted Bayesian Potential Games. Theory and Decision 42, 193-206 (1997)
5. Fotakis, D., Kontogiannis, S., Koutsoupias, E., Mavronicolas, M., Spirakis, P.: The Structure and Complexity of Nash Equilibria for a Selfish Routing Game. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 123-134. Springer, Heidelberg (2002)
6. Fotakis, D., Kontogiannis, S., Spirakis, P.: Selfish Unsplittable Flows. Theoretical Computer Science 348(2-3), 226-239 (2005)
7. Gairing, M., Monien, B., Tiemann, K.: Routing (Un-)Splittable Flow in Games with Player-Specific Linear Latency Functions. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 501-512. Springer, Heidelberg (2006)
8. Georgiou, C., Pavlides, T., Philippou, A.: Network Uncertainty in Selfish Routing. In: CD-ROM Proceedings of the 20th IEEE International Parallel & Distributed Processing Symposium, p. 105. IEEE Computer Society Press, Los Alamitos (2006)
9. Goodearl, K.R.: Partially Ordered Abelian Groups with Interpolation. American Mathematical Society (1986)
10. Graham, R.L.: Bounds on Multiprocessing Timing Anomalies. SIAM Journal of Applied Mathematics 17(2), 416-429 (1969)
11. Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: How Easy is Local Search? Journal of Computer and System Sciences 37(1), 79-100 (1988)
12. Libman, L., Orda, A.: Atomic Resource Sharing in Noncooperative Networks. Telecommunication Systems 17(4), 385-409 (2001)
13. Milchtaich, I.: Congestion Games with Player-Specific Payoff Functions. Games and Economic Behavior 13(1), 111-124 (1996)
14. Monderer, D., Shapley, L.S.: Potential Games. Games and Economic Behavior 14(1), 124-143 (1996)
15. Rosenthal, R.W.: A Class of Games Possessing Pure-Strategy Nash Equilibria. International Journal of Game Theory 2, 65-67 (1973)