Advanced Search
MyIDEAS: Login

Citations for "The average tree solution for cycle-free graph games"

by Herings, P.J.J. & Laan, G. van der & Talman, A.J.J.

For a complete description of this item, click here. For a RSS feed for citations of this item, click here.
as in new window
  1. Sylvain Béal & Amandine Ghintran & Eric Rémila & Philippe Solal, 2012. "The Sequential Equal Surplus Division for Sharing International Rivers with Bifurcations," Working Papers 2012-02, CRESE.
  2. Gerard van der Laan & Nigel Moes, 2012. "Transboundary Externalities and Property Rights: An International River Pollution Model," Tinbergen Institute Discussion Papers 12-006/1, Tinbergen Institute.
  3. van den Brink, René & van der Laan, Gerard & Moes, Nigel, 2012. "Fair agreements for sharing international rivers with multiple springs and externalities," Journal of Environmental Economics and Management, Elsevier, vol. 63(3), pages 388-403.
  4. Debasis Mishra & A. Talman, 2010. "A characterization of the average tree solution for tree games," International Journal of Game Theory, Springer, vol. 39(1), pages 105-111, March.
  5. 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.
  6. Mishra, D. & Talman, A.J.J., 2009. "A Characterization of the Average Tree Solution for Cycle-Free Graph Games," Discussion Paper 2009-17, Tilburg University, Center for Economic Research.
  7. Herings, P.J.J. & van der Laan, G. & Talman, A.J.J. & Yang, Z., 2010. "The average tree solution for cooperative games with communication structure," Games and Economic Behavior, Elsevier, vol. 68(2), pages 626-633, March.
  8. Sylvain Beal & Amandine Ghintran & Eric Remila & Philippe Solal, 2013. "The River Sharing Problem: A Survey," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 15(03), pages 1340016-1-1.
  9. Gómez-Rúa, María & Vidal-Puga, Juan, 2008. "Balanced per capita contributions and levels structure of cooperation," MPRA Paper 8208, University Library of Munich, Germany.
  10. Huseynov, T. & Talman, A.J.J., 2012. "The Communication Tree Value for TU-games with Graph Communication," Discussion Paper 2012-095, Tilburg University, Center for Economic Research.
  11. Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2010. "Compensations in the Shapley value and the compensation solutions for graph games," MPRA Paper 20955, University Library of Munich, Germany.
  12. van den Brink, René & van der Laan, Gerard & Moes, Nigel, 2013. "A strategic implementation of the Average Tree solution for cycle-free graph games," Journal of Economic Theory, Elsevier, vol. 148(6), pages 2737-2748.
  13. Béal, Sylvain & Lardon, Aymeric & Rémila, Eric & Solal, Philippe, 2011. "The Average Tree Solution for Multi-choice Forest Games," MPRA Paper 28739, University Library of Munich, Germany.
  14. Khmelnitskaya, A. & Selcuk, O. & Talman, A.J.J., 2012. "The Average Covering Tree Value for Directed Graph Games," Discussion Paper 2012-037, Tilburg University, Center for Economic Research.
  15. Brink J.R. van den & Talman A.J.J. & Herings P.J.J. & Laan G. van der, 2013. "The average tree permission value for games with a permission tree," Research Memorandum 001, Maastricht University, Graduate School of Business and Economics (GSBE).
  16. repec:dgr:uvatin:2013023 is not listed on IDEAS
  17. repec:hal:journl:halshs-00445171 is not listed on IDEAS
  18. repec:hal:cesptp:hal-00803233 is not listed on IDEAS
  19. Khmelnitskaya, A. & Talman, A.J.J., 2011. "Two solution concepts for TU games with cycle-free directed cooperation structures," Open Access publications from Tilburg University urn:nbn:nl:ui:12-5310681, Tilburg University.
  20. Talman, A.J.J. & Yamamoto, Y., 2008. "Average tree solution and subcore for acyclic graph games," Open Access publications from Tilburg University urn:nbn:nl:ui:12-3129818, Tilburg University.
  21. 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.
  22. 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.
  23. Khmelnitskaya, A. & Talman, A.J.J., 2011. "Tree, Web and Average Web Value for Cycle-Free Directed Graph Games," Discussion Paper 2011-122, Tilburg University, Center for Economic Research.
  24. Baron, Richard & Béal, Sylvain & Remila, Eric & Solal, Philippe, 2008. "Average tree solutions for graph games," MPRA Paper 10189, University Library of Munich, Germany.
  25. Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2009. "Average tree solutions and the distribution of Harsanyi dividends," MPRA Paper 17909, University Library of Munich, Germany.
  26. Selçuk, Özer & Suzuki, Takamasa & Talman, Dolf, 2013. "Equivalence and axiomatization of solutions for cooperative games with circular communication structure," Economics Letters, Elsevier, vol. 121(3), pages 428-431.
  27. repec:dgr:uvatin:2009108 is not listed on IDEAS
  28. repec:dgr:uvatin:2008083 is not listed on IDEAS
  29. repec:dgr:uvatin:2010096 is not listed on IDEAS
  30. repec:dgr:uvatin:2012050 is not listed on IDEAS
  31. repec:dgr:uvatin:2011052 is not listed on IDEAS
  32. Suzuki, T. & Talman, A.J.J., 2011. "Solution Concepts for Cooperative Games with Circular Communication Structure," Discussion Paper 2011-100, Tilburg University, Center for Economic Research.
  33. Napel, Stefan & Nohn, Andreas & Alonso-Meijide, José Maria, 2012. "Monotonicity of power in weighted voting games with restricted communication," Mathematical Social Sciences, Elsevier, vol. 64(3), pages 247-257.
  34. repec:dgr:uvatin:2012006 is not listed on IDEAS
  35. van den Nouweland, Anne & Slikker, Marco, 2012. "An axiomatic characterization of the position value for network situations," Mathematical Social Sciences, Elsevier, vol. 64(3), pages 266-271.
  36. van den Brink, René, 2012. "Efficiency and collusion neutrality in cooperative games and networks," Games and Economic Behavior, Elsevier, vol. 76(1), pages 344-348.
  37. 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.
  38. Lei Li & Xueliang Li, 2011. "The covering values for acyclic digraph games," International Journal of Game Theory, Springer, vol. 40(4), pages 697-718, November.