OBVIOUSLY STRATEGY‐PROOF IMPLEMENTATION OF ASSIGNMENT RULES: A NEW CHARACTERIZATION

Pinaki Mandal and Souvik Roy

International Economic Review, 2022, vol. 63, issue 1, 261-290

Abstract: We consider assignment problems where individuals are to be assigned at most one indivisible object and monetary transfers are not allowed. We provide a characterization of assignment rules that are Pareto efficient, nonbossy, and implementable in obviously strategy‐proof (OSP) mechanisms. As corollaries of our result, we obtain a characterization of OSP‐implementable fixed priority top trading cycles (FPTTC) rules, hierarchical exchange rules, and trading cycles rules. Troyan (International Economic Review 60 (2019), 1249–61) provides a characterization of OSP‐implementable FPTTC rules when there are equal number of individuals and objects. Our result generalizes this for arbitrary values of those.

Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://doi.org/10.1111/iere.12538

Related works:
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:wly:iecrev:v:63:y:2022:i:1:p:261-290

Ordering information: This journal article can be ordered from
http://www.blackwell ... bs.asp?ref=0020-6598

Access Statistics for this article

International Economic Review is currently edited by Michael O'Riordan and Dirk Krueger

More articles in International Economic Review from Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association 160 McNeil Building, 3718 Locust Walk, Philadelphia, PA 19104-6297. Contact information at EDIRC.
Bibliographic data for series maintained by Wiley Content Delivery ().