IDEAS home Printed from https://ideas.repec.org/a/kap/theord/v69y2010i4p657-669.html
   My bibliography  Save this article

Values for rooted-tree and sink-tree digraph games and sharing a river

Author

Listed:
  • Anna Khmelnitskaya

Abstract

No abstract is available for this item.

Suggested Citation

  • Anna Khmelnitskaya, 2010. "Values for rooted-tree and sink-tree digraph games and sharing a river," Theory and Decision, Springer, vol. 69(4), pages 657-669, October.
    • Handle: RePEc:kap:theord:v:69:y:2010:i:4:p:657-669
    DOI: 10.1007/s11238-009-9141-7
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11238-009-9141-7
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11238-009-9141-7?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. 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.
    4. Charnes, A. & Littlechild, S. C., 1975. "On the formation of unions in n-person games," Journal of Economic Theory, Elsevier, vol. 10(3), pages 386-402, June.
    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. Khmelnitskaya, A. & Talman, A.J.J., 2010. "Tree-Type Values for Cycle-Free Directed Graph Games," Discussion Paper 2010-113, Tilburg University, Center for Economic Research.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2015. "Characterization of the Average Tree solution and its kernel," Journal of Mathematical Economics, Elsevier, vol. 60(C), pages 159-165.
    7. 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.
    8. 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.
    9. Anna Khmelnitskaya & Gerard van der Laan & Dolf Talman, 2016. "Centrality Rewarding Shapley and Myerson Values for Undirected Graph Games," Tinbergen Institute Discussion Papers 16-070/II, Tinbergen Institute.
    10. Sylvain Béal & André Casajus & Frank Huettner, 2018. "Efficient extensions of communication values," Annals of Operations Research, Springer, vol. 264(1), pages 41-56, May.
    11. 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.
    12. 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.
    13. 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.
    14. Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2012. "Weighted component fairness for forest games," Mathematical Social Sciences, Elsevier, vol. 64(2), pages 144-151.
    15. Michel Grabisch, 2013. "The core of games on ordered structures and graphs," Annals of Operations Research, Springer, vol. 204(1), pages 33-64, April.
    16. Huseynov, T. & Talman, A.J.J., 2012. "The Communication Tree Value for TU-games with Graph Communication," Other publications TiSEM 6ba97d87-1ac6-4af7-a981-a, Tilburg University, School of Economics and Management.
    17. Debasis Mishra & A. Talman, 2010. "A characterization of the average tree solution for tree games," International Journal of Game Theory, Springer;Game Theory Society, vol. 39(1), pages 105-111, March.
    18. Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2010. "Rooted-tree solutions for tree games," European Journal of Operational Research, Elsevier, vol. 203(2), pages 404-408, June.
    19. 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.
    20. Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2012. "The sequential equal surplus division for sharing a river," MPRA Paper 37346, University Library of Munich, Germany.

    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:kap:theord:v:69:y:2010:i:4:p:657-669. 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.