116 search results - page 10 / 24 » Anonymity-Proof Voting Rules |
AAAI
2010
13 years 9 months ago
2010
In computational social choice, one important problem is to take the votes of a subelectorate (subset of the voters), and summarize them using a small number of bits. This needs t...
AAAI
2006
13 years 9 months ago
2006
AAAI
2010
13 years 9 months ago
2010
In cooperative multiagent systems an alternative that maximizes the social welfare--the sum of utilities--can only be selected if each agent reports its full utility function. Thi...
AAAI
2004
13 years 9 months ago
2004
We consider from a computational perspective the problem of how to aggregate the ranking preferences of a number of alternatives by a number of different voters into a single cons...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...