Advertisement

Characterizations of the Position Value for Hypergraph Communication Situations

  • Guang Zhang
  • Erfang ShanEmail author
  • Shaojian Qu
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 1082)

Abstract

We characterize the position value for arbitrary hypergraph communication situations. The position value is first presented by the Shapley value of the uniform hyperlink game or the k-augmented uniform hyperlink game, which are obtained from a given hypergraph communication situation. These results generalize the non-axiomatic characterization of the position value from communication situations in Kongo (2010) (Int J Game Theory (2010) 39: 669–675) to hypergraph communication situations. Based on the non-axiomatic characterizations, we further provide an axiomatic characterization of the position value for arbitrary hypergraph communication situations by employing component efficiency and a new property, named partial balanced conference contributions. Partial balanced conference contributions is developed from balanced link contributions in Slikker (2005) (Int J Game Theory (2005) 33: 505–514).

Keywords

Hypergraph communication situation Position value Characterization 

References

  1. Algaba, E., Bilbao, J.-M., Borm, P., López, J.-J.: The position value for union stable systems. Math. Methods Oper. Res. 52, 221–236 (2000)MathSciNetCrossRefGoogle Scholar
  2. Béal, S., Rémila, E., Solal, P.: Fairness and fairness for neighbors: the difference between the Myerson value and component-wise egalitarian solutions. Econ. Lett. 117(1), 263–267 (2012)MathSciNetCrossRefGoogle Scholar
  3. Borm, P., Owen, G., Tijs, S.: On the position value for communication situations. SIAM J. Discrete Math. 5, 305–320 (1992)MathSciNetCrossRefGoogle Scholar
  4. Casajus, A.: The position value is the Myerson value, in a sense. Int. J. Game Theory 36, 47–55 (2007)MathSciNetCrossRefGoogle Scholar
  5. Harsanyi, J.-C.: A bargaining model for cooperative \(n\)-person games. In: Tucker, A.-W., Luce, R.-D. (eds.) Contributions to the Theory of Games IV, pp. 325–355. Princeton University Press, Princeton (1959)zbMATHGoogle Scholar
  6. Herings, P.-J.-J., van der Laan, G., Talman, A.-J.-J.: The average tree solution for cycle-free graph games. Games Econ. Behav. 62(1), 77–92 (2008)MathSciNetCrossRefGoogle Scholar
  7. Kongo, T.: Difference between the position value and the Myerson value is due to the existence of coalition structures. Int. J. Game Theory 39, 669–675 (2010)MathSciNetCrossRefGoogle Scholar
  8. Meessen, R.: Communication games. Master’s thesis, Department of Mathematics. University of Nijmegen, the Netherlands (1988). (in Dutch)Google Scholar
  9. Myerson, R.-B.: Graphs and cooperation in games. Math. Oper. Res. 2, 225–229 (1977)MathSciNetCrossRefGoogle Scholar
  10. Myerson, R.-B.: Conference structures and fair allocation rules. Int. J. Game Theory 9, 169–182 (1980)MathSciNetCrossRefGoogle Scholar
  11. Shan, E., Zhang, G., Dong, Y.: Component-wise proportional solutions for communication graph games. Math. Soc. Sci. 81, 22–28 (2016)MathSciNetCrossRefGoogle Scholar
  12. Shan, E., Zhang, G., Shan, X.: The degree value for games with communication structure. Int. J. Game Theory 47, 857–871 (2018)MathSciNetCrossRefGoogle Scholar
  13. Shapley, L.-S.: A value for \(n\)-person games. In: Kuhn, H., Tucker, A.-W. (eds.) Contributions to the Theory of Games II, pp. 307–317. Princeton, Princeton University Press (1953)Google Scholar
  14. Slikker, M.: A characterization of the position value. Int. J. Game Theory 33, 505–514 (2005)MathSciNetCrossRefGoogle Scholar
  15. van den Brink, R., Khmelnitskaya, A., van der Laan, G.: An efficient and fair solution for communication graph games. Econ. Lett. 117(3), 786–789 (2012)MathSciNetCrossRefGoogle Scholar
  16. van den Brink, R., van der Laan, G., Pruzhansky, V.: Harsanyi power solutions for graph-restricted games. Int. J. Game Theory 40, 87–110 (2011)MathSciNetCrossRefGoogle Scholar
  17. van den Nouweland, A., Borm, P., Tijs, S.: Allocation rules for hypergraph communication situations. Int. J. Game Theory 20, 255–268 (1992)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  1. 1.Business SchoolUniversity of Shanghai for Science and TechnologyShanghaiPeople’s Republic of China
  2. 2.School of ManagementShanghai UniversityShanghaiPeople’s Republic of China

Personalised recommendations