@inproceedings{f4860233a6c5422d8e78c10e877b3846,
title = "Distributed local search for minimizing envy",
abstract = "The allocation of indivisible resources to multiple agents typically generate envy among the agents. An Envy Free allocation may not exist in general and one can search for a minimal envy allocation. The search problem of minimizing envy for indivisible resource allocation is presented and a negotiation based transfer algorithm for solving it is proposed. The proposed algorithm performs a distributed any time local search for minimal envy solutions. The algorithm is composed of two phases. One phase performs hill climbing by the transfer of a single good among agents. The other phase of search uses elimination of open-end envy cycles, thereby utilizing the transfer of whole bundles. An extensive experimental evaluation of the proposed algorithm demonstrates the advantage of using the combined two phase algorithm.",
author = "Arnon Netzer and Amnon Meisels",
year = "2013",
month = jan,
day = "1",
doi = "10.1109/WI-IAT.2013.90",
language = "English",
isbn = "9781479929023",
series = "Proceedings - 2013 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2013",
publisher = "Institute of Electrical and Electronics Engineers",
pages = "53--58",
booktitle = "Proceedings - 2013 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2013",
address = "United States",
note = "2013 12th IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2013 ; Conference date: 17-11-2013 Through 20-11-2013",
}