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

The existence of a pure-strategy Nash equilibrium in a discrete ponds dilemma

Author

Listed:
  • Gusev, Vasily
  • Nesterov, Alexander
  • Reshetov, Mikhail
  • Suzdaltsev, Alex

Abstract

In a variety of economic situations discrete agents choose one resource among several available resources and, once admitted to the resource of choice, divide it among fellow agents admitted there. The amount of the resource an agent gets is proportional to her relative ability to acquire this particular resource, what we refer to as an agent's weight at the resource. The relevant applications include students self-selecting into colleges, politicians self-selecting into races, and athletes self-selecting into teams. We find that this game has a pure-strategy Nash equilibrium in at least three special cases: 1) when agents have the same weight at each resource, 2) when all resources are the same, 3) when there are only two resources. We also show that this game always has an approximate Nash equilibrium when the number of players is large. Existence in the general case remains an open problem.

Suggested Citation

  • Gusev, Vasily & Nesterov, Alexander & Reshetov, Mikhail & Suzdaltsev, Alex, 2024. "The existence of a pure-strategy Nash equilibrium in a discrete ponds dilemma," Games and Economic Behavior, Elsevier, vol. 147(C), pages 38-51.
    • Handle: RePEc:eee:gamebe:v:147:y:2024:i:c:p:38-51
    DOI: 10.1016/j.geb.2024.06.001
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0899825624000812
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.geb.2024.06.001?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 search for a different version of it.

    More about this item

    Keywords

    Congestion games; Potential games; Pure Nash equilibrium; Sorting into contests; College admissions;
    All these keywords.

    JEL classification:

    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
    • D47 - Microeconomics - - Market Structure, Pricing, and Design - - - Market Design
    • D78 - Microeconomics - - Analysis of Collective Decision-Making - - - Positive Analysis of Policy Formulation and Implementation
    • D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design

    Statistics

    Access and download statistics

    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:147:y:2024:i:c:p:38-51. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.