@InProceedings{brams_et_al:DagSemProc.07261.1, author = {Brams, Steven J. and Pruhs, Kirk}, title = {{07261 Abstracts Collection – Fair Division}}, booktitle = {Fair Division}, pages = {1--16}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7261}, editor = {Steven Brams and Kirk Pruhs and Gerhard Woeginger}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07261.1}, URN = {urn:nbn:de:0030-drops-12444}, doi = {10.4230/DagSemProc.07261.1}, annote = {Keywords: Economics, Fairness, Allocation, Political Science} } @InProceedings{brams_et_al:DagSemProc.07261.2, author = {Brams, Steven J. and Pruhs, Kirk}, title = {{07261 Summary – Fair Division}}, booktitle = {Fair Division}, pages = {1--3}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7261}, editor = {Steven Brams and Kirk Pruhs and Gerhard Woeginger}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07261.2}, URN = {urn:nbn:de:0030-drops-12434}, doi = {10.4230/DagSemProc.07261.2}, annote = {Keywords: Economics, Fairness, Allocation, Political Science} } @InProceedings{stromquist:DagSemProc.07261.3, author = {Stromquist, Walter}, title = {{A Pie That Can't Be Cut Fairly (revised for DSP)}}, booktitle = {Fair Division}, pages = {1--10}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7261}, editor = {Steven Brams and Kirk Pruhs and Gerhard Woeginger}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07261.3}, URN = {urn:nbn:de:0030-drops-12192}, doi = {10.4230/DagSemProc.07261.3}, annote = {Keywords: Cake cutting, pie cutting, envy free} } @InProceedings{levin:DagSemProc.07261.4, author = {Levin, Asaf}, title = {{Approximating min-max k-clustering}}, booktitle = {Fair Division}, pages = {1--5}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7261}, editor = {Steven Brams and Kirk Pruhs and Gerhard Woeginger}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07261.4}, URN = {urn:nbn:de:0030-drops-12282}, doi = {10.4230/DagSemProc.07261.4}, annote = {Keywords: Approximation algorithms} } @InProceedings{brams_et_al:DagSemProc.07261.5, author = {Brams, Steven J. and Jones, Michael A. and Klamler, Christian}, title = {{Better Ways to Cut a Cake - Revisited}}, booktitle = {Fair Division}, pages = {1--24}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7261}, editor = {Steven Brams and Kirk Pruhs and Gerhard Woeginger}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07261.5}, URN = {urn:nbn:de:0030-drops-12278}, doi = {10.4230/DagSemProc.07261.5}, annote = {Keywords: Fair division, cake-cutting, envy-freeness, strategy-proofness} } @InProceedings{brams_et_al:DagSemProc.07261.6, author = {Brams, Steven J. and Jones, Michael A. and Klamler, Christian}, title = {{Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Procedure}}, booktitle = {Fair Division}, pages = {1--31}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7261}, editor = {Steven Brams and Kirk Pruhs and Gerhard Woeginger}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07261.6}, URN = {urn:nbn:de:0030-drops-12211}, doi = {10.4230/DagSemProc.07261.6}, annote = {Keywords: Cake-cutting, proportionality, envy-freeness, efficiency, strategy-proofness} } @InProceedings{moulin:DagSemProc.07261.7, author = {Moulin, Herv\'{e}}, title = {{Efficient cost sharing with a cheap residual claimant}}, booktitle = {Fair Division}, pages = {1--7}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7261}, editor = {Steven Brams and Kirk Pruhs and Gerhard Woeginger}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07261.7}, URN = {urn:nbn:de:0030-drops-12312}, doi = {10.4230/DagSemProc.07261.7}, annote = {Keywords: Assignment, cost sharing, Vickrey-Clarke-Groves mechanisms, competitive analysis} } @InProceedings{stromquist:DagSemProc.07261.8, author = {Stromquist, Walter}, title = {{Envy-free cake divisions cannot be found by finite protocols}}, booktitle = {Fair Division}, pages = {1--9}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7261}, editor = {Steven Brams and Kirk Pruhs and Gerhard Woeginger}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07261.8}, URN = {urn:nbn:de:0030-drops-12208}, doi = {10.4230/DagSemProc.07261.8}, annote = {Keywords: Cake cutting, envy free, finite protocol} } @InProceedings{epstein:DagSemProc.07261.9, author = {Epstein, Leah}, title = {{Equilibria for two parallel links: The strong price of anarchy versus the price of anarchy}}, booktitle = {Fair Division}, pages = {1--8}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7261}, editor = {Steven Brams and Kirk Pruhs and Gerhard Woeginger}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07261.9}, URN = {urn:nbn:de:0030-drops-12228}, doi = {10.4230/DagSemProc.07261.9}, annote = {Keywords: Nash equilibrium, strong equilibrium, uniformly related machyines} } @InProceedings{epstein_et_al:DagSemProc.07261.10, author = {Epstein, Leah and van Stee, Rob}, title = {{Maximizing the Minimum Load for Selfisch Agents}}, booktitle = {Fair Division}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7261}, editor = {Steven Brams and Kirk Pruhs and Gerhard Woeginger}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07261.10}, URN = {urn:nbn:de:0030-drops-12427}, doi = {10.4230/DagSemProc.07261.10}, annote = {Keywords: Scheduling, algorithmic mechanism design, maximizing minimum load} } @InProceedings{jones:DagSemProc.07261.11, author = {Jones, Michael A.}, title = {{Some Recent Results on Pie Cutting}}, booktitle = {Fair Division}, pages = {1--10}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7261}, editor = {Steven Brams and Kirk Pruhs and Gerhard Woeginger}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07261.11}, URN = {urn:nbn:de:0030-drops-12246}, doi = {10.4230/DagSemProc.07261.11}, annote = {Keywords: Pie cutting, envy-free, proportional, undominated} } @InProceedings{fiat_et_al:DagSemProc.07261.12, author = {Fiat, Amos and Levy, Meital and Kaplan, Haim and Olonetsky, Svetlana}, title = {{Strong Price of Anarchy for Machine Load Balancing}}, booktitle = {Fair Division}, pages = {1--19}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7261}, editor = {Steven Brams and Kirk Pruhs and Gerhard Woeginger}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07261.12}, URN = {urn:nbn:de:0030-drops-12256}, doi = {10.4230/DagSemProc.07261.12}, annote = {Keywords: Game theory, Strong Nash equilibria, Load balancing, Price of Anarchy} }