A unified approach to congestion games and two-sided markets

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

Volumn 4858 LNCS, Issue , 2007, Pages 30-41

  Ackermann, Heiner ^a   Goldberg, Paul W ^b   Mirrokni, Vahab S ^c   Röglin, Heiko ^a   Vöcking, Berthold ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

^c MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL MODELS; POLYNOMIALS; RESOURCE ALLOCATION;

CONGESTION GAMES; RESOURCE SHARING;

GAME THEORY;

EID: 38449117948     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77105-0_7     Document Type: Conference Paper

References (23)

1. Ackermann, H., Röglin, H., Vöcking, B.: On the impact of combinatorial structure on congestion games. In: Proc. of the 47th Ann. IEEE Symp. on Foundations of Computer Science (FOCS), pp. 613-622 (2006)
2. Ackermann, H., Röglin, H., Vöcking, B.: Pure Nash equilibria in player-specific and weighted congestion games, In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol. 4286, pp. 50-61. Springer, Heidelberg (2006)
3. Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, E., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: Proc. of the 45th Ann. IEEE Symp. on Foundations of Computer Science (FOCS), pp. 295-304 (2004)
4. Even-Dar, E., Kesselman, A., Mansour, Y.: Convergence time to nash equilibria. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 502-513. Springer, Heidelberg (2003)
5. Fabrikant, A., Papadimitriou, C., Talwar, K.: The complexity of pure Nash equilibria. In: Proc. of the 36th Ann. ACM Symp. on Theory of Computing (STOC), pp. 604-612 (2004)
6. Fleiner, T.: A fixed-point approach to stable matchings and some applications. Mathematics of Operations Research 28(1), 103-126 (2003)
7. Fleischer, L., Goemans, M., Mirrokni, V.S., Sviridenko, M.: Tight approximation algorithms for maximum general assignment problems. In: Proc. of the 16th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 611-620 (2006)
8. Fotakis, D., Kontogiannis, S.C., Koutsoupias, E., Mavronicolas, M., Spirakis, P.G.: 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)
9. Gairing, M., Lücking, T., Mavronicolas, M., Monien, B.: Computing Nash equilibria for scheduling on restricted parallel links. In: Proc. of the 36th Ann. ACM Symp. on Theory of Computing (STOC), pp. 613-622 (2004)
10. Gale, D., Shapley, L.S.: College admissions and the stability of marriage. American Mathematical Monthly 69, 9-15 (1962)
11. Goemans, M., Li, L., Mirrokni, V.S., Thottan, M.: Market sharing games applied to content distribution in ad-hoc networks. In: Proc. of the 5th ACM Int. Symp. on Mobile Ad Hoc Networking and Computing (MobiHoc), pp. 1020-1033 (2004)
12. Gusfield, D., Irving, R.: The stable Marriage Problem: Structure and Algorithms. MIT Press, Cambridge (1989)
13. Hoffman, C., Holroyd, A., Peres, Y.: A stable marriage of poisson and lebesgue. Annals of Probability 34(4), 1241-1272 (2006)
14. Ieong, S., McGrew, R., Nudelman, E., Shoham, Y., Sun, Q.: Fast and compact: A simple class of congestion games. In: Proc. of the 20th Nat. Conference on Artificial Intelligence (AAAI), pp. 489-494 (2005)
15. Iwama, K., Manlove, D., Miyazaki, S., Morita, Y.: Stable marriage with incomplete lists and ties. In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 443-452. Springer, Heidelberg (1999)
16. Kelso, A., Crawford, V.: Job matchings, coalition formation, and gross substitute. Econometrica 50, 1483-1504 (1982)
17. Knuth, D.: Marriage Stables et leurs relations avec d'autres problèmes Combinatories. Les Presses de l'Université de Montréal (1976)
18. Kojima, F., Ünver, M.U.: Random paths to pairwise stability in many-to-many matching problems: a study on market equilibration. Int. Journal of Game Theory (2006)
19. Milchtaich, I.: Congestion games with player-specific payoff functions. Games and Economic Behavior 13(1), 111-124 (1996)
20. Mirrokni, V.S.: Approximation Algorithms for Distributed and Selfish Agents. PhD thesis, Massachusetts Institute of Technology (2005)
21. Rosenthal, R.W.: A class of games possessing pure-strategy Nash equilibria. Int. Journal of Game Theory 2, 65-67 (1973)
22. Roth, A.E.: The evolution of the labor market for medical interns and residents: A case study in game theory. Journal of Political Economy 92, 991-1016 (1984)
23. Roth, A.E., Sotomayor, M.A.O.: Two-sided Matching: A study in game-theoretic modeling and analysis. Cambridge University Press, Cambridge (1990)