Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Journal articles

Repeated congestion games with bounded rationality

Abstract : We consider a repeated congestion game with imperfect monitoring. At each stage, each player chooses to use some facilities and pays a cost that increases with the congestion. Two versions of the model are examined: a public monitoring setting where agents observe the cost of each available facility, and a private monitoring one where players observe only the cost of the facilities they use. A partial folk theorem holds: a Pareto-optimal outcome may result from selfish behavior and be sustained by a belief-free equilibrium of the repeated game. We prove this result assuming that players use strategies of bounded complexity and we estimate the strategic complexity needed to achieve efficiency. It is shown that, under some conditions on the number of players and the structure of the game, this complexity is very small even under private monitoring. The case of network routing games is examined in detail.
Complete list of metadata
Contributor : Antoine Haldemann Connect in order to contact the contributor
Submitted on : Monday, July 16, 2012 - 9:21:10 AM
Last modification on : Saturday, June 25, 2022 - 10:53:51 AM

Links full text





Marco Scarsini, Tristan Tomala. Repeated congestion games with bounded rationality. International Journal of Game Theory, Springer Verlag, 2012, 41 (3), pp.651-669. ⟨10.1007/s00182-011-0309-3⟩. ⟨hal-00718046⟩



Record views