Uriel Feige

ORCID

Publication Activity (10 Years)

Years Active: 1987-2024
Publications (10 Years): 69

Top Venues

CoRR

Random Struct. Algorithms

SIAM J. Comput.

Publications

Uriel Feige
Low communication protocols for fair allocation of indivisible goods. CoRR (2024)
Moshe Babaioff, Uriel Feige
Share-Based Fairness for Arbitrary Entitlements. CoRR (2024)
Uriel Feige
The inversion paradox, and classification of fairness notions. CoRR (2023)
Gilad Ben Uziahu, Uriel Feige
On Fair Allocation of Indivisible Goods to Submodular Agents. CoRR (2023)
Uriel Feige, Xin Huang
On picking sequences for chores. EC (2023)
Yushi Bai, Uriel Feige, Paul Gölz, Ariel D. Procaccia
Fair Allocations for Smoothed Utilities. EC (2022)
Moshe Babaioff, Uriel Feige
Fair Shares: Feasibility, Domination and Incentives. EC (2022)
Uriel Feige, Ella Fuchs
On the path partition number of 6-regular graphs. J. Graph Theory 101 (3) (2022)
Alon Eden, Uriel Feige, Michal Feldman
Max-Min Greedy Matching. Theory Comput. 18 (2022)
Uriel Feige, Alexey Norkin
Improved maximin fair allocation of indivisible items to three agents. CoRR (2022)
Uriel Feige, Xin Huang
On picking sequences for chores. CoRR (2022)
Uriel Feige, Yehonatan Tahan
On allocations that give intersecting groups their fair share. CoRR (2022)
Moshe Babaioff, Uriel Feige
Fair Shares: Feasibility, Domination and Incentives. CoRR (2022)
Moshe Babaioff, Tomer Ezra, Uriel Feige
On Best-of-Both-Worlds Fair-Share Allocations. WINE (2022)
Lucas Boczkowski, Uriel Feige, Amos Korman, Yoav Rodeh
Navigating in Trees with Permanently Noisy Advice. ACM Trans. Algorithms 17 (2) (2021)
Shahar Dobzinski, Uriel Feige, Michal Feldman
Are Gross Substitutes a Substitute for Submodular Valuations? EC (2021)
Uriel Feige, Shimon Kogan
Target set selection for conservative populations. Discret. Appl. Math. 305 (2021)
Moshe Babaioff, Tomer Ezra, Uriel Feige
Fair-Share Allocations for Agents with Arbitrary Entitlements. EC (2021)
Uriel Feige, Ariel Sapir, Laliv Tauber
A Tight Negative Example for MMS Fair Allocations. WINE (2021)
Shahar Dobzinski, Uriel Feige, Michal Feldman
Are Gross Substitutes a Substitute for Submodular Valuations? CoRR (2021)
Moshe Babaioff, Tomer Ezra, Uriel Feige
Best-of-Both-Worlds Fair-Share Allocations. CoRR (2021)
Moshe Babaioff, Tomer Ezra, Uriel Feige
Fair-Share Allocations for Agents with Arbitrary Entitlements. CoRR (2021)
Uriel Feige, Tom Ferster
A tight bound for the clique query problem in two rounds. CoRR (2021)
Uriel Feige, Ariel Sapir, Laliv Tauber
A tight negative example for MMS fair allocations. CoRR (2021)
Moshe Babaioff, Tomer Ezra, Uriel Feige
Fair and Truthful Mechanisms for Dichotomous Valuations. AAAI (2021)
Uriel Feige, Vadim Grinberg
How to Hide a Clique? ICALP (2020)
Uriel Feige, Michal Feldman, Inbal Talgam-Cohen
Approximate Modularity Revisited. SIAM J. Comput. 49 (1) (2020)
Uriel Feige, Anne Kenyon, Shimon Kogan
On the Profile of Multiplicities of Complete Subgraphs. SIAM J. Discret. Math. 34 (1) (2020)
Charles Bordenave, Uriel Feige, Elchanan Mossel
Shotgun assembly of random jigsaw puzzles. Random Struct. Algorithms 56 (4) (2020)
Uriel Feige, Vadim Grinberg
How to hide a clique? CoRR (2020)
Moshe Babaioff, Tomer Ezra, Uriel Feige
Fair and Truthful Mechanisms for Dichotomous Valuations. CoRR (2020)
Uriel Feige, David Gamarnik, Joe Neeman, Miklós Z. Rácz, Prasad Tetali
Finding cliques using few probes. Random Struct. Algorithms 56 (1) (2020)
Uriel Feige, Amir Lellouche
Quantitative Group Testing and the rank of random matrices. CoRR (2020)
Uriel Feige, Ella Fuchs
On the path partition number of 6-regular graphs. CoRR (2019)
Alon Eden, Uriel Feige, Michal Feldman
Max-min greedy matching. NetEcon@SIGMETRICS (2019)
Uriel Feige, Janardhan Kulkarni, Shi Li
A Polynomial Time Constant Approximation For Minimizing Total Weighted Flow-time. SODA (2019)
Moshe Babaioff, Uriel Feige
A New Approach to Fair Distribution of Welfare. CoRR (2019)
Uriel Feige, Shimon Kogan
Target Set Selection for Conservative Populations. CoRR (2019)
Moshe Babaioff, Uriel Feige
A New Approach to Fair Distribution of Welfare. WINE (2019)
Uriel Feige
A randomized strategy in the mirror game. CoRR (2019)
Alon Eden, Uriel Feige, Michal Feldman
Max-Min Greedy Matching. APPROX-RANDOM (2019)
Uriel Feige, David Gamarnik, Joe Neeman, Miklós Z. Rácz, Prasad Tetali
Finding cliques using few probes. CoRR (2018)
Uriel Feige, Janardhan Kulkarni, Shi Li
A Polynomial Time Constant Approximation For Minimizing Total Weighted Flow-time. CoRR (2018)
Uriel Feige, Yishay Mansour, Robert E. Schapire
Robust Inference for Multiclass Classification. ALT (2018)
Uriel Feige, Boaz Patt-Shamir, Shai Vardi
On the Probe Complexity of Local Computation Algorithms. ICALP (2018)
Uriel Feige, Yael Hitron
The Ordered Covering Problem. Algorithmica 80 (10) (2018)
Alon Eden, Uriel Feige, Michal Feldman
Max-Min Greedy Matching. CoRR (2018)
Uriel Feige
Tighter bounds for online bipartite matching. CoRR (2018)
Roee David, Uriel Feige
Cover Time. SIAM J. Comput. 47 (3) (2018)
Uriel Feige, Michal Feldman, Inbal Talgam-Cohen
Approximate modularity revisited. STOC (2017)
Uriel Feige, Moshe Tennenholtz
Optimization with Uniform Size Queries. Algorithmica 78 (1) (2017)
Marek Chrobak, Uriel Feige, Mohammad Taghi Hajiaghayi, Sanjeev Khanna, Fei Li, Seffi Naor
A greedy approximation algorithm for minimum-gap scheduling. J. Sched. 20 (3) (2017)
Uriel Feige, Tomer Koren, Moshe Tennenholtz
Chasing Ghosts: Competing with Stateful Policies. SIAM J. Comput. 46 (1) (2017)
Roee David, Uriel Feige
) Cover Time. SODA (2017)
Uriel Feige, Boaz Patt-Shamir, Shai Vardi
On the Probe Complexity of Local Computation Algorithms. CoRR (2017)
Roee David, Uriel Feige
On the effect of randomness on planted 3-coloring models. CoRR (2016)
Roee David, Uriel Feige
On the effect of randomness on planted 3-coloring models. STOC (2016)
Uriel Feige, Michal Feldman, Inbal Talgam-Cohen
Oblivious Rounding and the Integrality Gap. APPROX-RANDOM (2016)
Roee David, Uriel Feige
Random walks with the minimum degree local rule have $O(n^2)$ cover time. CoRR (2016)
Uriel Feige, Jonathan Hermon, Daniel Reichman
On giant components and treewidth in the layers model. Random Struct. Algorithms 48 (3) (2016)
Uriel Feige, Michal Feldman, Inbal Talgam-Cohen
Approximate Modularity Revisited. CoRR (2016)
Charles Bordenave, Uriel Feige, Elchanan Mossel
Shotgun Assembly of Random Jigsaw Puzzles. CoRR (2016)
Uriel Feige, Daniel Reichman
Recoverable values for independent sets. Random Struct. Algorithms 46 (1) (2015)
Amin Coja-Oghlan, Uriel Feige, Michael Krivelevich, Daniel Reichman
Contagious Sets in Expanders. SODA (2015)
Uriel Feige, Shlomo Jozeph
Oblivious Algorithms for the Maximum Directed Cut Problem. Algorithmica 71 (2) (2015)
Uriel Feige, Michal Feldman, Nicole Immorlica, Rani Izsak, Brendan Lucier, Vasilis Syrgkanis
A Unifying Hierarchy of Valuations with Complements and Substitutes. AAAI (2015)
Uriel Feige, Yishay Mansour, Robert E. Schapire
Learning and inference in the presence of corrupted inputs. COLT (2015)
Uriel Feige
Why are Images Smooth? ITCS (2015)
Uriel Feige, Shlomo Jozeph
Separation between Estimation and Approximation. ITCS (2015)
Yossi Azar, Uriel Feige, Michal Feldman, Moshe Tennenholtz
Sequential decision making with vector outcomes. ITCS (2014)
Uriel Feige, R. Ravi, Mohit Singh
Short Tours through Large Linear Forests. IPCO (2014)
Uriel Feige, Michal Feldman, Nicole Immorlica, Rani Izsak, Brendan Lucier, Vasilis Syrgkanis
A Unifying Hierarchy of Valuations with Complements and Substitutes. CoRR (2014)
Uriel Feige, Moshe Tennenholtz
Invitation games and the price of stability. ITCS (2014)
Uriel Feige, Shlomo Jozeph
Separation between Estimation and Approximation. Electron. Colloquium Comput. Complex. 21 (2014)
Yehuda Afek, Yakov Babichenko, Uriel Feige, Eli Gafni, Nati Linial, Benny Sudakov
Musical Chairs. SIAM J. Discret. Math. 28 (3) (2014)
Uriel Feige
NP-hardness of hypercube 2-segmentation. CoRR (2014)
Uriel Feige, Tomer Koren, Moshe Tennenholtz
Chasing Ghosts: Competing with Stateful Policies. CoRR (2014)
Uriel Feige
On robustly asymmetric graphs. CoRR (2014)
Uriel Feige, Shlomo Jozeph
Demand Queries with Preprocessing. ICALP (1) (2014)
Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz
Min-Max Graph Partitioning and Small Set Expansion. SIAM J. Comput. 43 (2) (2014)
Uriel Feige
Why are images smooth? CoRR (2014)
Uriel Feige, Moshe Tennenholtz
On fair division of a homogeneous good. Games Econ. Behav. 87 (2014)
Uriel Feige, Michal Feldman, Nicole Immorlica, Rani Izsak, Brendan Lucier, Vasilis Syrgkanis
A Unifying Hierarchy of Valuations with Complements and Substitutes. Electron. Colloquium Comput. Complex. 21 (2014)
Uriel Feige, Jonathan Hermon, Daniel Reichman
On giant components and treewidth in the layers model. CoRR (2014)
Uriel Feige, Tomer Koren, Moshe Tennenholtz
Chasing Ghosts: Competing with Stateful Policies. FOCS (2014)
Roee David, Uriel Feige
Connectivity of Random High Dimensional Geometric Graphs. APPROX-RANDOM (2013)
Uriel Feige, Elchanan Mossel, Dan Vilenchik
Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems. Theory Comput. 9 (2013)
Marek Chrobak, Uriel Feige, Mohammad Taghi Hajiaghayi, Sanjeev Khanna, Fei Li, Seffi Naor
A Greedy Approximation Algorithm for Minimum-Gap Scheduling. CIAC (2013)
Uriel Feige, Gil Kalai, Moshe Tennenholtz
The Cascade Auction - A Mechanism for Deterring Collusion in Auctions. AAAI (2013)
Uriel Feige, Ron Lavi, Moshe Tennenholtz
Competition among asymmetric sellers with fixed supply. EC (2013)
Uriel Feige, Nicole Immorlica, Vahab S. Mirrokni, Hamid Nazerzadeh
PASS Approximation: A Framework for Analyzing and Designing Heuristics. Algorithmica 66 (2) (2013)
Uriel Feige, Rani Izsak
Welfare Maximization and the Supermodular Degree. Electron. Colloquium Comput. Complex. 20 (2013)
Uriel Feige, Rani Izsak
Welfare maximization and the supermodular degree. ITCS (2013)
Amin Coja-Oghlan, Uriel Feige, Michael Krivelevich, Daniel Reichman
Contagious Sets in Expanders. CoRR (2013)
Uriel Feige, Shlomo Jozeph
Universal Factor Graphs CoRR (2012)
Yehuda Afek, Yakov Babichenko, Uriel Feige, Eli Gafni, Nati Linial, Benny Sudakov
Musical chairs CoRR (2012)
Yossi Azar, Uriel Feige, Moshe Tennenholtz, Michal Feldman
Mastering multi-player games. AAMAS (2012)
Arash Asadpour, Uriel Feige, Amin Saberi
Santa claus meets hypergraph matchings. ACM Trans. Algorithms 8 (3) (2012)
Uriel Feige, Shlomo Jozeph
Universal Factor Graphs. ICALP (1) (2012)
Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz
Min-Max Graph Partitioning and Small Set Expansion CoRR (2011)

Uriel Feige.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Uriel Feige