Document Open Access Logo

Fair Division: Algorithms, Solution Concepts, and Applications (Dagstuhl Seminar 24401)

Authors Evangelos Markakis, Ruta Mehta, Yair Zick and all authors of the abstracts in this report

PDF

File

Thumbnail PDF
PDF
DagRep.14.9.145.pdf
  • Filesize: 2.44 MB
  • 22 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Algorithmic game theory and mechanism design
  • Theory of computation → Design and analysis of algorithms
Keywords
  • algorithm design
  • Algorithmic game theory
  • cake cutting
  • envy-freeness
  • fair division

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

This report documents the program and the outcomes of Dagstuhl Seminar 24401 "Fair Division: Algorithms, Solution Concepts, and Applications". The main goal of the seminar was to bring together leading scientists in the field of fair division so as to discuss current challenges and research directions. We summarize organizational aspects of the seminar, the talk abstracts, and the problems that were discussed in the open problem sessions.

Cite As Get BibTex

Evangelos Markakis, Ruta Mehta, and Yair Zick. Fair Division: Algorithms, Solution Concepts, and Applications (Dagstuhl Seminar 24401). In Dagstuhl Reports, Volume 14, Issue 9, pp. 145-166, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/DagRep.14.9.145

Author Details

Evangelos Markakis
  • Athens University of Economics and Business, GR
Ruta Mehta
  • University of Illinois - Urbana-Champaign, US
Yair Zick
  • University of Massachusetts Amherst, US
and all authors of the abstracts in this report
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact