IDEAS home Printed from https://ideas.repec.org/a/eee/gamebe/v67y2009i1p156-173.html
   My bibliography  Save this article

Congestion games with load-dependent failures: Identical resources

Author

Listed:
  • Penn, Michal
  • Polukarov, Maria
  • Tennenholtz, Moshe

Abstract

We define a new class of games, congestion games with load-dependent failures (CGLFs). In a CGLF each player can choose a subset of a set of available resources in order to try and perform his task. We assume that the resources are identical but that players' benefits from successful completion of their tasks may differ. Each resource is associated with a cost of use and a failure probability which are load-dependent. Although CGLFs in general do not have a pure strategy Nash equilibrium, we prove the existence of a pure strategy Nash equilibrium in every CGLF with nondecreasing cost functions. Moreover, we present a polynomial time algorithm for computing such an equilibrium.

Suggested Citation

  • Penn, Michal & Polukarov, Maria & Tennenholtz, Moshe, 2009. "Congestion games with load-dependent failures: Identical resources," Games and Economic Behavior, Elsevier, vol. 67(1), pages 156-173, September.
    • Handle: RePEc:eee:gamebe:v:67:y:2009:i:1:p:156-173
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0899-8256(09)00036-0
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

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

    References listed on IDEAS

    as
    1. Milchtaich, Igal, 1996. "Congestion Games with Player-Specific Payoff Functions," Games and Economic Behavior, Elsevier, vol. 13(1), pages 111-124, March.
    2. Monderer, Dov & Shapley, Lloyd S., 1996. "Potential Games," Games and Economic Behavior, Elsevier, vol. 14(1), pages 124-143, May.
    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. Ashish R. Hota & Siddharth Garg & Shreyas Sundaram, 2014. "Fragility of the Commons under Prospect-Theoretic Risk Attitudes," Papers 1408.5951, arXiv.org, revised Jun 2016.
    2. Konstantin Avrachenkov & Laura Cottatellucci & Lorenzo Maggi, 2014. "Confidence Intervals for the Shapley–Shubik Power Index in Markovian Games," Dynamic Games and Applications, Springer, vol. 4(1), pages 10-31, March.
    3. Hota, Ashish R. & Garg, Siddharth & Sundaram, Shreyas, 2016. "Fragility of the commons under prospect-theoretic risk attitudes," Games and Economic Behavior, Elsevier, vol. 98(C), pages 135-164.
    4. Michal Penn & Maria Polukarov & Moshe Tennenholtz, 2009. "Random Order Congestion Games," Mathematics of Operations Research, INFORMS, vol. 34(3), pages 706-725, August.

    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. Milchtaich, Igal, 2009. "Weighted congestion games with separable preferences," Games and Economic Behavior, Elsevier, vol. 67(2), pages 750-757, November.
    2. Holzman, Ron & Law-Yone, Nissan, 1997. "Strong Equilibrium in Congestion Games," Games and Economic Behavior, Elsevier, vol. 21(1-2), pages 85-101, October.
    3. Kukushkin, Nikolai S., 2018. "A universal construction generating potential games," Games and Economic Behavior, Elsevier, vol. 108(C), pages 331-340.
    4. Kukushkin, Nikolai S., 2007. "Best response adaptation under dominance solvability," MPRA Paper 4108, University Library of Munich, Germany.
    5. Kukushkin, Nikolai S., 2014. "Strong equilibrium in games with common and complementary local utilities," MPRA Paper 55499, University Library of Munich, Germany.
    6. Kukushkin, Nikolai S., 2014. "Rosenthal's potential and a discrete version of the Debreu--Gorman Theorem," MPRA Paper 54171, University Library of Munich, Germany.
    7. Kukushkin, Nikolai S., 2010. "On continuous ordinal potential games," MPRA Paper 20713, University Library of Munich, Germany.
    8. Friedman, James W. & Mezzetti, Claudio, 2001. "Learning in Games by Random Sampling," Journal of Economic Theory, Elsevier, vol. 98(1), pages 55-84, May.
    9. repec:ebl:ecbull:v:3:y:2007:i:33:p:1-5 is not listed on IDEAS
    10. Igal Milchtaich, 2013. "Representation of finite games as network congestion games," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(4), pages 1085-1096, November.
    11. Nikolai Kukushkin, 2007. "Congestion games revisited," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(1), pages 57-83, September.
    12. Harks, Tobias & Klimm, Max, 2015. "Equilibria in a class of aggregative location games," Journal of Mathematical Economics, Elsevier, vol. 61(C), pages 211-220.
    13. Yannai A. Gonczarowski & Moshe Tennenholtz, 2014. "Cascading to Equilibrium: Hydraulic Computation of Equilibria in Resource Selection Games," Discussion Paper Series dp673, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    14. Nikolai Kukushkin, 2011. "Acyclicity of improvements in finite game forms," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(1), pages 147-177, February.
    15. Olivier Tercieux & Mark Voorneveld, 2010. "The cutting power of preparation," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 71(1), pages 85-101, February.
    16. Nikolai S Kukushkin, 2004. "'Strategic supplements' in games with polylinear interactions," Game Theory and Information 0411008, University Library of Munich, Germany, revised 28 Feb 2005.
    17. Anita Schöbel & Silvia Schwarze, 2013. "Finding delay-resistant line concepts using a game-theoretic approach," Netnomics, Springer, vol. 14(3), pages 95-117, November.
    18. Kukushkin, Nikolai S., 2015. "Cournot tatonnement and potentials," Journal of Mathematical Economics, Elsevier, vol. 59(C), pages 117-127.
    19. Le Breton, Michel & Weber, Shlomo, 2009. "Existence of Pure Strategies Nash Equilibria in Social Interaction Games with Dyadic Externalities," CEPR Discussion Papers 7279, C.E.P.R. Discussion Papers.
    20. Kukushkin, Nikolai S., 2004. "Best response dynamics in finite games with additive aggregation," Games and Economic Behavior, Elsevier, vol. 48(1), pages 94-110, July.
    21. Hollard, Guillaume, 2000. "On the existence of a pure strategy Nash equilibrium in group formation games," Economics Letters, Elsevier, vol. 66(3), pages 283-287, March.

    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:eee:gamebe:v:67:y:2009:i:1:p:156-173. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/622836 .

    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.