Hostname: page-component-cd9895bd7-dzt6s Total loading time: 0 Render date: 2024-12-18T08:09:13.983Z Has data issue: false hasContentIssue false
  • English
  • Français

On lookahead equilibria in congestion games

Published online by Cambridge University Press:  06 May 2015

VITTORIO BILÒ ,
ANGELO FANELLI  and
LUCA MOSCARDELLI
VITTORIO BILÒ
Affiliation:
Department of Mathematics and Physics, University of Salento, Lecce, Italy Email: [email protected]
ANGELO FANELLI
Affiliation:
CNRS, UMR-6211, Caen, France Email: [email protected]
LUCA MOSCARDELLI
Affiliation:
Department of Economic Studies, University of Chieti-Pescara, Pescara, Italy Email: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

We investigate the issues of existence and efficiency of lookahead equilibria in congestion games. Lookahead equilibria, whose study has been initiated by Mirrokni et al. (2012), correspond to the natural extension of pure Nash equilibria in which the players, when making use of global information in order to predict subsequent reactions of the other ones, have computationally limited capabilities.

Type
Paper
Information
Mathematical Structures in Computer Science , Volume 27 , Special Issue 2: Special Issue: XIV ICTCS , February 2017 , pp. 197 - 214
Copyright
Copyright © Cambridge University Press 2015 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Aland, S., Dumrauf, D., Gairing, M., Monien, B. and Schoppmann, F. (2011). Exact price of anarchy for polynomial congestion games. SIAM Journal on Computing 40 (5) 1211–1233.Google Scholar
Awerbuch, B., Azar, Y., Epstein, A., Mirrokni, V. S. and Skopalik, A. (2008). Fast convergence to nearly optimal solutions in potential games. In: EC 264–273.Google Scholar
Bhawalkar, K., Gairing, M. and Roughgarden, T. (2014). Weighted congestion games: Price of anarchy, universal worst-case examples, and tightness. ACM Transactions on Economics and Computation 2 (4) 14.Google Scholar
Bilò, V. (2012). A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games. In: WAOA 215–228.Google Scholar
Bilò, V., Fanelli, A. and Moscardelli, L. (2013). On lookahead equilibria in congestion games In: WINE 54–67.Google Scholar
Bilò, V., Flammini, M., Monaco, G. and Moscardelli, L. (2015). Some anomalies of farsighted strategic behavior. Theory of Computing Systems 56 (1) 156–180.Google Scholar
Caragiannis, I., Fanelli, A., Gravin, N. and Skopalik, A. (2011). Efficient computation of approximate pure Nash equilibria in congestion games. In: FOCS 532–541.Google Scholar
Chien, S. and Sinclair, A. (2007). Convergence to approximate Nash equilibria in congestion games. Games and Economic Behavior 71 (2) 315–327.Google Scholar
Christodoulou, G. and Koutsoupias, E. (2005). The price of anarchy of finite congestion games. In: STOC 67–73.Google Scholar
Fanelli, A., Flammini, M. and Moscardelli, L. (2012). The speed of convergence in congestion games under best-response dynamics. ACM Transactions on Algorithms 8 (3) 25.CrossRefGoogle Scholar
Fanelli, A. and Moscardelli, L. (2011). On best response dynamics in weighted congestion games with polynomial delays. Distributed Computing 24 (5) 245–254.Google Scholar
Mirrokni, V. S., Thain, N. and Vetta, A. (2012). A theoretical examination of practical game playing: Lookahead search. In: SAGT 251–262.Google Scholar
Monderer, D. and Shapley, L. S. (1996). Potential games. Games and Economic Behavior 14 (1) 124–143.Google Scholar
Osborne, M. and Rubinstein, A. (1994). A Course in Game Theory, The MIT Press.Google Scholar
Pearl, J. (1984). Heuristics: Intelligent Search Strategies for Computer Problem Solving, Addison-Wesley.Google Scholar
Rosenthal, R. W. (1973). A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory 2 65–67.CrossRefGoogle Scholar
Shannon, C. (1950). Programming a computer for playing chess. Philosophical Magazine, 7th Series 41 (314) 256–275.Google Scholar