Skip to main content
Log in

Strategy-proofness, solidarity, and consistency for multiple assignment problems

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

Abstract.

We consider a problem of allocating indivisible objects when agents may desire to consume more than one object and no monetary transfers are allowed. We are interested in allocation rules that satisfy desirable properties from an economic and social point of view. In addition to strategy-proofness and Pareto efficiency, we consider consistency and two solidarity properties (replacement-domination and population-monotonicity). In most of the cases, these properties are satisfied only by serially dictatorial rules.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: November 1999/Final version: December 2001

Rights and permissions

Reprints and permissions

About this article

Cite this article

Klaus, B., Miyagawa, E. Strategy-proofness, solidarity, and consistency for multiple assignment problems. Game Theory 30, 421–435 (2002). https://doi.org/10.1007/s001820100088

Download citation

  • Issue Date:

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

Navigation