Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/260322 
Year of Publication: 
2021
Series/Report no.: 
Working Paper No. 2021:2
Publisher: 
Lund University, School of Economics and Management, Department of Economics, Lund
Abstract: 
We analyze the problem of allocating indivisible objects and monetary compensations to a set of agents. In particular, we consider envy-free and budget-balanced rules that are least manipulable with respect to agents counting or with respect to utility gains. A key observation is that, for any profile of quasi-linear preferences, the outcome of any such least manipulable envy-free rule can be obtained via so-called agent-k-linked allocations. Given this observation, we provide an algorithm for identifying agent-k-linked allocations.
Subjects: 
Envy-freeness
Budget-balance
Least manipulable
Algorithm
JEL: 
C71
C78
D63
D71
D78
Document Type: 
Working Paper

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.