Skip to main content

The Position Value and the Myerson Value for Hypergraph Communication Situations

  • Chapter
  • First Online:

Part of the book series: Static & Dynamic Game Theory: Foundations & Applications ((SDGTFA))

Abstract

We characterize the position value and the Myerson value for uniform hypergraph communication situations by employing the “incidence graph game” and the “link-hypergraph game” which are induced by the original hypergraph communication situations. The incidence graph game and link-hypergraph game are defined on the “incidence graph” and the “link-hypergraph”, respectively, obtained from the original hypergraph. Using the above tools, we represent the position value by the Shapley value of the incidence graph game and the Myerson value of the link-hypergraph game for uniform hypergraph communication situations, respectively. Also, we represent the Myerson value by the Owen value or the two-step Shapley value of the incidence graph game with a coalition structure for hypergraph communication situations.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   99.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Algaba, E., Bilbao, J.M., Borm, P., López, J.J.: The position value for union stable systems. Math. Meth. Oper. Res. 52, 221–236 (2000)

    Article  MathSciNet  Google Scholar 

  2. Algaba, E., Bilbao, J.M., Borm, P., López, J.J.: The Myerson value for union stable systems. Math. Meth. Oper. Res. 54(3), 359–371 (2001)

    Article  Google Scholar 

  3. 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)

    Article  MathSciNet  Google Scholar 

  4. Borm, P., Owen, G., Tijs, S.: On the position value for communication situations. SIAM J. Discret. Math. 5, 305–320 (1992)

    Article  MathSciNet  Google Scholar 

  5. Casajus, A.: The position value is the Myerson value, in a sense. Int. J. Game Theory 36, 47–55 (2007)

    Article  MathSciNet  Google 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)

    Article  MathSciNet  Google Scholar 

  7. Kamijo, Y.: A two-step Shapley value for cooperative games with coalition structures. Int. Game Theory Rev. 11, 207–214 (2007)

    Article  MathSciNet  Google Scholar 

  8. 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)

    Article  MathSciNet  Google Scholar 

  9. Meessen, R.: Communication games. Master’s thesis, Department of Mathematics, University of Nijmegen, The Netherlands (1988) (in Dutch)

    Google Scholar 

  10. Myerson, R.B.: Graphs and cooperation in games. Math. Oper. Res. 2, 225–229 (1977)

    Article  MathSciNet  Google Scholar 

  11. Myerson, R.B.: Conference structures and fair allocation rules. Int. J. Game Theory 9, 169–182 (1980)

    Article  MathSciNet  Google Scholar 

  12. Owen, G.: Value of games with a priori unions. In: Henn, R., Moeschlin, O. (eds.) Mathematical Economics and Game Theory, pp. 76–88. Springer, Berlin (1977)

    Chapter  Google Scholar 

  13. Shan, E., Zhang, G., Dong, Y.: Component-wise proportional solutions for communication graph games. Math. Soc. Sci. 81, 22–28 (2016)

    Article  MathSciNet  Google Scholar 

  14. 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 University Press, Princeton (1953)

    Google Scholar 

  15. Slikker, M.: A characterization of the position value. Int. J. Game Theory 33, 505–514 (2005)

    Article  MathSciNet  Google Scholar 

  16. Slikker, M., van den Nouweland, A.: Social and Economic Networks in Cooperative Game Theory. Kluwer, Norwell (2001)

    Book  Google Scholar 

  17. 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)

    Article  MathSciNet  Google Scholar 

  18. 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)

    Article  MathSciNet  Google Scholar 

  19. van den Nouweland, A., Borm, P., Tijs, S.: Allocation rules for hypergraph communication situations. Int. J. Game Theory 20, 255–268 (1992)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This research was supported in part by the National Nature Science Foundation of China (grant number 11571222).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Erfang Shan .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Shan, E., Zhang, G. (2018). The Position Value and the Myerson Value for Hypergraph Communication Situations. In: Petrosyan, L., Mazalov, V., Zenkevich, N. (eds) Frontiers of Dynamic Games. Static & Dynamic Game Theory: Foundations & Applications. Birkhäuser, Cham. https://doi.org/10.1007/978-3-319-92988-0_14

Download citation

Publish with us

Policies and ethics