Tommy Andersson (tommy.andersson@nek.lu.se) and Lars Ehlers (lars.ehlers@umontreal.ca)
Additional contact information
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.
Keywords: least manipulable envy-free rules; algorithm
JEL-codes: C71; C78; D63; D71; D78
9 pages, October 15, 2014
Full text files
wp14_35.pdf![]()
Questions (including download problems) about the papers in this series should be directed to Iker Arregui Alegria (wp-editor@nek.lu.se)
Report other problems with accessing this service to Sune Karlsson (sune.karlsson@oru.se).
RePEc:hhs:lunewp:2014_035This page generated on 2024-09-13 22:16:10.