Login / Signup
Fair Division
2007
2007
2007
Keyphrases
Publications
2007
Leah Epstein
,
Rob van Stee
Maximizing the Minimum Load for Selfisch Agents.
Fair Division
(2007)
Walter Stromquist
Envy-free cake divisions cannot be found by finite protocols.
Fair Division
(2007)
Hervé Moulin
Efficient cost sharing with a cheap residual claimant.
Fair Division
(2007)
Asaf Levin
Approximating min-max k-clustering.
Fair Division
(2007)
Leah Epstein
Equilibria for two parallel links: The strong price of anarchy versus the price of anarchy.
Fair Division
(2007)
Walter Stromquist
A Pie That Can't Be Cut Fairly (revised for DSP).
Fair Division
(2007)
Michael A. Jones
Some Recent Results on Pie Cutting.
Fair Division
(2007)
Steven J. Brams
,
Kirk Pruhs
07261 Summary -- Fair Division.
Fair Division
(2007)
Steven J. Brams
,
Michael A. Jones
,
Christian Klamler
Better Ways to Cut a Cake - Revisited.
Fair Division
(2007)
Amos Fiat
,
Meital Levy
,
Haim Kaplan
,
Svetlana Olonetsky
Strong Price of Anarchy for Machine Load Balancing.
Fair Division
(2007)
Steven J. Brams
,
Michael A. Jones
,
Christian Klamler
Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Procedure.
Fair Division
(2007)
Steven J. Brams
,
Kirk Pruhs
07261 Abstracts Collection -- Fair Division.
Fair Division
(2007)
volume 7261, 2007
Fair Division, 24.06. - 29.06.2007
Fair Division
7261 (2007)