Dagstuhl Seminar Proceedings, Volume 7261,

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