IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2401.09845.html
   My bibliography  Save this paper

Game Representations and Extensions of the Shapley Value

Author

Listed:
  • Pradeep Dubey

Abstract

We show that any cooperative game can be represented by an assignment of costly facilities to players, in which it is intuitively obvious how to allocate the total cost in an equitable manner. This equitable solution turns out to be the Shapley value of the game, and thus provides as an alternative justification of the value. Game representations also open the door for extending the Shapley value to situations where not all coalitions can form, provided those that can constitute a "semi-algebra"; or, more generally, a "hierarchy"; or, still more generally, have "full span".

Suggested Citation

  • Pradeep Dubey, 2024. "Game Representations and Extensions of the Shapley Value," Papers 2401.09845, arXiv.org.
  • Handle: RePEc:arx:papers:2401.09845
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2401.09845
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Pradeep Dubey, 2018. "Intuitive Solutions in Game Representations: The Shapley Value Revisited," Cowles Foundation Discussion Papers 2123, Cowles Foundation for Research in Economics, Yale University.
    2. Roger B. Myerson, 1977. "Graphs and Cooperation in Games," Mathematics of Operations Research, INFORMS, vol. 2(3), pages 225-229, August.
    3. Pradeep Dubey, 1982. "The Shapley Value as Aircraft Landing Fees--Revisited," Management Science, INFORMS, vol. 28(8), pages 869-874, August.
    Full references (including those not matched with items on IDEAS)

    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. Pradeep Dubey, 2024. "Equitable Solutions in Game Representations: An Extension of the Shapley Value," Department of Economics Working Papers 24-01, Stony Brook University, Department of Economics.
    2. Stefano Moretti & Fioravante Patrone, 2008. "Transversality of the Shapley value," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 16(1), pages 1-41, July.
    3. Pradeep Dubey, 2018. "Equitable Solutions in Game Representations and the Shapley Value," Department of Economics Working Papers 18-11, Stony Brook University, Department of Economics.
    4. Miklós Pintér & Anna Radványi, 2013. "The Shapley value for shortest path games: a non-graph-based approach," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 21(4), pages 769-781, December.
    5. Guang Zhang & Erfang Shan & Liying Kang & Yanxia Dong, 2017. "Two efficient values of cooperative games with graph structure based on $$\tau $$ τ -values," Journal of Combinatorial Optimization, Springer, vol. 34(2), pages 462-482, August.
    6. Sylvain Béal & Marc Deschamps & Catherine Refait-Alexandre & Guillaume Sekli, 2022. "Early contributors, cooperation and fair rewards in crowdfunding," Working Papers hal-04222321, HAL.
    7. Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2015. "An allocation rule for dynamic random network formation processes," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 60(2), pages 283-313, October.
    8. Alexandre Skoda, 2016. "Convexity of Network Restricted Games Induced by Minimum Partitions," Documents de travail du Centre d'Economie de la Sorbonne 16019, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    9. Sylvain Béal & Marc Deschamps & Mostapha Diss & Rodrigue Tido Takeng, 2024. "Cooperative games with diversity constraints," Working Papers hal-04447373, HAL.
    10. Rodrigo J. Harrison & Roberto Munoz, 2003. "Stability and Equilibrium Selection in a Link Formation Game," Game Theory and Information 0306004, University Library of Munich, Germany.
    11. Sergio Currarini & Carmen Marchiori & Alessandro Tavoni, 2016. "Network Economics and the Environment: Insights and Perspectives," Environmental & Resource Economics, Springer;European Association of Environmental and Resource Economists, vol. 65(1), pages 159-189, September.
    12. Youngsub Chun & Boram Park, 2016. "The airport problem with capacity constraints," Review of Economic Design, Springer;Society for Economic Design, vol. 20(3), pages 237-253, September.
    13. Sylvain Béal & Amandine Ghintran & Eric Rémila & Philippe Solal, 2015. "The sequential equal surplus division for rooted forest games and an application to sharing a river with bifurcations," Theory and Decision, Springer, vol. 79(2), pages 251-283, September.
    14. Caulier, Jean-François & Mauleon, Ana & Vannetelbosch, Vincent, 2015. "Allocation rules for coalitional network games," Mathematical Social Sciences, Elsevier, vol. 78(C), pages 80-88.
    15. H. Andrew Michener & Daniel J. Myers, 1998. "Probabilistic Coalition Structure Theories," Journal of Conflict Resolution, Peace Science Society (International), vol. 42(6), pages 830-860, December.
    16. van den Brink, René & van der Laan, Gerard & Moes, Nigel, 2013. "A strategic implementation of the Average Tree solution for cycle-free graph games," Journal of Economic Theory, Elsevier, vol. 148(6), pages 2737-2748.
    17. Antonio Magaña & Francesc Carreras, 2018. "Coalition Formation and Stability," Group Decision and Negotiation, Springer, vol. 27(3), pages 467-502, June.
    18. László Á. Kóczy, 2016. "Power Indices When Players can Commit to Reject Coalitions," Homo Oeconomicus: Journal of Behavioral and Institutional Economics, Springer, vol. 33(1), pages 77-91, August.
    19. Sylvain Béal & Eric Rémila & Philippe Solal, 2015. "Discounted Tree Solutions," Working Papers hal-01377923, HAL.
    20. Joost Vandenbossche & Thomas Demuynck, 2013. "Network Formation with Heterogeneous Agents and Absolute Friction," Computational Economics, Springer;Society for Computational Economics, vol. 42(1), pages 23-45, June.

    More about this item

    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:arx:papers:2401.09845. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.