An algorithm for identifying agent-k-linked allocations in economies with indivisibilities
Article [Version of Record]
Is part ofCahier de recherche ; #2013-12
Publisher(s)Université de Montréal. Département de sciences économiques.
We consider envy-free (and budget-balanced) rules that are least manipulable with respect to agents counting or with respect to utility gains. Recently it has been shown 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. This note provides an algorithm for identifying agent-k-linked allocations.