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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
