Sciweavers

13 search results - page 2 / 3
» Strategic voting when aggregating partially ordered preferen...
Sort
View
ATAL
2008
Springer
13 years 7 months ago
Complexity of terminating preference elicitation
Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating togethe...
Toby Walsh
ATAL
2005
Springer
13 years 10 months ago
Decentralized voting with unconditional privacy
The aggregation of conflicting preferences is a key issue in multiagent systems. Due to its universality, voting has a central role among preference aggregation mechanisms. Votin...
Felix Brandt, Tuomas Sandholm
JCSS
2010
112views more  JCSS 2010»
13 years 3 months ago
Towards a dichotomy for the Possible Winner problem in elections based on scoring rules
To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggregated acc...
Nadja Betzler, Britta Dorn
IDEAS
2006
IEEE
104views Database» more  IDEAS 2006»
13 years 11 months ago
Exploiting Indifference for Customization of Partial Order Skylines
Unlike numerical preferences, preferences on attribute values do not show an inherent total order, but skyline computation has to rely on partial orderings explicitly stated by th...
Wolf-Tilo Balke, Ulrich Güntzer, Wolf Sibersk...
AAAI
2008
13 years 7 months ago
Voting on Multiattribute Domains with Cyclic Preferential Dependencies
In group decision making, often the agents need to decide on multiple attributes at the same time, so that there are exponentially many alternatives. In this case, it is unrealist...
Lirong Xia, Vincent Conitzer, Jérôme ...