Nothing Special   »   [go: up one dir, main page]
IDEAS home Printed from https://ideas.repec.org/p/tin/wpaper/20110164.html
   My bibliography  Save this paper

Two Values for Transferable Utility Games with Coalition and Graph Structure

Author

Listed:
  • Rene van den Brink

    (VU University Amsterdam)

  • Gerard van der Laan

    (VU University Amsterdam)

  • Nigel Moes

    (VU University Amsterdam)

Abstract
This discussion paper led to a publication in 'TOP' , 2015, 23(1), 77-99. In this paper we introduce and characterize two new values for transferable utility games with graph restricted communication and a priori unions. Both values are obtained by applying the Shapley value to an associated TU-game. The graph-partition restricted TU-game is obtained by taking the Myerson graph restricted game and of that the Kamijo partition restricted game. In this game the dividend of any coalition that is neither a subset of a union nor a union of unions is zero. The partition-graph restricted TU-game is obtained by taking the partition restricted game and of that the graph restricted game. In this game the dividend of any coalition that is not connected in the graph is zero. We apply the values to an economic example in which the players in a union represent the cities in a country and the graph represents a network of natural gas pipelines between the cities.

Suggested Citation

  • Rene van den Brink & Gerard van der Laan & Nigel Moes, 2011. "Two Values for Transferable Utility Games with Coalition and Graph Structure," Tinbergen Institute Discussion Papers 11-164/1, Tinbergen Institute.
    • Handle: RePEc:tin:wpaper:20110164
    as

    Download full text from publisher

    File URL: https://papers.tinbergen.nl/11164.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Roger B. Myerson, 1977. "Graphs and Cooperation in Games," Mathematics of Operations Research, INFORMS, vol. 2(3), pages 225-229, August.
    2. van den Brink, Rene & van der Laan, Gerard, 2005. "A class of consistent share functions for games in coalition structure," Games and Economic Behavior, Elsevier, vol. 51(1), pages 193-212, April.
    3. Yoshio Kamijo, 2013. "The collective value: a new solution for games with coalition structures," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(3), pages 572-589, October.
    4. Alonso-Meijide, J.M. & Álvarez-Mozos, M. & Fiestras-Janeiro, M.G., 2009. "Values of games with graph restricted communication and a priori unions," Mathematical Social Sciences, Elsevier, vol. 58(2), pages 202-213, September.
    5. Vazquez-Brage, Margarita & Garcia-Jurado, Ignacio & Carreras, Francesc, 1996. "The Owen Value Applied to Games with Graph-Restricted Communication," Games and Economic Behavior, Elsevier, vol. 12(1), pages 42-53, January.
    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. Jilei Shi & Lei Cai & Erfang Shan & Wenrong Lyu, 2022. "A value for cooperative games with coalition and probabilistic graph structures," Journal of Combinatorial Optimization, Springer, vol. 43(3), pages 646-671, April.
    2. Kongo, Takumi, 2011. "Value of games with two-layered hypergraphs," Mathematical Social Sciences, Elsevier, vol. 62(2), pages 114-119, September.
    3. René Brink & Gerard Laan & Nigel Moes, 2015. "Values for transferable utility games with coalition and graph structure," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 23(1), pages 77-99, April.
    4. Tejada, O. & Álvarez-Mozos, M., 2018. "Graphs and (levels of) cooperation in games: Two ways how to allocate the surplus," Mathematical Social Sciences, Elsevier, vol. 93(C), pages 114-122.
    5. 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.
    6. René Brink & Anna Khmelnitskaya & Gerard Laan, 2016. "An Owen-type value for games with two-level communication structure," Annals of Operations Research, Springer, vol. 243(1), pages 179-198, August.
    7. Zijun Li & Fanyong Meng, 2023. "The α-Egalitarian Myerson value of games with communication structure," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 97(3), pages 311-338, June.
    8. Erfang Shan & Jilei Shi & Wenrong Lyu, 2023. "The efficient partition surplus Owen graph value," Annals of Operations Research, Springer, vol. 320(1), pages 379-392, January.
    9. Wenrong Lyu & Erfang Shan & Zeguang Cui, 2024. "Consistency of the Owen value for TU-games with coalition and graph structures," Annals of Operations Research, Springer, vol. 338(2), pages 991-1017, July.
    10. Sylvain Béal & Eric Rémila & Philippe Solal, 2022. "Allocation rules for cooperative games with restricted communication and a priori unions based on the Myerson value and the average tree solution," Journal of Combinatorial Optimization, Springer, vol. 43(4), pages 818-849, May.
    11. Erfang Shan, 2023. "Marginality and a Characterization of the Owen Graph value," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(2), pages 451-461, June.
    12. Oriol Tejada & Mikel Álvarez-Mozos, 2017. "Games with Graph Restricted Communication and Levels Structure of Cooperation," UB School of Economics Working Papers 2017/363, University of Barcelona School of Economics.
    13. Sylvain Béal & Anna Khmelnitskaya & Philippe Solal, 2018. "Two-step values for games with two-level communication structure," Journal of Combinatorial Optimization, Springer, vol. 35(2), pages 563-587, February.
    14. Elena Parilina & Artem Sedakov, 2016. "Stable Cooperation in a Game with a Major Player," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 18(02), pages 1-20, June.
    15. Sylvain Béal & Sylvain Ferrières & Eric Rémila & Philippe Solal, 2017. "Axiomatic and bargaining foundation of an allocation rule for ordered tree TU-games," Post-Print halshs-01644797, HAL.
    16. Ichiro Nishizaki & Tomohiro Hayashida & Yuki Shintomi, 2016. "A core-allocation for a network restricted linear production game," Annals of Operations Research, Springer, vol. 238(1), pages 389-410, March.
    17. Calvo-Armengol, Antoni, 2001. "Bargaining power in communication networks," Mathematical Social Sciences, Elsevier, vol. 41(1), pages 69-87, January.
    18. Calvo, Emilio & Lasaga, Javier & van den Nouweland, Anne, 1999. "Values of games with probabilistic graphs," Mathematical Social Sciences, Elsevier, vol. 37(1), pages 79-95, January.
    19. Michel Grabisch, 2013. "The core of games on ordered structures and graphs," Annals of Operations Research, Springer, vol. 204(1), pages 33-64, April.
    20. Hamiache, Gerard, 1999. "A Value with Incomplete Communication," Games and Economic Behavior, Elsevier, vol. 26(1), pages 59-78, January.

    More about this item

    Keywords

    cooperative games; coalition structures; graphs; Shapley value;
    All these keywords.

    JEL classification:

    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games

    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:tin:wpaper:20110164. 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: Tinbergen Office +31 (0)10-4088900 (email available below). General contact details of provider: https://edirc.repec.org/data/tinbenl.html .

    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.