@InProceedings{chevaleyre07a,
  author =	 {Yann Chevaleyre and Ulle Endriss and Jerome Lang and
                  Nicolas Maudet},
  title =	 {A Short Introduction to Computational Social Choice},
  booktitle =	 {Proceedings of the 33rd Conference on Current Trends
                  in Theory and Practice of Computer Science},
  year =	 2007,
  publisher =	 {Springer-Verlag},
  abstract =	 {Computational social choice is an interdisciplinary
                  field of study at the interface of social choice
                  theory and computer science, promoting an exchange
                  of ideas in both directions. On the one hand, it is
                  concerned with the application of techniques
                  developed in computer science, such as complexity
                  analysis or algorithm design, to the study of social
                  choice mechanisms, such as voting procedures or fair
                  division algorithms. On the other hand,
                  computational social choice is concerned with
                  importing concepts from social choice theory into
                  computing. For instance, the study of preference
                  aggregation mechanisms is also very relevant to
                  multiagent systems. In this short paper we give a
                  general introduction to computational social choice,
                  by proposing a taxonomy of the issues addressed by
                  this discipline, together with some illustrative
                  examples and an (incomplete) bibliography.},
  url = 	 {http://jmvidal.cse.sc.edu/library/chevaleyre07a.pdf},
  cluster = 	 {12101166228179889561}
}