9 citations · 15 across the 5 of their papers we have counts for
Showing 2009Show all
2 papers · 1 filter
cs.GT2009★ 9 cited
On the Complexity of Envy-Free Cake Cutting
Xiaotie Deng, Qi Qi, Amin Saberi
We study the envy-free cake-cutting problem for players with cuts, for both the oracle function model and the polynomial time function model. For the former, we derive a…
cs.DS2009
Correlation Robust Stochastic Optimization
Shipra Agrawal, Yichuan Ding, Amin Saberi +1
We consider a robust model proposed by Scarf, 1958, for stochastic optimization when only the marginal probabilities of (binary) random variables are given, and the correlation bet…