24 citations · 82 across the 26 of their papers we have counts for
4 papers · 1 filter
Stochastic k-Server: How Should Uber Work?
Sina Dehghani, Soheil Ehsani, MohammadTaghi HajiAghayi +2
In this paper, we study a stochastic variant of the celebrated k-server problem. In the k-server problem, we are required to minimize the total movement of k servers that are servi…
Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering
Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi +3
We design the first online algorithm with poly-logarithmic competitive ratio for the edge-weighted degree-bounded Steiner forest(EW-DB-SF) problem and its generalized variant. We o…
Fair Allocation of Indivisible Goods to Asymmetric Agents
Alireza Farhadi, Mohammad Ghodsi, MohammadTaghi Hajiaghayi +5
We study fair allocation of indivisible goods to agents with unequal entitlements. Fair allocation has been the subject of many studies in both divisible and indivisible settings.…
Fair Allocation of Indivisible Goods: Improvement and Generalization
Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Masoud Seddighin +2
We study the problem of fair allocation for indivisible goods. We use the the maxmin share paradigm introduced by Budish as a measure for fairness. Procaccia and Wang (EC'14) were…