Distributed local search for minimizing envy Conference Paper uri icon


  • 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 …

publication date

  • November 17, 2013