1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.GT2012
Computing Socially-Efficient Cake Divisions
Yonatan Aumann, Yair Dombb, Avinatan Hassidim
We consider a setting in which a single divisible good ("cake") needs to be divided between n players, each with a possibly different valuation function over pieces of the cake. Fo…
cs.GT2011★ 1 cited
Throw One's Cake --- and Have It Too
Orit Arzi, Yonatan Aumann, Yair Dombb
We consider the problem of fairly dividing a heterogeneous cake between a number of players with different tastes. In this setting, it is known that fairness requirements may resul…