Conference structures and fair allocation rules (original) (raw)

Abstract

To describe how the outcome of a cooperative game might depend on which groups of players hold cooperative planning conferences, we study allocation rules, which are functions mapping conference structures to payoff allocations. An allocation rule is fair if every conference always gives equal benefits to all its members. Any characteristic function game without sidepayments has a unique fair allocation rule. The fair allocation rule also satisfies a balanced contributions formula, and is closely related to Harsanyi's generalized Shapley value for games without sidepayments. If the game is superadditive, then the fair allocation rule also satisfies a stability condition.

Access this article

Log in via an institution

Subscribe and save

Buy Now

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

Instant access to the full article PDF.

Similar content being viewed by others

References

Download references

Author information

Authors and Affiliations

  1. Graduate School of Management, Northwestern University, 60201, Evanston, IL, USA
    R. B. Myerson

Additional information

This paper was written while the author was a visitor at the Zentrum für interdisziplinare Forschung, in the University of Bielefeld, Bielefeld, Germany.

Rights and permissions

About this article

Cite this article

Myerson, R.B. Conference structures and fair allocation rules.Int J Game Theory 9, 169–182 (1980). https://doi.org/10.1007/BF01781371

Download citation

Keywords