IDEAS home Printed from https://ideas.repec.org/a/spr/jogath/v41y2012i3p651-669.html
   My bibliography  Save this article

Repeated congestion games with bounded rationality

Author

Listed:
  • Marco Scarsini
  • Tristan Tomala

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.
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • Marco Scarsini & Tristan Tomala, 2012. "Repeated congestion games with bounded rationality," International Journal of Game Theory, Springer;Game Theory Society, vol. 41(3), pages 651-669, August.
    • Handle: RePEc:spr:jogath:v:41:y:2012:i:3:p:651-669
    DOI: 10.1007/s00182-011-0309-3
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00182-011-0309-3
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s00182-011-0309-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to look for a different version below or search for a different version of it.

    Other versions of this item:

    References listed on IDEAS

    as
    1. James W. Friedman, 1971. "A Non-cooperative Equilibrium for Supergames," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 38(1), pages 1-12.
    2. Drew Fudenberg & David Levine & Eric Maskin, 2008. "The Folk Theorem With Imperfect Public Information," World Scientific Book Chapters, in: Drew Fudenberg & David K Levine (ed.), A Long-Run Collaboration On Long-Run Games, chapter 12, pages 231-273, World Scientific Publishing Co. Pte. Ltd..
    3. Jeffrey C. Ely & Johannes Hörner & Wojciech Olszewski, 2005. "Belief-Free Equilibria in Repeated Games," Econometrica, Econometric Society, vol. 73(2), pages 377-415, March.
    4. José R. Correa & Andreas S. Schulz & Nicolás E. Stier-Moses, 2004. "Selfish Routing in Capacitated Networks," Mathematics of Operations Research, INFORMS, vol. 29(4), pages 961-976, November.
    5. Drew Fudenberg & David K. Levine, 2008. "An Approximate Folk Theorem with Imperfect Private Information," World Scientific Book Chapters, in: Drew Fudenberg & David K Levine (ed.), A Long-Run Collaboration On Long-Run Games, chapter 14, pages 309-330, World Scientific Publishing Co. Pte. Ltd..
    6. Monderer, Dov & Shapley, Lloyd S., 1996. "Potential Games," Games and Economic Behavior, Elsevier, vol. 14(1), pages 124-143, May.
    7. Kalai, Ehud & Stanford, William, 1988. "Finite Rationality and Interpersonal Complexity in Repeated Games," Econometrica, Econometric Society, vol. 56(2), pages 397-410, March.
    8. Roughgarden, Tim & Tardos, Eva, 2004. "Bounding the inefficiency of equilibria in nonatomic congestion games," Games and Economic Behavior, Elsevier, vol. 47(2), pages 389-403, May.
    9. Holzman, Ron & Law-Yone, Nissan, 1997. "Strong Equilibrium in Congestion Games," Games and Economic Behavior, Elsevier, vol. 21(1-2), pages 85-101, October.
    10. Holzman, Ron & Law-yone (Lev-tov), Nissan, 2003. "Network structure and strong equilibrium in route selection games," Mathematical Social Sciences, Elsevier, vol. 46(2), pages 193-205, October.
    11. Mailath, George J. & Samuelson, Larry, 2006. "Repeated Games and Reputations: Long-Run Relationships," OUP Catalogue, Oxford University Press, number 9780195300796.
    12. Michihiro Kandori, 1992. "Social Norms and Community Enforcement," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 59(1), pages 63-80.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Berliant, Marcus, 2024. "Daily commuting," Research in Transportation Economics, Elsevier, vol. 103(C).
    2. Macault, Emilien & Scarsini, Marco & Tomala, Tristan, 2022. "Social learning in nonatomic routing games," Games and Economic Behavior, Elsevier, vol. 132(C), pages 221-233.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Mailath, George J. & Olszewski, Wojciech, 2011. "Folk theorems with bounded recall under (almost) perfect monitoring," Games and Economic Behavior, Elsevier, vol. 71(1), pages 174-192, January.
    2. Laclau, Marie, 2012. "A folk theorem for repeated games played on a network," Games and Economic Behavior, Elsevier, vol. 76(2), pages 711-737.
    3. Juan I. Block & David K. Levine, 2016. "Codes of conduct, private information and repeated games," International Journal of Game Theory, Springer;Game Theory Society, vol. 45(4), pages 971-984, November.
    4. Laclau, M., 2014. "Communication in repeated network games with imperfect monitoring," Games and Economic Behavior, Elsevier, vol. 87(C), pages 136-160.
    5. Jérôme Renault & Tristan Tomala, 2011. "General Properties of Long-Run Supergames," Dynamic Games and Applications, Springer, vol. 1(2), pages 319-350, June.
    6. Deb, Joyee & González-Díaz, Julio & Renault, Jérôme, 2016. "Uniform folk theorems in repeated anonymous random matching games," Games and Economic Behavior, Elsevier, vol. 100(C), pages 1-23.
    7. Burkov, Andriy & Chaib-draa, Brahim, 2015. "Computing equilibria in discounted dynamic games," Applied Mathematics and Computation, Elsevier, vol. 269(C), pages 863-884.
    8. Compte, Olivier, 2002. "On Failing to Cooperate When Monitoring Is Private," Journal of Economic Theory, Elsevier, vol. 102(1), pages 151-188, January.
    9. Fudenberg, Drew & Yamamoto, Yuichi, 2011. "Learning from private information in noisy repeated games," Journal of Economic Theory, Elsevier, vol. 146(5), pages 1733-1769, September.
    10. Balmaceda, Felipe & Escobar, Juan F., 2017. "Trust in cohesive communities," Journal of Economic Theory, Elsevier, vol. 170(C), pages 289-318.
    11. George J. Mailath & : Wojciech Olszewski, 2008. "Folk Theorems with Bounded Recall under (Almost) Perfect Monitoring, Second Version," PIER Working Paper Archive 08-027, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania, revised 28 Jul 2008.
    12. Rudolf Kerschbamer & Muriel Niederle & Josef Perktold, 2000. "Market Institutions and Quality Enforcement," Econometric Society World Congress 2000 Contributed Papers 1482, Econometric Society.
    13. , J. & ,, 2006. "Coordination failure in repeated games with almost-public monitoring," Theoretical Economics, Econometric Society, vol. 1(3), pages 311-340, September.
    14. Marco Battaglini & Stephen Coate, 2008. "A Dynamic Theory of Public Spending, Taxation, and Debt," American Economic Review, American Economic Association, vol. 98(1), pages 201-236, March.
    15. Laclau, M., 2013. "Repeated games with local monitoring and private communication," Economics Letters, Elsevier, vol. 120(2), pages 332-337.
    16. Osório-Costa, António M., 2009. "Efficiency Gains in Repeated Games at Random Moments in Time," MPRA Paper 13105, University Library of Munich, Germany.
    17. Margaria, Chiara & Smolin, Alex, 2018. "Dynamic communication with biased senders," Games and Economic Behavior, Elsevier, vol. 110(C), pages 330-339.
    18. Kimmo Berg & Markus Kärki, 2018. "Critical Discount Factor Values in Discounted Supergames," Games, MDPI, vol. 9(3), pages 1-17, July.
    19. Epstein, Amir & Feldman, Michal & Mansour, Yishay, 2009. "Efficient graph topologies in network routing games," Games and Economic Behavior, Elsevier, vol. 66(1), pages 115-125, May.
    20. Fong, Kyna & Sannikov, Yuliy, 2007. "Efficiency in a Repeated Prisoners' Dilemma with Imperfect Private Monitoring," Department of Economics, Working Paper Series qt8vz4q9tr, Department of Economics, Institute for Business and Economic Research, UC Berkeley.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jogath:v:41:y:2012:i:3:p:651-669. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.