@article{chevaleyre09a,
  author =	 {Yann Chevaleyre and Ulle Endriss and J\'{e}rome Lang and
                  Nicolas Maudet},
  title =	 {Preference Handling in Combinatorial Domains: From
                  {AI} to Social Choice},
  journal =	 {{AI} Magazine},
  volume =	 29,
  number =	 4,
  year =	 2009,
  keywords =	 {social-choice},
  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.},
  issn =	 {0738-4602},
  cluster = 	 {16348484445740862721},
  url =
                  {http://jmvidal.cse.sc.edu/library/chevaleyre09a.pdf}
}