PP-2009-35: Chevaleyre, Yann and Endriss, Ulle and Lang, Jérôme and Maudet, Nicolas (2009) Preference Handling in Combinatorial Domains: From AI to Social Choice. [Report]
Preview |
Text (Full Text)
PP-2009-35.text.pdf Download (108kB) | Preview |
![[thumbnail of Abstract]](https://eprints.illc.uva.nl/style/images/fileicons/text.png) |
Text (Abstract)
PP-2009-35.abstract.txt Download (1kB) |
Abstract
In both individual and collective decision making, the space of
alternatives from which the agent (or the group of agents) has to
choose often has a combinatorial (or multi-attribute) structure. We
give an introduction to preference handling in combinatorial domains
in the context of collective decision making, and show that the
considerable body of work on preference representation and elicitation
that AI researchers have been working on for several years is
particularly relevant. After giving an overview of languages for
compact representation of preferences, we discuss problems in voting
in combinatorial domains, and then focus on multiagent resource
allocation and fair division. These issues belong to a larger field,
known as computational social choice, that brings together ideas from
AI and social choice theory, to investigate mechanisms for collective
decision making from a computational point of view. We conclude by
briefly describing some of the other research topics studied in
computational social choice.
| Item Type: | Report |
|---|---|
| Report Nr: | PP-2009-35 |
| Series Name: | Prepublication (PP) Series |
| Year: | 2009 |
| Uncontrolled Keywords: | preferences; knowledge representation; computational social choice; artificial intelligence; multiagent systems |
| Subjects: | Computation |
| Depositing User: | Ulle Endriss |
| Date Deposited: | 12 Oct 2016 14:37 |
| Last Modified: | 12 Oct 2016 14:37 |
| URI: | https://eprints.illc.uva.nl/id/eprint/365 |
Actions (login required)
 |
View Item |
