Strategy-proof and Pareto efficient allocation of indivisible goods: general impossibility domains

Research output: Contribution to journalArticlepeer-review


We consider the problem of allocating several homogeneous indivisible goods when monetary transfers among agents are possible. We study the possibility of constructing strategy-proof and Pareto efficient mechanisms on restricted domains of agents’ valuation profiles. We show that there is no strategy-proof and Pareto efficient mechanism under the weak domain condition that all agents’ sets of possible valuations share at least four common valuations satisfying a certain inequality. Moreover, we prove that this impossibility result is robust to any affine transformation of domains, and we examine this impossibility result when the set of agent’s possible valuations consists of finite integers.

Original languageEnglish
Pages (from-to)419-432
Number of pages14
JournalInternational Journal of Game Theory
Issue number2
Publication statusPublished - 2021 Jun
Externally publishedYes


  • Indivisible good
  • Monetary transfer
  • Pareto efficiency
  • Restricted domain
  • Strategy-proofness

ASJC Scopus subject areas

  • Statistics and Probability
  • Mathematics (miscellaneous)
  • Social Sciences (miscellaneous)
  • Economics and Econometrics
  • Statistics, Probability and Uncertainty


Dive into the research topics of 'Strategy-proof and Pareto efficient allocation of indivisible goods: general impossibility domains'. Together they form a unique fingerprint.

Cite this