Envy-Free Makespan Approximation (2009)
Cohen, Edith, Feldman, Michal, Fiat, Amos, Kaplan, Haim, Olonetsky, Svetlana
We study envy-free mechanisms for scheduling tasks on unrelated machines (agents) that approximately minimize the makespan. For indivisible tasks, we put forward an envy-free poly-time mechanism that...
Strong Price of Anarchy for Machine Load Balancing (2008)
Amos Fiat, Haim Kaplan, Meital Levy, Svetlana Olonetsky
Abstract. As defined by Aumann in 1959, a strong equilibrium is a Nash equilibrium that is resilient to deviations by coalitions. We give tight bounds on the strong price of anarchy for load...
by
Amotz Bar-noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky
conflict-free coloring for geometric hypergraphs
Strong Price of Anarchy for Machine Load Balancing (2008)
Amos Fiat, Haim Kaplan, Meital Levy, Svetlana Olonetsky
Abstract. As defined by Aumann in 1959, a strong equilibrium is a Nash equilibrium that is resilient to deviations by coalitions. We give tight bounds on the strong price of anarchy for load...
Strong Price of Anarchy for Machine Load Balancing (2007)
Fiat, Amos, Levy, Meital, Kaplan, Haim, Olonetsky, Svetlana
As defined by Aumann in 1959, a strong equilibrium is a Nash equilibrium that is resilient to deviations by coalitions. We give tight bounds on the strong price of anarchy for load balancing on...
On the price of stability for designing undirected networks with fair cost allocations (2006)
Amos Fiat, Haim Kaplan, Meital Levy, Svetlana Olonetsky
Abstract. In this paper we address the open problem of bounding the price of stability for network design with fair cost allocation for undirected graphs posed in [1]. We consider the case where...
On the price of stability for designing undirected networks with fair cost allocations (2006)
Amos Fiat, Haim Kaplan, Meital Levy, Svetlana Olonetsky, Ronen Shabo
Abstract. In this paper we address the open problem of bounding the price of stability for network design with fair cost allocation for undirected graphs posed in [1]. For the version of this problem...