Voting in Combinatorial Domains: What Logic and AI Have to Say

Authors:
Jérôme Lang
Affiliations:
IRIT - Université Paul Sabatier and CNRS, Toulouse Cedex, France 31062
Venue:
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Year:
2008

Citing 7
Cited 0

Logical Preference Representation and Combinatorial Vote

Annals of Mathematics and Artificial Intelligence
Sequential voting rules and multiple elections paradoxes

TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
A Short Introduction to Computational Social Choice

SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Strongly decomposable voting rules on multiattribute domains

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Voting on multiattribute domains with cyclic preferential dependencies

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
CP-nets: a tool for representing and reasoning with conditional ceteris paribus preference statements

Journal of Artificial Intelligence Research
Vote and aggregation in combinatorial domains with structured preferences

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This talk is half-way between a survey and a report on ongoing research, most of which is joint work with Vincent Conitzer and Lirong Xia. The first part of the talk owes a lot to two survey papers co-authored with Yann Chevaleyre, Ulle Endriss and Nicolas Maudet [5,6].