Skip to main content

A Note on the Position Value for Hypergraph Communication Situations

  • Chapter
  • First Online:
Complexity and Approximation

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12000))

Abstract

The position value Meessen [3] is an important allocation rule for communication situations. The axiomatic characterization of the position value for arbitrary graph communication situations were given by Slikker [8]. However, the characterization of the position value for arbitrary hypergraph communication situations remains an open problem. This note provides an axiomatic characterization of the position value for arbitrary hypergraph communication situations by employing component efficiency and partial balanced hyperlink contributions given in Shan et al. [6].

Research was partially supported by NSFC (grant number 11971298).

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Institutional subscriptions

Similar content being viewed by others

References

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

    Article  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  3. Meessen, R.: Communication games, Masters thesis, Department of Mathematics. University of Nijmegen, The Netherlands (1988). (in Dutch)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  6. Shan, E., Zhang, G., Shan, X.: The degree value for games with communication structure. Int. J. Game Theory 47, 857–871 (2018)

    Article  MathSciNet  Google Scholar 

  7. Shapley, L.S.: A value for \(n\)-person games. In: Kuhn, H., Tucker, A. (eds.) Contributions to the Theory of Games II, pp. 307–317. Princeton University Press, Princeton (1953)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  9. Slikker, M., van den Nouweland, A.: Social and Economic Networks in Cooperative Games. Kluwer Academic Publishers (2001)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

Download references

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

© 2020 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Shan, E., Shi, J., Lv, W. (2020). A Note on the Position Value for Hypergraph Communication Situations. In: Du, DZ., Wang, J. (eds) Complexity and Approximation. Lecture Notes in Computer Science(), vol 12000. Springer, Cham. https://doi.org/10.1007/978-3-030-41672-0_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-41672-0_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-41671-3

  • Online ISBN: 978-3-030-41672-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics