@inproceedings{47a04b7ee09648668accbd8070a771e2,
title = "Distributed Envy Minimization for resource allocation",
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.",
keywords = "Distributed search, Envy Minimization, Indivisible goods, Resource allocation",
author = "Arnon Netzer and Amnon Meisels",
year = "2013",
language = "אנגלית",
isbn = "9789898565389",
series = "ICAART 2013 - Proceedings of the 5th International Conference on Agents and Artificial Intelligence",
pages = "15--24",
booktitle = "ICAART 2013 - Proceedings of the 5th International Conference on Agents and Artificial Intelligence",
note = "5th International Conference on Agents and Artificial Intelligence, ICAART 2013 ; Conference date: 15-02-2013 Through 18-02-2013",
}