Published in: LIPIcs, Volume 297, 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)
Yuda Feng and Shi Li. A Note on Approximating Weighted Nash Social Welfare with Additive Valuations. In 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 297, pp. 63:1-63:9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{feng_et_al:LIPIcs.ICALP.2024.63, author = {Feng, Yuda and Li, Shi}, title = {{A Note on Approximating Weighted Nash Social Welfare with Additive Valuations}}, booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)}, pages = {63:1--63:9}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-322-5}, ISSN = {1868-8969}, year = {2024}, volume = {297}, editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.63}, URN = {urn:nbn:de:0030-drops-202068}, doi = {10.4230/LIPIcs.ICALP.2024.63}, annote = {Keywords: Nash Social Welfare, Configuration LP, Approximation Algorithms} }
Published in: Dagstuhl Seminar Proceedings, Volume 7261, Fair Division (2007)
Steven J. Brams and Kirk Pruhs. 07261 Abstracts Collection – Fair Division. In Fair Division. Dagstuhl Seminar Proceedings, Volume 7261, pp. 1-16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@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} }
Published in: Dagstuhl Seminar Proceedings, Volume 7261, Fair Division (2007)
Steven J. Brams and Kirk Pruhs. 07261 Summary – Fair Division. In Fair Division. Dagstuhl Seminar Proceedings, Volume 7261, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@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} }
Published in: Dagstuhl Seminar Proceedings, Volume 7261, Fair Division (2007)
Steven J. Brams, Michael A. Jones, and Christian Klamler. Better Ways to Cut a Cake - Revisited. In Fair Division. Dagstuhl Seminar Proceedings, Volume 7261, pp. 1-24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@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} }
Published in: Dagstuhl Seminar Proceedings, Volume 7261, Fair Division (2007)
Steven J. Brams, Michael A. Jones, and Christian Klamler. Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Procedure. In Fair Division. Dagstuhl Seminar Proceedings, Volume 7261, pp. 1-31, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@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} }