IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v336y2024i3d10.1007_s10479-023-05179-8.html
   My bibliography  Save this article

“Greedy” demand adjustment in cooperative games

Author

Listed:
  • Maria Montero

    (University of Nottingham)

  • Alex Possajennikov

    (University of Nottingham
    University of Nottingham)

Abstract

This paper studies a simple process of demand adjustment in cooperative games. In the process, a randomly chosen player makes the highest possible demand subject to the demands of other coalition members being satisfied. This process converges to the aspiration set; in convex games, this implies convergence to the core. We further introduce perturbations into the process, where players sometimes make a higher demand than feasible. These perturbations make the set of separating aspirations, i.e., demand vectors in which no player is indispensable in order for other players to achieve their demands, the one most resistant to mutations. We fully analyze this process for 3-player games. We further look at weighted majority games with two types of players. In these games, if the coalition of all small players is winning, the process converges to the unique separating aspiration; otherwise, there are many separating aspirations and the process reaches a neighbourhood of a separating aspiration.

Suggested Citation

  • Maria Montero & Alex Possajennikov, 2024. "“Greedy” demand adjustment in cooperative games," Annals of Operations Research, Springer, vol. 336(3), pages 1461-1478, May.
    • Handle: RePEc:spr:annopr:v:336:y:2024:i:3:d:10.1007_s10479-023-05179-8
    DOI: 10.1007/s10479-023-05179-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-023-05179-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-023-05179-8?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.

    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:annopr:v:336:y:2024:i:3:d:10.1007_s10479-023-05179-8. 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: 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.