Efficiency and strategy-proofness in object assignment problems with multi demand preferences

Tomoya Kazumura () and Shigehiro Serizawa

ISER Discussion Paper from Institute of Social and Economic Research, The University of Osaka

Abstract: Consider the problem of allocating objects to agents and how much they should pay. Each agent has a preference relation over pairs of a set of objects and a payment. Preferences are not necessarily quasi-linear. Non-quasi-linear preferences describe environments where payments influence agents' abilities to utilize objects. This paper is to investigate the possibility of designing efficient and strategy-proof rules in such environments. A preference relation is single demand if an agent wishes to receive at most one object; it is multi demand if whenever an agent receives one object, an additional object makes him better off. We show that if a domain contains all the single demand preferences and at least one multi demand preference relation, and there are more agents than objects, then no rule satisfies efficiency, strategy-proofness, individual rationality, and no subsidy for losers on the domain.

Date: 2015-08
New Economics Papers: this item is included in nep-ger, nep-gth and nep-mic
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://www.iser.osaka-u.ac.jp/static/resources/docs/dp/2015/DP0943.pdf

Related works:
Journal Article: Efficiency and strategy-proofness in object assignment problems with multi-demand preferences (2016)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:dpr:wpaper:0943

Access Statistics for this paper

More papers in ISER Discussion Paper from Institute of Social and Economic Research, The University of Osaka Contact information at EDIRC.
Bibliographic data for series maintained by Librarian ().