Abstract
The Owen graph value for games with coalition structure and graph restricted communication was introduced by Vázquez-Brage et al. (Games Econ Behav 12: 42–53, 1996). It has been known that the value satisfies the axiom of component efficiency, requiring that the players of a component share the benefits generated by this component among themselves. In this paper we extend the Owen graph value to an efficient value and we provide axiomatic characterizations of this value.
Similar content being viewed by others
References
Alonso-Meijide, J. M., Álvarez-Mozos, M., & Fiestras-Janeiro, M. G. (2009). Values of games with graph restricted communication and a priori unions. Mathematical Social Sciences, 58(2), 202–213.
Aumann, R. J., & Drèze, J. (1974). Cooperative games with coalition structures. International Journal of Game Theory, 3, 217–237.
Béal, S., Casajus, A., & Huettner, F. (2015). Efficient extensions of the Myerson value. Social Choice and Welfare, 45, 819–827.
Béal, S., Casajus, A., & Huettner, F. (2018). Efficient extensions of communication values. Annals of Operations Research, 264, 41–56.
Casajus, A. (2007). An efficient value for TU games with a cooperation structure. Working paper, Universität Leipzig, Germany.
Hu, X., Li, D., & Xu, G. (2018). Fair distribution of surplus and efficient extensions of the Myerson value. Economics Letters, 165, 1–5.
Hu, X., Xu, G., & Li, D. (2019). The egalitarian efficient extension of the Aumann\(-\)Drèze value. Journal of Optimization Theory and Applications, 181, 1033–1052.
Li, D. L., & Shan, E. (2020). Efficient quotient extensions of the Myerson value. Annals of Operations Research, 292, 171–181.
Myerson, R. B. (1977). Graphs and cooperation in games. Mathematics of Operations Research, 2(3), 225–229.
Myerson, R. B. (1980). Conference structures and fair allocation rules. International Journal of Game Theory, 9, 169–182.
Owen, G. (1977). Values of games with a priori unions. In: Henn, R., Moeschlin, O. (Eds.), Mathematical economics and game theory. Springer, pp. 76–88.
Shapley, L. S. (1953). A value for \(n\)-Person games. In H. Kuhn & A. Tucker (Eds.), Contributions to the theory of games II (pp. 307–317). Princeton: Princeton University Press.
Shan, E., Han, J., & Shi, J. (2019). The efficient proportional Myerson values. Operations Research Letters, 47, 574–578.
Shan, E., Shi, J., Lyu, W., & Kang, L. (2020). Efficient extension of the Owen value with graph-restricted communication (in Chinese). Scientia Sinica Mathematica, 50, 1219–1232.
van den Nouweland, A.V.D. (1993). Games and graphs in economic situations. PhD thesis, Tilburg University, Tilbury, The Netherlands.
van den Brink, R., Khmelnitskaya, A. B., & van der Laan, G. (2012). An efficient and fair solution for communication graph games. Economics Letters, 117, 786–789.
Vázquez-Brage, M., García-Jurado, I., & Carreras, F. (1996). The Owen value applied to games with graph-restricted communication. Games and Economic Behavior, 12(1), 42–53.
Acknowledgements
The authors are grateful to the referees for their invaluable comments, which improved the presentation of the manuscript greatly.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This research was supported in part by NSFC (11971298) and NSSFC (19BGL001)
Rights and permissions
Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Shan, E., Shi, J. & Lyu, W. The efficient partition surplus Owen graph value. Ann Oper Res 320, 379–392 (2023). https://doi.org/10.1007/s10479-022-04968-x
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-022-04968-x