Fairness in routing and load balancing
Journal of Computer and System Sciences - Special issue on Internet algorithms
Fairness measures for resource allocation
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
On approximately fair allocations of indivisible goods
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
A lexicographically fair allocation of discrete bandwidth for multirate multicast traffics
Computers and Operations Research
Allocation of indivisible goods: a general model and some complexity results
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Max-min fairness in multi-commodity flows
Computers and Operations Research
To be fair or efficient or a bit of both
Computers and Operations Research
Journal of Artificial Intelligence Research
Egalitarian allocations of indivisible resources: theory and computation
CIA'06 Proceedings of the 10th international conference on Cooperative Information Agents
| Hi-index | 0.01 |
In this paper, we introduce a branch-and-bound algorithm for solving fair division problems with indivisible items. Unlike similar algorithms for this problem, our algorithm is applicable to a wide class of possible fairness criteria. Computational results show that the algorithm exhibits very good performance for a considerable number of problem instances. Main applications of the algorithm are seen in computational studies of fairness criteria and fair division problems. In these problems, a relatively small number of items is considered, so an exact algorithm can be used even though the problem is a generalization of the set partitioning problem, which is NP-complete. An exemplary study comparing Max-min and Nash bargaining solutions to the fair division problem illustrates the use of the algorithm.