Efficiency and envy-freeness in fair division of indivisible goods: Logical representation and complexity


Conference Paper

We study fair division of indivisible goods among agents from the point of view of compact representation and computational complexity. We identify the complexity of several problems, including that of deciding whether there exists an efficient and envy-free allocation when preferences are represented in a succinct way. We also draw connections to nonmonotonic reasoning.

Duke Authors

Cited Authors

  • Bouveret, S; Lang, J

Published Date

  • December 1, 2005

Published In

Start / End Page

  • 935 - 940

International Standard Serial Number (ISSN)

  • 1045-0823

Citation Source

  • Scopus