Exact Method for a Fair Allocation Problem

  • Edênis F. Azevedo USP / Tecsinapse
  • Carlos E. Ferreira USP
  • Alexandre S. Freire USP
  • Aritanan Gruber UFABC
  • Augusto Vellozo Tecsinapse
DOI: https://doi.org/10.5753/etc.2017.3208

Abstract


We consider the problem of fairly allocating a collection of indivisible goods to agents. It is desired to find an allocation such that all agents are equally satisfied. This problem has an application of a company that wants to allocate its production of vehicles to its dealers. We give an exact method for the problem and some preliminary results of the execution with some instances of the application.

References

Bansal, N. and Sviridenko, M. (2006). The santa claus problem. In Proceedings of the Thirty-eighth Annual ACM Symposium on Theory of Computing, STOC ’06, pages 31–40, New York, NY, USA. ACM.

Golovin, D. (2005). Max-min fair allocation of indivisible goods. Technical Report CMU-CS-05-144, School of Computer Science, Carnegie Mellon University.

Le Boudec, J.-Y. (2008). Rate adaptation, Congestion Control and Fairness: A Tutorial.
Published
2017-07-02
How to Cite

Select a Format
AZEVEDO, Edênis F.; FERREIRA, Carlos E.; FREIRE, Alexandre S.; GRUBER, Aritanan; VELLOZO, Augusto. Exact Method for a Fair Allocation Problem. In: PROCEEDINGS OF THE THEORY OF COMPUTATION MEETING (ETC), 2. , 2017, São Paulo. Anais [...]. Porto Alegre: Sociedade Brasileira de Computação, 2017 . p. 124-127. ISSN 2595-6116. DOI: https://doi.org/10.5753/etc.2017.3208.