Uriel Feige

Weizmann Institute of Science — Israel

Computer Science · Physical Sciences

62h-index18.2kcitations313works0.12yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Complexity and Algorithms in Graphs(169), Advanced Graph Theory Research(101), Optimization and Search Problems(71), Auction Theory and Applications(44), Game Theory and Voting Systems(43)

Publications313 total

Low communication protocols for fair allocation of indivisible goods
2025· 1 cited
Fair allocations with subadditive and XOS valuations
2025Open Access
From multi-allocations to allocations, with subadditive valuations
arXiv (Cornell University)·2025Open Access
Share-Based Fairness for Arbitrary Entitlements
2025
Upper bounds on the theta function of random graphs
arXiv (Cornell University)·2025Open Access
The residual maximin share
arXiv (Cornell University)·2025Open Access
Fair allocations with subadditive and XOS valuations
arXiv (Cornell University)·2025Open Access
The Surprising Power of Spectral Refutation
Communications of the ACM·2025
Concentration and maximin fair allocations for subadditive valuations
arXiv (Cornell University)·2025Open Access
The Query Complexity of Searching Trees with Permanently Noisy Advice
ACM Transactions on Algorithms·2024Open Access
Fair Shares: Feasibility, Domination, and Incentives
Mathematics of Operations Research·2024
Low communication protocols for fair allocation of indivisible goods
arXiv (Cornell University)·2024Open Access
Share-Based Fairness for Arbitrary Entitlements
arXiv (Cornell University)·2024Open Access
How to Hide a Clique?
Theory of Computing Systems·2024Open Access
The inversion paradox, and classification of fairness notions
arXiv (Cornell University)·2023Open Access
Fair-Share Allocations for Agents with Arbitrary Entitlements
Mathematics of Operations Research·2023· 11 cited
On picking sequences for chores
2023· 6 citedOpen Access
On Fair Allocation of Indivisible Goods to Submodular Agents
arXiv (Cornell University)·2023· 4 citedOpen Access
On picking sequences for chores
arXiv (Cornell University)·2022· 1 citedOpen Access
Fair Allocations for Smoothed Utilities
Proceedings of the 23rd ACM Conference on Economics and Computation·2022· 7 citedOpen Access
page 1 of 16Next →

Frequent Co-authors

Adi Shamir(6), László Lovász(5), David Peleg(3), Joe Kilian(3), Prabhakar Raghavan(3), Dror Lapidot(3), Robert Krauthgamer(3), Guy Kortsarz(2), Muli Safra(2), Márió Szegedy(2), Vahab Mirrokni(2), Eli Upfal(2), Aditya Bhaskara(2), Moses Charikar(2), Eden Chlamtáč(2), Aravindan Vijayaraghavan(2), MohammadTaghi Hajiaghayi(2), James R. Lee(2), Amos Fiat(1), Shafi Goldwasser(1)