A Short Introduction to Preferences: Between AI and Social Choice

作者: Kristen Brent Venable , Toby Walsh , Francesca Rossi

DOI:

关键词: Social choice theoryComputer scienceVotingAggregation problemPreference elicitationManagement scienceGroup decision-makingStable marriage problemPreferencePreference learning

摘要: Computational social choice is an expanding field that merges classical topics like economics and voting theory with more modern artificial intelligence, multiagent systems, computational complexity. This book provides a concise introduction to the main research lines in this field, covering aspects such as preference modelling, uncertainty reasoning, choice, stable matching, of aggregation manipulation. The centered around notion both single-agent multi-agent setting. It presents approaches modeling reasoning preferences, particular attention two popular powerful formalisms, soft constraints CP-nets. authors consider elicitation various forms constraints. They review most relevant results voting, special choice. Finally, considers preferences matching problems. intended for students researchers who may be interested aggregation, want know basic notions Table Contents: Introduction / Preference Modeling Reasoning Uncertainty Aggregating Preferences Stable Marriage Problems

参考文章(184)
Salem Benferhat, Souhila Kaci, Henri Prade, Didier Dubois, Bipolar Representation and Fusion of Preferences on the Possibilistic Logic framework. principles of knowledge representation and reasoning. pp. 421- 448 ,(2002)
Steven J. Brams, Peter C. Fishburn, Chapter 4 Voting procedures Handbook of Social Choice and Welfare. ,vol. 1, pp. 173- 236 ,(2002) , 10.1016/S1574-0110(02)80008-X
Ronen I. Brafman, Yannis Dimopoulos, New look at the semantics and optimization methods of CP-networks international joint conference on artificial intelligence. pp. 1033- 1038 ,(2003)
P R Lowrie, The Sydney coordinated adaptive traffic system - principles, methodology, algorithms International Conference on Road Traffic Signalling, 1982, London, United Kingdom. ,(1982)
Peter van Beek, Toby Walsh, Francesca Rossi, Handbook of Constraint Programming ,(2006)
K. B. Venable, M. S. Pini, T. Walsh, F. Rossi, Incompleteness and incomparability in preference aggregation international joint conference on artificial intelligence. pp. 1464- 1469 ,(2007)
Christian Bessiere, Constraint Propagation Handbook of Constraint Programming. ,vol. 2, pp. 29- 83 ,(2006) , 10.1016/S1574-6526(06)80007-6
Vipin Kumar, Branch-And-Bound Search Branch-And-Bound Search. ,(1985)
Lane A. Hemaspaandra, Edith Hemaspaandra, Piotr Faliszewski, Jörg Rothe, Llull and copeland voting broadly resist bribery and control national conference on artificial intelligence. pp. 724- 730 ,(2007)