Abstract
We discuss the proportionally fair allocation of a set of indivisible items to k agents. We assume that each agent specifies only a ranking of the items from best to worst. Agents do not specify their valuations of the items. An allocation is proportionally fair if all agents believe that they have received their fair share of the value according to how they value the items.
We give simple conditions (and a fast algorithm) for determining whether the agents rankings give sufficient information to determine a proportionally fair allocation. An important special case is a divorce situation with two agents. For such a divorce situation, we provide a particularly simple allocation rule that should have applications in the real world.
Keywords
JEL Classification
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Brams, S.J., Taylor, A.D.: Fair Division – From cake cutting to dispute resolution. Cambridge University Press, Cambridge (1996)
Brams, S.J., Taylor, A.D.: The Win-Win Solution: Guaranteeing fair shares to everybody. W.W. Norton, New York (1999)
Dubins, L.E., Spanier, E.H.: How to cut a cake fairly. American Mathematical Monthly 68, 1–17 (1961)
Lovász, L., Plummer, M.D.: Matching Theory. Anaals of Discrete Mathematics, vol. 29. North-Holland (1986)
Robertson, J.M., Webb, W.A.: Cake-cutting algorithms: Be fair if you can. A.K. Peters Ltd., Natick (1998)
Steinhaus, H.: The problem of fair division. Econometrica 16, 101–104 (1948)
Woodall, D.R.: A note on the cake-division problem. Journal of Combinatorial Theory A42, 300–301 (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pruhs, K., Woeginger, G.J. (2012). Divorcing Made Easy. In: Kranakis, E., Krizanc, D., Luccio, F. (eds) Fun with Algorithms. FUN 2012. Lecture Notes in Computer Science, vol 7288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30347-0_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-30347-0_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30346-3
Online ISBN: 978-3-642-30347-0
eBook Packages: Computer ScienceComputer Science (R0)