() and Lars Ehlers
Tommy Andersson: Department of Economics, Lund University, Postal: Department of Economics, School of Economics and Management, Lund University, Box 7082, S-220 07 Lund, Sweden
Lars Ehlers: CIREQ, Postal: Université de Montréal, Montréal, Québec H3C 3J7, Canada
Abstract: We consider envy-free and budget-balanced rules that are least manipulable with respect to agents counting or with respect to utility gains, and observe that for any profile of quasi-linear preferences, the outcome of any such least manipulable envy-free rule can be obtained via agent-k-linked allocations. Given this observation, we provide an algorithm for identifying agent-k-linked allocations.
9 pages, October 15, 2014
Full text files
Questions (including download problems) about the papers in this series should be directed to David Edgerton ()
Report other problems with accessing this service to Sune Karlsson ().
This page generated on 2018-02-06 14:12:39.