Strategy-Proofness and Efficiency for Non-quasi-linear Common-Tiered-Object Preferences: Characterization of Minimum Price Rule
Yu Zhou and
Shigehiro Serizawa ()
ISER Discussion Paper from Institute of Social and Economic Research, Osaka University
We consider the allocation problem of assigning heterogeneous objects to a group of agents and determining how much they should pay. Each agent receives at most one object. Agents have non-quasi-linear preferences over bundles, each consisting of an object and a payment. Especially, we focus on the cases: (i) objects are linearly ranked, and as long as objects are equally priced, agents commonly prefer a higher ranked object to a lower ranked one, and (ii) objects are partitioned into several tiers, and as long as objects are equally priced, agents commonly prefer an object in the higher tier to an object in the lower tier. The minimum price rule assigns minimum price (Walrasian) equilibrium to each preference profile. We establish: (i) on a common-object-ranking domain, the minimum price rule is the only rule satisfying efficiency, strategy-proofness, individual rationality and no subsidy, and (ii) on a common-tiered-object domain, the minimum price rule is the only rule satisfying these four axioms.
New Economics Papers: this item is included in nep-gth, nep-mic, nep-net and nep-upt
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2) Track citations by RSS feed
Downloads: (external link)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:dpr:wpaper:0971
Access Statistics for this paper
More papers in ISER Discussion Paper from Institute of Social and Economic Research, Osaka University Contact information at EDIRC.
Bibliographic data for series maintained by Librarian ().