Sciweavers

Share
IJCAI
2007

Vote and Aggregation in Combinatorial Domains with Structured Preferences

8 years 8 months ago
Vote and Aggregation in Combinatorial Domains with Structured Preferences
In many real-world collective decision problems, the set of alternatives is a Cartesian product of finite value domains for each of a given set of variables. The prohibitive size of such combinatorial domains makes it practically impossible to represent preference relations explicitly. Now, the AI community has been developing languages for representing preferences on such domains in a succinct way, exploiting structural properties such as conditional preferential independence. In this paper we reconsider voting and aggregation rules in the case where voters’ preferences have a common preferential independence structure, and address the issue of decomposing a voting rule or an aggregation function following a linear order over variables.
Jérôme Lang
Added 29 Oct 2010
Updated 29 Oct 2010
Type Conference
Year 2007
Where IJCAI
Authors Jérôme Lang
Comments (0)
books