Distributed Envy Minimization for Resource Allocation

Arnon Netzer, Amnon Meisels

2013

Abstract

The allocation of indivisible resources to multiple agents generates envy among the agents. An Envy Free allocation may not exist in general and one can search for a minimal envy allocation. The present paper proposes a formulation of this problem in a distributed search framework. Distributed Envy Minimization (DEM) - A Branch and Bound based distributed search algorithm for finding the envy minimizing allocation is presented and its correctness is proven. Two improvements to the DEM algorithm are presented - Forward Estimate (DEM-FE) and Forward Bound (DEM-FB). An experimental evaluation of the three algorithms demonstrates the benefit of using the Forward Estimate and Forward Bound techniques.

References

  1. Asadpour, A. and Saberi, A. (2007). An approximation algorithm for max-min fair allocation of indivisible goods. In STOC, pages 114-121.
  2. Bouveret, S. and Lang, J. (2008). Efficiency and envyfreeness in fair division of indivisible goods: Logical representation and complexity. J. Artif. Intell. Res. (JAIR), 32:525-564.
  3. Brams, S. J. and Taylor, A. D. (1996). Fair division - from cake-cutting to dispute resolution. Cambridge University Press.
  4. Chevaleyre, Y., Endriss, U., Estivie, S., and Maudet, N. (2007). Reaching envy-free states in distributed negotiation settings. In IJCAI, pages 1239-1244.
  5. Endriss, U., Maudet, N., Sadri, F., and Toni, F. (2006). Negotiating socially optimal allocations of resources. J. Artif. Intell. Res. (JAIR), 25:315-348.
  6. Gershman, A., Meisels, A., and Zivan, R. (2009). Asynchronous forward bounding. Journal of Artificial Intelligence Research, 34:25-46.
  7. Grubshtein, A., Grinshpoun, T., Meisels, A., and Zivan, R. (2009). Asymmetric distributed constraint optimization. In IJCAI-09, Pasadena.
  8. Hirayama, K. and Yokoo, M. (1997). Distributed partial constraint satisfaction problem. In Proc. 3rd Intern. Conf. Princ. Pract. Const. Prog. (CP-97), pages 222- 236.
  9. Kleinberg, J. M., Rabani, Y., and Tardos, Ó . (2001). Fairness in routing and load balancing. J. Comput. Syst. Sci., 63(1):2-20.
  10. Larrosa, J. and Meseguer, P. (1996). Phase transition in max-csp. In Proc. 12th European Conference on Artificial Intelligence (ECAI-96), pages 190-194, Budapest, Hungary.
  11. Lee, C. Y., Moon, Y. P., and Cho, Y. J. (2004). A lexicographically fair allocation of discrete bandwidth for multirate multicast traffics. Computers & OR, 31(14):2349-2363.
  12. Lipton, R. J., Markakis, E., Mossel, E., and Saberi, A. (2004). On approximately fair allocations of indivisible goods. In ACM Conference on Electronic Commerce, pages 125-131.
  13. LisÉ, V., Zivan, R., Sycara, K. P., and Pechoucek, M. (2010). Deception in networks of mobile sensing agents. In 9th Intern. Conf. Auton. Agents Mult. Sys. (AAMAS-10), pages 1031-1038, Toronto, Canada.
  14. Lynch, N. A. (1996). Kaufmann.
  15. Maheswaran, R. T., Tambe, M., Bowring, E., Pearce, J. P., and Varakantham, P. (2004). Taking DCOP to the real world: Efficient complete solutions for distributed multi-event scheduling. In 3rd Intern. Joint Conf. Auton. Agents Mult. Sys. (AAMAS-04), pages 310-317, New York, USA.
  16. Meisels, A. (2007). Distributed Search by Constrained Agents: Algorithms, Performance, Communication. Springer Verlag.
  17. Moulin, H. (1988). Axioms of Cooperative Decision Making. Cambridge University Press.
  18. Netzer, A., Grubshtein, A., and Meisels, A. (2012). Concurrent forward bounding for distributed constraint optimization problems. Artificial Intelligence, 193(0):186 - 216.
  19. Rosenschein, J. S. and Zlotkin, G. (1994). Rules of Encounter - Designing Conventions for Automated Negotiation among Computers. MIT Press.
  20. Stranders, R., Farinelli, A., Rogers, A., and Jennings, N. R. (2009). Decentralised coordination of continuously valued control parameters using the max-sum algorithm. In Proc. 8th Intern. Joint Conf. Auton. Agents Mult. Sys. (AAMAS-09), pages 601-608, Budapest, Hungary.
  21. Vetschera, R. (2010). A general branch-and-bound algorithm for fair division problems. Computers & OR, 37(12):2121-2130.
  22. Yeoh, W., Felner, A., and Koenig, S. (2010). BnBADOPT: An asynchronous branch-and-bound DCOP algorithm. Jour. Artif. Intell. Res. (JAIR), 38:85-133.
  23. Yokoo, M. (2000). Algorithms for distributed constraint satisfaction problems: A review. Autonomous Agents and Multi-Agent Systems, 3:198-212.
  24. Zivan, R. and Meisels, A. (2006). Message delay and DisCSP search algorithms. Annals of Mathematics and Artificial Intelligence (AMAI), 46:415-439.
Download


Paper Citation


in Harvard Style

Netzer A. and Meisels A. (2013). Distributed Envy Minimization for Resource Allocation . In Proceedings of the 5th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, ISBN 978-989-8565-38-9, pages 15-24. DOI: 10.5220/0004186700150024


in Bibtex Style

@conference{icaart13,
author={Arnon Netzer and Amnon Meisels},
title={Distributed Envy Minimization for Resource Allocation},
booktitle={Proceedings of the 5th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,},
year={2013},
pages={15-24},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004186700150024},
isbn={978-989-8565-38-9},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 5th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,
TI - Distributed Envy Minimization for Resource Allocation
SN - 978-989-8565-38-9
AU - Netzer A.
AU - Meisels A.
PY - 2013
SP - 15
EP - 24
DO - 10.5220/0004186700150024