Uriel Feige | DeepAI

DeepAI AI Chat

Featured Co-authors

Xin Huang
84 publications
Michal Feldman
36 publications
David Gamarnik
35 publications
Janardhan Kulkarni
33 publications
Shi Li
27 publications
Moshe Babaioff
22 publications
Miklos Z. Racz
17 publications
Tomer Ezra
16 publications
Alon Eden
12 publications
Prasad Tetali
10 publications
Joe Neeman
8 publications

∙ 03/22/2023

On Fair Allocation of Indivisible Goods to Submodular Agents

We consider the problem of fair allocation of indivisible goods to agent...

0 Gilad Ben Uziahu, et al. ∙

∙ 11/25/2022

On picking sequences for chores

We consider the problem of allocating m indivisible chores to n agents w...

0 Uriel Feige, et al. ∙

∙ 05/16/2022

Fair Shares: Feasibility, Domination and Incentives

We consider fair allocation of a set M of indivisible goods to n equally...

2 Moshe Babaioff, et al. ∙

∙ 05/11/2022

Improved maximin fair allocation of indivisible items to three agents

We consider the problem of approximate maximin share (MMS) allocation of...

0 Uriel Feige, et al. ∙

∙ 04/14/2022

On allocations that give intersecting groups their fair share

We consider item allocation to individual agents who have additive valua...

0 Uriel Feige, et al. ∙

∙ 12/11/2021

A tight bound for the clique query problem in two rounds

We consider a problem introduced by Feige, Gamarnik, Neeman, Rácz and Te...

0 Uriel Feige, et al. ∙

∙ 04/11/2021

A tight negative example for MMS fair allocations

We consider the problem of allocating indivisible goods to agents with a...

0 Uriel Feige, et al. ∙

∙ 03/07/2021

Fair-Share Allocations for Agents with Arbitrary Entitlements

We consider the problem of fair allocation of indivisible goods to n age...

0 Moshe Babaioff, et al. ∙

∙ 02/26/2021

Are Gross Substitutes a Substitute for Submodular Valuations?

The class of gross substitutes (GS) set functions plays a central role i...

0 Shahar Dozinski, et al. ∙

∙ 02/09/2021

Best-of-Both-Worlds Fair-Share Allocations

We consider the problem of fair allocation of indivisible items among n ...

0 Moshe Babaioff, et al. ∙

∙ 06/16/2020

Quantitative Group Testing and the rank of random matrices

Given a random Bernoulli matrix A∈{0,1}^m× n, an integer 0< k < n and th...

0 Uriel Feige, et al. ∙

∙ 04/26/2020

How to hide a clique?

In the well known planted clique problem, a clique (or alternatively, an...

0 Uriel Feige, et al. ∙

∙ 02/25/2020

Fair and Truthful Mechanisms for Dichotomous Valuations

We consider the problem of allocating a set on indivisible items to play...

0 Moshe Babaioff, et al. ∙

∙ 11/19/2019

On the path partition number of 6-regular graphs

A path partition (also referred to as a linear forest) of a graph G is a...

0 Uriel Feige, et al. ∙

∙ 09/25/2019

A New Approach to Fair Distribution of Welfare

We consider transferable-utility profit-sharing games that arise from se...

0 Moshe Babaioff, et al. ∙

∙ 09/08/2019

Target Set Selection for Conservative Populations

Let G = (V,E) be a graph on n vertices, where d_v denotes the degree of ...

0 Uriel Feige, et al. ∙

∙ 01/23/2019

A randomized strategy in the mirror game

Alice and Bob take turns (with Alice playing first) in declaring numbers...

0 Uriel Feige, et al. ∙

∙ 12/31/2018

Tighter bounds for online bipartite matching

We study the online bipartite matching problem, introduced by Karp, Vazi...

0 Uriel Feige, et al. ∙

∙ 09/18/2018

Finding cliques using few probes

Consider algorithms with unbounded computation time that probe the entri...

0 Uriel Feige, et al. ∙

∙ 07/25/2018

A Polynomial Time Constant Approximation For Minimizing Total Weighted Flow-time

We consider the classic scheduling problem of minimizing the total weigh...

0 Uriel Feige, et al. ∙

∙ 03/14/2018

Max-Min Greedy Matching

A bipartite graph G(U,V;E) that admits a perfect matching is given. One ...

0 Alon Eden, et al. ∙

∙ 06/19/2014

Why are images smooth?

It is a well observed phenomenon that natural images are smooth, in the ...

0 Uriel Feige, et al. ∙