Dagstuhl Seminar Proceedings: Fair Division 2007

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