DMCA
Preference Handling in Combinatorial Domains: From AI to Social Choice
Cached
Download Links
| Citations: | 24 - 12 self |
BibTeX
@MISC{Chevaleyre_preferencehandling,
author = {Yann Chevaleyre and Ulle Endriss and Jérôme Lang and Nicolas Maudet},
title = {Preference Handling in Combinatorial Domains: From AI to Social Choice},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
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.
Keyphrases
combinatorial domain social choice collective decision making preference handling computational social choice several year multiagent resource allocation fair division compact representation considerable body computational point ai researcher research topic social choice theory preference representation
