11 search results - page 2 / 3 » Compilation Complexity of Common Voting Rules |
SAGT
2010
Springer
13 years 3 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...
SIGECOM
2011
ACM
12 years 7 months ago
2011
ACM
In many settings, a group of agents must come to a joint decision on multiple issues. In practice, this is often done by voting on the issues in sequence. In this paper, we model ...
CSCLP
2008
Springer
13 years 6 months ago
2008
Springer
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...
ALDT
2011
Springer
12 years 4 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 7 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 ...