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

Stable cores in information graph games

Author

Listed:
  • Núñez, Marina
  • Vidal-Puga, Juan

Abstract

In an information graph situation, a finite set of agents and a source are the set of nodes of an undirected graph with the property that two adjacent nodes can share information at no cost. The source has some information (or technology), and agents in the same component as the source can reach this information for free. In other components, some agent must pay a unitary cost to obtain the information. We prove that the core of the derived information graph game is a von Neumann-Morgenstern stable set if and only if the information graph is cycle-complete, or equivalently if the game is concave. Otherwise, whether there always exists a stable set is an open question. If the information graph consists of a ring that contains the source, a stable set always exists and it is the core of a related situation where one edge has been deleted.

Suggested Citation

  • Núñez, Marina & Vidal-Puga, Juan, 2022. "Stable cores in information graph games," Games and Economic Behavior, Elsevier, vol. 132(C), pages 353-367.
    • Handle: RePEc:eee:gamebe:v:132:y:2022:i:c:p:353-367
    DOI: 10.1016/j.geb.2022.01.013
    as

    Download full text from publisher

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

    Other versions of this item:

    References listed on IDEAS

    as
    1. Graziano, Maria Gabriella & Meo, Claudia & Yannelis, Nicholas C., 2017. "Stable sets for exchange economies with interdependent preferences," Journal of Economic Behavior & Organization, Elsevier, vol. 140(C), pages 267-286.
    2. Anesi, Vincent, 2010. "Noncooperative foundations of stable sets in voting games," Games and Economic Behavior, Elsevier, vol. 70(2), pages 488-493, November.
    3. Joachim RosenmØller & Benyamin Shitovitz, 2000. "A characterization of vNM-stable sets for linear production games," International Journal of Game Theory, Springer;Game Theory Society, vol. 29(1), pages 39-61.
    4. Joachim Rosenmüller & Benyamin Shitovitz, 2010. "Convex vNM-stable sets for linear production games," International Journal of Game Theory, Springer;Game Theory Society, vol. 39(3), pages 311-318, July.
    5. Jean-Jacques HERINGS & Ana MAULEON & Vincent VANNETELBOSCH, 2017. "Stable sets in matching problems with coalitional sovereignty path dominance," LIDAM Reprints CORE 2861, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    6. Simon MacKenzie & Manfred Kerber & Colin Rowat, 2015. "Pillage games with multiple stable sets," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(4), pages 993-1013, November.
    7. Diermeier, Daniel & Fong, Pohan, 2012. "Characterization of the von Neumann–Morgenstern stable set in a non-cooperative model of dynamic policy-making with a persistent agenda setter," Games and Economic Behavior, Elsevier, vol. 76(1), pages 349-353.
    8. J. R. G. van Gellekom & J. A. M. Potters & J. H. Reijnierse, 1999. "Prosperity properties of TU-games," International Journal of Game Theory, Springer;Game Theory Society, vol. 28(2), pages 211-227.
    9. Debraj Ray & Rajiv Vohra, 2015. "The Farsighted Stable Set," Econometrica, Econometric Society, vol. 83(3), pages 977-1011, May.
    10. Kuipers, Jeroen, 1993. "On the Core of Information Graph Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 21(4), pages 339-350.
    11. Bando, Keisuke & Kawasaki, Ryo, 2021. "Stability properties of the core in a generalized assignment problem," Games and Economic Behavior, Elsevier, vol. 130(C), pages 211-223.
    12. Einy, Ezra & Shitovitz, Benyamin, 1996. "Convex Games and Stable Sets," Games and Economic Behavior, Elsevier, vol. 16(2), pages 192-201, October.
    13. Maria Gabriella Graziano & Claudia Meo & Nicholas C. Yannelis, 2015. "Stable sets for asymmetric information economies," International Journal of Economic Theory, The International Society for Economic Theory, vol. 11(1), pages 137-154, March.
    14. Núñez, Marina & Rafels, Carles, 2013. "Von Neumann–Morgenstern solutions in the assignment market," Journal of Economic Theory, Elsevier, vol. 148(3), pages 1282-1291.
    15. Brandt, Felix, 2011. "Minimal stable sets in tournaments," Journal of Economic Theory, Elsevier, vol. 146(4), pages 1481-1499, July.
    16. Kamal Jain & Rakesh Vohra, 2010. "Extendability and von Neuman–Morgenstern stability of the core," International Journal of Game Theory, Springer;Game Theory Society, vol. 39(4), pages 691-697, October.
    17. Jean-Jacques Herings, P. & Mauleon, Ana & Vannetelbosch, Vincent, 2017. "Stable sets in matching problems with coalitional sovereignty and path dominance," Journal of Mathematical Economics, Elsevier, vol. 71(C), pages 14-19.
    18. Hirai, Toshiyuki & Watanabe, Naoki & Muto, Shigeo, 2019. "Farsighted stability in patent licensing: An abstract game approach," Games and Economic Behavior, Elsevier, vol. 118(C), pages 141-160.
    19. Anindya Bhattacharya & Victoria Brosi, 2011. "An existence result for farsighted stable sets of games in characteristic function form," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(2), pages 393-401, May.
    20. T. E. S. Raghavan & Tamás Solymosi, 2001. "Assignment games with stable core," International Journal of Game Theory, Springer;Game Theory Society, vol. 30(2), pages 177-185.
    21. Trudeau, Christian, 2012. "A new stable and more responsive cost sharing solution for minimum cost spanning tree problems," Games and Economic Behavior, Elsevier, vol. 75(1), pages 402-412.
    22. Hirai, Toshiyuki & Watanabe, Naoki, 2018. "von Neumann–Morgenstern stable sets of a patent licensing game: The existence proof," Mathematical Social Sciences, Elsevier, vol. 94(C), pages 1-12.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Bergantiños, Gustavo & Vidal-Puga, Juan, 2020. "Cooperative games for minimum cost spanning tree problems," MPRA Paper 104911, University Library of Munich, Germany.
    2. Gustavo Bergantiños & Juan Vidal-Puga, 2021. "A review of cooperative rules and their associated algorithms for minimum-cost spanning tree problems," SERIEs: Journal of the Spanish Economic Association, Springer;Spanish Economic Association, vol. 12(1), pages 73-100, March.

    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. Hirai, Toshiyuki & Watanabe, Naoki, 2018. "von Neumann–Morgenstern stable sets of a patent licensing game: The existence proof," Mathematical Social Sciences, Elsevier, vol. 94(C), pages 1-12.
    2. Bando, Keisuke & Kawasaki, Ryo, 2021. "Stability properties of the core in a generalized assignment problem," Games and Economic Behavior, Elsevier, vol. 130(C), pages 211-223.
    3. Vicki Knoblauch, 2020. "Von Neumann–Morgenstern stable set rationalization of choice functions," Theory and Decision, Springer, vol. 89(3), pages 369-381, October.
    4. Ata Atay & Ana Mauleon & Vincent Vannetelbosch, 2022. "Limited Farsightedness in Priority-Based Matching," Papers 2212.07427, arXiv.org.
    5. Herings, P. Jean-Jacques & Mauleon, Ana & Vannetelbosch, Vincent, 2020. "Matching with myopic and farsighted players," Journal of Economic Theory, Elsevier, vol. 190(C).
    6. Marina Núñez & Tamás Solymosi, 2017. "Lexicographic allocations and extreme core payoffs: the case of assignment games," Annals of Operations Research, Springer, vol. 254(1), pages 211-234, July.
    7. Ata Atay & Sylvain Funck & Ana Mauleon & Vincent Vannetelbosch, 2023. "Matching markets with farsighted couples," UB School of Economics Working Papers 2023/445, University of Barcelona School of Economics.
    8. Atay, Ata & Mauleon, Ana & Vannetelbosch, Vincent, 2021. "A bargaining set for roommate problems," Journal of Mathematical Economics, Elsevier, vol. 94(C).
    9. Mauleon, Ana & Sempere-Monerris, Jose J. & Vannetelbosch, Vincent, 2023. "R&D network formation with myopic and farsighted firms," Journal of Economic Behavior & Organization, Elsevier, vol. 208(C), pages 203-229.
    10. Herings, P. Jean-Jacques & Kóczy, László Á., 2021. "The equivalence of the minimal dominant set and the myopic stable set for coalition function form games," Games and Economic Behavior, Elsevier, vol. 127(C), pages 67-79.
    11. Pierre de Callataÿ & Ana Mauleon & Vincent Vannetelbosch, 2023. "Myopic-farsighted absorbing networks," Theory and Decision, Springer, vol. 94(3), pages 405-422, April.
    12. Luo, Chenghong & Mauleon, Ana & Vannetelbosch, Vincent, 2022. "Friendship networks with farsighted agents," LIDAM Discussion Papers CORE 2022021, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    13. Herings, Jean-Jacques & Mauleon, Ana & Vannetelbosch, Vincent, 2020. "Do Stable Outcomes Survive in Marriage Problems with Myopic and Farsighted Players?," LIDAM Discussion Papers CORE 2020033, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    14. Anesi, Vincent & Duggan, John, 2018. "Existence and indeterminacy of markovian equilibria in dynamic bargaining games," Theoretical Economics, Econometric Society, vol. 13(2), May.
    15. Mauleon, Ana & Roehl, Nils & Vannetelbosch, Vincent, 2019. "Paths to stability for overlapping group structures," Journal of Mathematical Economics, Elsevier, vol. 83(C), pages 19-24.
    16. Nunnari, Salvatore, 2021. "Dynamic legislative bargaining with veto power: Theory and experiments," Games and Economic Behavior, Elsevier, vol. 126(C), pages 186-230.
    17. van Velzen, Bas & Hamers, Herbert & Solymosi, Tamas, 2008. "Core stability in chain-component additive games," Games and Economic Behavior, Elsevier, vol. 62(1), pages 116-139, January.
    18. Atay, Ata & Núñez, Marina, 2019. "A note on the relationship between the core and stable sets in three-sided markets," Mathematical Social Sciences, Elsevier, vol. 98(C), pages 10-14.
    19. Dezső Bednay, 2014. "Stable sets in one-seller assignment games," Annals of Operations Research, Springer, vol. 222(1), pages 143-152, November.
    20. , & , J., 2014. "Bargaining over an endogenous agenda," Theoretical Economics, Econometric Society, vol. 9(2), May.

    More about this item

    Keywords

    Information graph game; Core; Stable set; Cycle-complete graph;
    All these keywords.

    JEL classification:

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

    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:132:y:2022:i:c:p:353-367. 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: 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.