IDEAS home Printed from https://ideas.repec.org/r/tin/wpaper/20080083.html

The Average Tree Solution for Cooperative Games with Communication Structure

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. S. Ryuo & K. Sato & Y. Yamamoto, 2012. "Parameterized fairness axioms on cycle-free graph games," Journal of Global Optimization, Springer, vol. 52(3), pages 487-497, March.
  3. Richard Baron & Sylvain Béal & Éric Rémila & Philippe Solal, 2008. "Average tree solutions for graph games," Post-Print hal-00332570, HAL.
  4. René van den Brink, 2009. "Comparable Axiomatizations of the Myerson Value, the Restricted Banzhaf Value, Hierarchical Outcomes and the Average Tree Solution for Cycle-Free Graph Restricted Games," Tinbergen Institute Discussion Papers 09-108/1, Tinbergen Institute.
  5. Anna Khmelnitskaya & Peter Sudhölter, 2013. "The prenucleolus and the prekernel for games with communication structures," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 78(2), pages 285-299, October.
  6. 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.
  7. Liying Kang & Anna Khmelnitskaya & Erfang Shan & Dolf Talman & Guang Zhang, 2023. "The two-step average tree value for graph and hypergraph games," Annals of Operations Research, Springer, vol. 323(1), pages 109-129, April.
  8. 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.
  9. 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.
  10. 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.
  11. Koshevoy, Gleb & Talman, Dolf, 2014. "Solution concepts for games with general coalitional structure," Mathematical Social Sciences, Elsevier, vol. 68(C), pages 19-30.
  12. 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.
  13. 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.
  14. Albizuri, M. Josune & Sudhölter, Peter, 2014. "On the Core of Games with Communication Structures," Discussion Papers on Economics 6/2014, University of Southern Denmark, Department of Economics.
  15. 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.
  16. 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.
  17. Suzuki, T. & Talman, A.J.J., 2011. "Solution Concepts for Cooperative Games with Circular Communication Structure," Other publications TiSEM d863606f-a58a-4f92-894d-e, Tilburg University, School of Economics and Management.
  18. 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.
  19. Zijun Li & Fanyong Meng, 2023. "The α-Egalitarian Myerson value of games with communication structure," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 97(3), pages 311-338, June.
  20. Roger A McCain, 2013. "Value Solutions in Cooperative Games," World Scientific Books, World Scientific Publishing Co. Pte. Ltd., number 8528.
  21. Sylvain Béal & Eric Rémila & Philippe Solal, 2022. "Allocation rules for cooperative games with restricted communication and a priori unions based on the Myerson value and the average tree solution," Journal of Combinatorial Optimization, Springer, vol. 43(4), pages 818-849, May.
  22. Khmelnitskaya, Anna B. & Sudhölter, Peter, 2011. "The prenucleolus for games with communication structures," Discussion Papers on Economics 10/2011, University of Southern Denmark, Department of Economics.
  23. Koshevoy, G.A. & Suzuki, T. & Talman, A.J.J., 2013. "Solutions For Games With General Coalitional Structure And Choice Sets," Other publications TiSEM a831011f-430e-4e82-b6f6-5, Tilburg University, School of Economics and Management.
  24. Mao, Liang, 2016. "The stability and efficiency of direct and star networks in a loan game," Mathematical Social Sciences, Elsevier, vol. 79(C), pages 53-60.
  25. Özer Selçuk & Takamasa Suzuki, 2023. "Comparable axiomatizations of the average tree solution and the Myerson value," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(2), pages 333-362, June.
  26. J. R. Fernández & I. Gallego & A. Jiménez-Losada & M. Ordóñez, 2019. "The cg-average tree value for games on cycle-free fuzzy communication structures," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 27(3), pages 456-478, October.
  27. Alexander Mayer, 2018. "Luxembourg in the Early Days of the EEC: Null Player or Not?," Games, MDPI, vol. 9(2), pages 1-12, May.
  28. 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.
  29. M. Albizuri & Peter Sudhölter, 2016. "Characterizations of the core of TU and NTU games with communication structures," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 46(2), pages 451-475, February.
  30. Nils Roehl, 2013. "Two-Stage Allocation Rules," Working Papers Dissertations 01, Paderborn University, Faculty of Business Administration and Economics.
  31. Koshevoy, G.A. & Talman, A.J.J., 2011. "Solution Concepts for Games with General Coalitional Structure (Replaces CentER DP 2011-025)," Discussion Paper 2011-119, Tilburg University, Center for Economic Research.
  32. Bahel, Eric, 2021. "Hyperadditive games and applications to networks or matching problems," Journal of Economic Theory, Elsevier, vol. 191(C).
  33. Koshevoy, G.A. & Talman, A.J.J., 2011. "Solution Concepts for Games with General Coalitional Structure (Replaced by CentER DP 2011-119)," Discussion Paper 2011-025, Tilburg University, Center for Economic Research.
  34. 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.
  35. Nils Roehl, 2013. "Two-Stage Allocation Rules," Working Papers CIE 73, Paderborn University, CIE Center for International Economics.
  36. Xu Lang & Zaifu Yang, 2021. "Reduced-Form Allocations for Multiple Indivisible Objects under Constraints," Discussion Papers 21/04, Department of Economics, University of York.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.