61 citations · 206 across the 60 of their papers we have counts for
18 papers · 1 filter
Delegating to Multiple Agents
MohammadTaghi Hajiaghayi, Keivan Rezaei, Suho Shin
We consider a multi-agent delegation mechanism without money. In our model, given a set of agents, each agent has a fixed number of solutions which is exogenous to the mechanism, a…
Bandit Social Learning: Exploration under Myopic Behavior
Kiarash Banihashem, MohammadTaghi Hajiaghayi, Suho Shin +1
We study social learning dynamics motivated by reviews on online platforms. The agents collectively follow a simple multi-armed bandit protocol, but each agent acts myopically, wit…
Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings
Alireza Farhadi, MohammadTaghi Hajiaghayi, Mohamad Latifian +2
Envy-free up to one good (EF1) and envy-free up to any good (EFX) are two well-known extensions of envy-freeness for the case of indivisible items. It is shown that EF1 can always…
Computing Stackelberg Equilibria of Large General-Sum Games
Avrim Blum, Nika Hagtalab, MohammadTaghi Hajiaghayi +1
We study the computational complexity of finding Stackelberg Equilibria in general-sum games, where the set of pure strategies of the leader and the followers are exponentially lar…
Fast Algorithms for Knapsack via Convolution and Prediction
MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Saeed Seddighin +1
The \Problem{knapsack} problem is a fundamental problem in combinatorial optimization. It has been studied extensively from theoretical as well as practical perspectives as it is o…
On the Complexity of Chore Division
Alireza Farhadi, MohammadTaghi Hajiaghayi
We study the proportional chore division problem where a protocol wants to divide an undesirable object, called chore, among different players. The goal is to find an allocatio…