Rank-Minimizing Random Assignment

A random assignment is rank-minimizing if it has the minimum average rank of objects for agents among all possible assignments. We show that a rank-minimizing random assignment is rank efficient, in the sense of Featherstone (2020). Moreover, we propose a mechanism called the Random Borda-Ranked, which is rank-minimizing and satisfies equal treatment of equals and weak strategyproofness

MoreLess

Year of publication:	2022
Authors:	Feizi, Mehdi
Publisher:	[S.l.] : SSRN

More details
Report error

Extent:	1 Online-Ressource (10 p)
Type of publication:	Book / Working Paper
Language:	English
Other identifiers:	10.2139/ssrn.4239466 [DOI]
Source:	ECONIS - Online Catalogue of the ZBW

Persistent link: https://www.econbiz.de/10014244317