Skip to main content
SpringerLink
Log in

A set of axioms for a value for partition function games

  • Published:
International Journal of Game Theory Aims and scope Submit manuscript

Abstract

Myerson (1977) derived an efficient value for games in partition function form. In this paper, we present a set of axioms which characterize a different efficient value for such games. This latter value assigns value 0 to dummies and assigns nonnegative values to players in monotone simple games.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Bolger EM (1986) Power indices for multicandidate voting games. International J Game Theory 14:175–186

    Google Scholar 

  • Lucas WF, Thrall RM (1963)n-person games in partition function form. Naval Research Logistics Quarterly X:281–298

    Google Scholar 

  • Myerson RB (1977) Values of games in partition function form. International J Game Theory 6:23–31

    Google Scholar 

  • Shapley LS (1953) A value forn-person games. In: Kuhn HW, Tucker AW (eds) Contributions to the theory of games II. Princeton, pp 307–317

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Statistics, Miami University, 45056, Oxford, Ohio, USA

    E. M. Bolger

Authors
  1. E. M. Bolger
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bolger, E.M. A set of axioms for a value for partition function games. Int J Game Theory 18, 37–44 (1989). https://doi.org/10.1007/BF01248494

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01248494

Keywords

Search

Navigation