default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDagstuhl Seminar Proceedings: Fair Division 2007
- Steven J. Brams, Kirk Pruhs, Gerhard J. Woeginger:
Fair Division, 24.06. - 29.06.2007. Dagstuhl Seminar Proceedings 07261, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 - Walter Stromquist:
A Pie That Can't Be Cut Fairly (revised for DSP). - Walter Stromquist:
Envy-free cake divisions cannot be found by finite protocols. - Steven J. Brams, Michael A. Jones, Christian Klamler:
Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Procedure. - Leah Epstein:
Equilibria for two parallel links: The strong price of anarchy versus the price of anarchy. - Michael A. Jones:
Some Recent Results on Pie Cutting. - Amos Fiat, Meital Levy, Haim Kaplan, Svetlana Olonetsky:
Strong Price of Anarchy for Machine Load Balancing. - Steven J. Brams, Michael A. Jones, Christian Klamler:
Better Ways to Cut a Cake - Revisited. - Asaf Levin:
Approximating min-max k-clustering. - Hervé Moulin:
Efficient cost sharing with a cheap residual claimant. - Leah Epstein, Rob van Stee:
Maximizing the Minimum Load for Selfisch Agents. - Steven J. Brams, Kirk Pruhs:
07261 Summary -- Fair Division. - Steven J. Brams, Kirk Pruhs:
07261 Abstracts Collection -- Fair Division.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-05 20:41 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
