Abstract
In this paper we propose an algorithm for solving a fair division problem: We want to find a distribution of a set of divisible items among a set of agents such that the agent who is getting the lowest amount obtains his maximum possible value. Even more, according to the found distribution, each agent obtains the same amount, and this is as high as possible. We model this situation as a linear programming problem and we use its dual problem for solving it. For doing this, we associate a bipartite graph with each set of dual variables. The algorithm presented uses the intrinsic relations in this kind of graphs for searching the optimal solution for the primal and dual problems. Finally, we show the convergence of the proposed algorithm.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Austin AK (1982) Sharing a cake. Math Gaz 6 437:212–215
Brams SJ, Taylor AD (1996) Fair division—from cake-cutting to dispute resolution. Cambridge University Press, Cambridge
Neyman J (1946) Un theoreme d’existence. CR Acad Sci Paris 222:843–845
Steinhaus H (1948) The problem of fair division. Econometrica 16:101–104
Stromquist W (1980) How to cute a cake fairly. Am Math Mon 87:640–644
Acknowledgments
We want to express our gratitude to both anonymous referees for the thoroughness of their reviews and for the many comments which have helped to make this a better article. Also, we want to acknowledge support from CONACyT research grant 167924.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Olvera-López, W., Sánchez-Sánchez, F. An algorithm based on graphs for solving a fair division problem. Oper Res Int J 14, 11–27 (2014). https://doi.org/10.1007/s12351-013-0133-6
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12351-013-0133-6