IDEAS home Printed from https://ideas.repec.org/a/spr/topjnl/v7y1999i1p71-80.html
   My bibliography  Save this article

An algorithm for computing the stable coalition structures in tree-graph communication games

Author

Listed:
  • Fritz Grafe
  • Elena Inarra
  • Ana Mauleon

Abstract

No abstract is available for this item.

Suggested Citation

  • Fritz Grafe & Elena Inarra & Ana Mauleon, 1999. "An algorithm for computing the stable coalition structures in tree-graph communication games," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 7(1), pages 71-80, June.
    • Handle: RePEc:spr:topjnl:v:7:y:1999:i:1:p:71-80
    DOI: 10.1007/BF02564712
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/BF02564712
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/BF02564712?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.

    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.
    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. Antonio Magaña & Francesc Carreras, 2018. "Coalition Formation and Stability," Group Decision and Negotiation, Springer, vol. 27(3), pages 467-502, June.
    6. Hadas, Yuval & Gnecco, Giorgio & Sanguineti, Marcello, 2017. "An approach to transportation network analysis via transferable utility games," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 120-143.
    7. Kalai, Ehud & Postlewaite, Andrew & Roberts, John, 1979. "A group incentive compatible mechanism yielding core allocations," Journal of Economic Theory, Elsevier, vol. 20(1), pages 13-22, February.
    8. Tesfatsion, Leigh, 1998. "Ex Ante Capacity Effects in Evolutionary Labor Markets with Adaptive Search," ISU General Staff Papers 199810010700001046, Iowa State University, Department of Economics.
    9. Roger B. Myerson, 1978. "Conference Structures and Fair Allocation Rules," Discussion Papers 363, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    10. Sridhar Mandyam & Usha Sridhar, 2017. "DON and Shapley Value for Allocation among Cooperating Agents in a Network: Conditions for Equivalence," Studies in Microeconomics, , vol. 5(2), pages 143-161, December.
    11. Liying Kang & Anna Khmelnitskaya & Erfang Shan & Dolf Talman & Guang Zhang, 2021. "The average tree value for hypergraph games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 94(3), pages 437-460, December.
    12. Sjur Didrik Flåm, 2013. "Reaching Market Equilibrium Merely by Bilateral Barters," CESifo Working Paper Series 4504, CESifo.
    13. Jean-François Caulier & Ana Mauleon & Vincent Vannetelbosch, 2013. "Contractually stable networks," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(2), pages 483-499, May.
    14. Roland Pongou & Roberto Serrano, 2009. "A Dynamic Theory of Fidelity Networks with an Application to the Spread of HIV/AIDS," Working Papers 2009-2, Brown University, Department of Economics.
    15. Kamijo, Yoshio, 2009. "A linear proportional effort allocation rule," Mathematical Social Sciences, Elsevier, vol. 58(3), pages 341-353, November.
    16. Martí Jané Ballarín, 2023. "The complexity of power indices in voting games with incompatible players," UB School of Economics Working Papers 2023/441, University of Barcelona School of Economics.
    17. Michel Grabisch & Alexandre Skoda, 2011. "Coalition structures induced by the strength of a graph," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00639685, HAL.
    18. Lange, Fabien & Grabisch, Michel, 2009. "Values on regular games under Kirchhoff's laws," Mathematical Social Sciences, Elsevier, vol. 58(3), pages 322-340, November.
    19. Gary E. Bolton & Kalyan Chatterjee & Kathleen L. McGinn, 2013. "How Communication Links Influence Coalition Bargaining: A Laboratory Investigation," World Scientific Book Chapters, in: Bargaining in the Shadow of the Market Selected Papers on Bilateral and Multilateral Bargaining, chapter 6, pages 113-128, World Scientific Publishing Co. Pte. Ltd..
    20. Béal, Sylvain & Casajus, André & Huettner, Frank, 2016. "On the existence of efficient and fair extensions of communication values for connected graphs," Economics Letters, Elsevier, vol. 146(C), pages 103-106.

    More about this item

    Keywords

    stability; core; tree-graph communication games; 90D12; 90D43;
    All these keywords.

    JEL classification:

    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:spr:topjnl:v:7:y:1999:i:1:p:71-80. 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: 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.