28 search results - page 2 / 6 » Optimal False-Name-Proof Voting Rules with Costly Voting |
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...
SIGECOM
2010
ACM
14 years 9 days ago
2010
ACM
In 1876 Charles Lutwidge Dodgson suggested the intriguing voting rule that today bears his name. Although Dodgson’s rule is one of the most well-studied voting rules, it suffers...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
Credit assignment is a fundamental issue for the Learning Classifier Systems literature. We engage in a detailed investigation of credit assignment in one recent system called UC...
AAAI
2010
13 years 9 months ago
2010
We consider approval voting elections in which each voter votes for a (possibly empty) set of candidates and the outcome consists of a set of k candidates for some parameter k, e....
GECCO
2004
Springer
14 years 26 days ago
2004
Springer
Multiple Species Weighted Voting (MSWV) is a genetics-based machine learning (GBML) system with relatively few parameters that combines N two-class classifiers into an N -class cla...