IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-01103929.html
   My bibliography  Save this paper

Dynamics of profit- sharing games

Author

Listed:
  • J. Augustine

    (IIT Madras - Indian Institute of Technology Madras)

  • Ning Chen

    (NTU - Nanayang Technological University)

  • Edith Elkind

    (Computing Science Laboratory - Oxford University - University of Oxford, NTU - Nanayang Technological University)

  • Angelo Fanelli

    (CREM - Centre de recherche en économie et management - UNICAEN - Université de Caen Normandie - NU - Normandie Université - UR - Université de Rennes - CNRS - Centre National de la Recherche Scientifique)

  • Nick Gravin

    (NTU - Nanayang Technological University, Microsoft Research [Redmond] - Microsoft Corporation [Redmond, Wash.])

  • Dmitry Shiryaev

    (NTU - Nanayang Technological University)

Abstract

An important task in the analysis of multiagent systems is to understand how groups of selfish players can form coalitions, i.e., work together in teams. In this paper, we study the dynamics of coalition formation under bounded rationality. We consider settings whereby each team's profit is given by a submodular function and propose three profit-sharing schemes, each of which is based on the concept of marginal utility. The agents are assumed to be myopic, i.e., they keep changing teams as long as they can increase their payoff by doing so. We study the properties (such as closeness to Nash equilibrium or total profit) of the states that result after a polynomial number of such moves, and prove bounds on the price of anarchy and the price of stability of the corresponding games.

Suggested Citation

  • J. Augustine & Ning Chen & Edith Elkind & Angelo Fanelli & Nick Gravin & Dmitry Shiryaev, 2015. "Dynamics of profit- sharing games," Post-Print hal-01103929, HAL.
    • Handle: RePEc:hal:journl:hal-01103929
    DOI: 10.1080/15427951.2013.830164
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    1. Jie, Yingmo & Liu, Charles Zhechao & Choo, Kim-Kwang Raymond & Guo, Cheng, 2024. "An incentive compatible ZD strategy-based data sharing model for federated learning: A perspective of iterated prisoner's dilemma," European Journal of Operational Research, Elsevier, vol. 315(2), pages 764-776.

    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:hal:journl:hal-01103929. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.