23 citations · 84 across the 36 of their papers we have counts for
51 papers
On Fair Allocation of Indivisible Goods to Submodular Agents
Gilad Ben Uziahu, Uriel Feige
We consider the problem of fair allocation of indivisible goods to agents with submodular valuation functions, where agents may have either equal entitlements or arbitrary (possibl…
On picking sequences for chores
Uriel Feige, Xin Huang
We consider the problem of allocating indivisible chores to agents with additive disvaluation (cost) functions. It is easy to show that there are picking sequences that giv…
Fair Shares: Feasibility, Domination and Incentives
Moshe Babaioff, Uriel Feige
We consider fair allocation of a set of indivisible goods to equally-entitled agents, with no monetary transfers. Every agent has a valuation from some given clas…
Improved maximin fair allocation of indivisible items to three agents
Uriel Feige, Alexey Norkin
We consider the problem of approximate maximin share (MMS) allocation of indivisible items among three agents with additive valuation functions. For goods, we show that an $\frac{1…
On allocations that give intersecting groups their fair share
Uriel Feige, Yehonatan Tahan
We consider item allocation to individual agents who have additive valuations, in settings in which there are protected groups, and the allocation needs to give each protected grou…
A tight bound for the clique query problem in two rounds
Uriel Feige, Tom Ferster
We consider a problem introduced by Feige, Gamarnik, Neeman, Rácz and Tetali [2020], that of finding a large clique in a random graph , where the graph …