IDEAS home Printed from https://ideas.repec.org/a/spr/jogath/v40y2011i4p697-718.html
   My bibliography  Save this article

The covering values for acyclic digraph games

Author

Listed:
  • Lei Li
  • Xueliang Li

Abstract

No abstract is available for this item.

Suggested Citation

  • Lei Li & Xueliang Li, 2011. "The covering values for acyclic digraph games," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(4), pages 697-718, November.
    • Handle: RePEc:spr:jogath:v:40:y:2011:i:4:p:697-718
    DOI: 10.1007/s00182-010-0264-4
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00182-010-0264-4
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s00182-010-0264-4?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.
    2. Gabrielle Demange, 2004. "On Group Stability in Hierarchies and Networks," Journal of Political Economy, University of Chicago Press, vol. 112(4), pages 754-778, August.
    3. RenÊ van den Brink, 1997. "An Axiomatization of the Disjunctive Permission Value for Games with a Permission Structure," International Journal of Game Theory, Springer;Game Theory Society, vol. 26(1), pages 27-43.
    4. René Brink & Gerard Laan & Valeri Vasil’ev, 2007. "Component efficient solutions in line-graph games with applications," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 33(2), pages 349-364, November.
    5. Herings, P. Jean Jacques & van der Laan, Gerard & Talman, Dolf, 2008. "The average tree solution for cycle-free graph games," Games and Economic Behavior, Elsevier, vol. 62(1), pages 77-92, January.
    6. René van den Brink & Gerard van der Laan & Valeri Vasil'ev, 2003. "Harsanyi Solutions in Line-graph Games," Tinbergen Institute Discussion Papers 03-076/1, Tinbergen Institute.
    7. Gilles, Robert P & Owen, Guillermo & van den Brink, Rene, 1992. "Games with Permission Structures: The Conjunctive Approach," International Journal of Game Theory, Springer;Game Theory Society, vol. 20(3), pages 277-293.
    8. Faigle, U & Kern, W, 1992. "The Shapley Value for Cooperative Games under Precedence Constraints," International Journal of Game Theory, Springer;Game Theory Society, vol. 21(3), pages 249-266.
    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. Anna Khmelnitskaya & Özer Selçuk & Dolf Talman, 2020. "The average covering tree value for directed graph games," Journal of Combinatorial Optimization, Springer, vol. 39(2), pages 315-333, February.
    2. René Brink & P. Herings & Gerard Laan & A. Talman, 2015. "The Average Tree permission value for games with a permission tree," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 58(1), pages 99-123, January.
    3. Khmelnitskaya, Anna & Talman, Dolf, 2014. "Tree, web and average web values for cycle-free directed graph games," European Journal of Operational Research, Elsevier, vol. 235(1), pages 233-246.
    4. René Brink & Chris Dietz & Gerard Laan & Genjiu Xu, 2017. "Comparable characterizations of four solutions for permission tree games," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 63(4), pages 903-923, April.

    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. Richard Baron & Sylvain Béal & Eric Rémila & Philippe Solal, 2011. "Average tree solutions and the distribution of Harsanyi dividends," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(2), pages 331-349, May.
    2. René Brink & P. Herings & Gerard Laan & A. Talman, 2015. "The Average Tree permission value for games with a permission tree," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 58(1), pages 99-123, January.
    3. Michel Grabisch, 2013. "The core of games on ordered structures and graphs," Annals of Operations Research, Springer, vol. 204(1), pages 33-64, April.
    4. Encarnacion Algaba & Rene van den Brink, 2021. "Networks, Communication and Hierarchy: Applications to Cooperative Games," Tinbergen Institute Discussion Papers 21-019/IV, Tinbergen Institute.
    5. Baron, Richard & Béal, Sylvain & Remila, Eric & Solal, Philippe, 2008. "Average tree solutions for graph games," MPRA Paper 10189, University Library of Munich, Germany.
    6. Subhadip Chakrabarti & Amandine Ghintran & Rajnish Kumar, 2019. "Assignment of heterogeneous agents in trees under the permission value," Review of Economic Design, Springer;Society for Economic Design, vol. 23(3), pages 155-188, December.
    7. Michel Grabisch & Lijue Xie, 2011. "The restricted core of games on distributive lattices: how to share benefits in a hierarchy," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 73(2), pages 189-208, April.
    8. René Brink & Chris Dietz & Gerard Laan & Genjiu Xu, 2017. "Comparable characterizations of four solutions for permission tree games," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 63(4), pages 903-923, April.
    9. René Brink, 2017. "Games with a permission structure - A survey on generalizations and applications," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(1), pages 1-33, April.
    10. Khmelnitskaya, Anna & Talman, Dolf, 2014. "Tree, web and average web values for cycle-free directed graph games," European Journal of Operational Research, Elsevier, vol. 235(1), pages 233-246.
    11. René van den Brink & Gerard van der Laan & Valeri Vasil'ev, 0000. "The Restricted Core for Totally Positive Games with Ordered Players," Tinbergen Institute Discussion Papers 09-038/1, Tinbergen Institute.
    12. 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.
    13. Sylvain Béal & Sylvain Ferrières & Philippe Solal, 2022. "The priority value for cooperative games with a priority structure," International Journal of Game Theory, Springer;Game Theory Society, vol. 51(2), pages 431-450, June.
    14. René Brink & Ilya Katsev & Gerard Laan, 2011. "Axiomatizations of two types of Shapley values for games on union closed systems," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 47(1), pages 175-188, May.
    15. Khmelnitskaya, A. & Talman, A.J.J., 2011. "Two solution concepts for TU games with cycle-free directed cooperation structures," Other publications TiSEM df61db11-45de-42b3-91e6-9, Tilburg University, School of Economics and Management.
    16. Hougaard, Jens Leth & Moreno-Ternero, Juan D. & Tvede, Mich & Østerdal, Lars Peter, 2017. "Sharing the proceeds from a hierarchical venture," Games and Economic Behavior, Elsevier, vol. 102(C), pages 98-110.
    17. René Brink, 2012. "On hierarchies and communication," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 39(4), pages 721-735, October.
    18. Michel Grabisch & Lijue Xie, 2008. "The core of games on distributive lattices: how to share benefits in a hierarchy," Post-Print halshs-00344802, HAL.
    19. S. Béal & A. Lardon & E. Rémila & P. Solal, 2012. "The average tree solution for multi-choice forest games," Annals of Operations Research, Springer, vol. 196(1), pages 27-51, July.
    20. Sylvain Béal & Eric Rémila & Philippe Solal, 2012. "Compensations in the Shapley value and the compensation solutions for graph games," International Journal of Game Theory, Springer;Game Theory Society, vol. 41(1), pages 157-178, February.

    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:jogath:v:40:y:2011:i:4:p:697-718. 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.