24 search results - page 2 / 5 » Communication complexity of common voting rules |
SAGT
2010
Springer
13 years 4 months ago
2010
Springer
We investigate the computational aspects of safe manipulation, a new model of coalitional manipulation that was recently put forward by Slinko and White [11]. In this model, a pot...
ATAL
2007
Springer
14 years 5 days ago
2007
Springer
In an election held in a noisy environment, agents may unintentionally perturb the outcome by communicating faulty preferences. We investigate this setting by introducing a theore...
AAAI
2008
13 years 8 months ago
2008
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...
ALDT
2011
Springer
12 years 6 months ago
2011
Springer
A variety of preference aggregation schemes and voting rules have been developed in social choice to support group decision making. However, the requirement that participants provi...
AAAI
2012
11 years 8 months ago
2012
The complexity of the winner determination problem has been studied for almost all common voting rules. A notable exception, possibly caused by some confusion regarding its exact ...