{"type":"ScholarlyArticle","title":"Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity","authors":[{"name":"Sylvain Bouveret","slug":"sylvain-bouveret","given":"Sylvain","family":"Bouveret","affiliation":""},{"name":"Jérôme Lang","slug":"jerome-lang","given":"Jérôme","family":"Lang","affiliation":""}],"abstract":"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.","doi":null,"url":"https://ijcai.org/proceedings/2005/60","pdf":"https://ijcai.org/proceedings/2005/0060.pdf","markdown":"https://ijcai.org/proceedings/2005/60.md","bibtex":"https://ijcai.org/proceedings/2005/bibtex/60","volume":{"slug":"2005","title":"Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2005","url":"https://ijcai.org/proceedings/2005/","year":2005,"location":"Edinburgh, Scotland, UK","dates":"","editors":"","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":60,"pages":{"first":935,"last":939},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}