28 search results - page 3 / 6 » Optimal False-Name-Proof Voting Rules with Costly Voting |
GECCO
2003
Springer
14 years 21 days ago
2003
Springer
One advantage of evolutionary multiobjective optimization (EMO) algorithms over classical approaches is that many non-dominated solutions can be simultaneously obtained by their si...
ICML
1999
IEEE
14 years 8 months ago
1999
IEEE
The applicationofboosting procedures to decision tree algorithmshas been shown to produce very accurate classi ers. These classiers are in the form of a majority vote over a numbe...
AAAI
2010
13 years 5 months ago
2010
We consider the problem of manipulating elections via cloning candidates. In our model, a manipulator can replace each candidate c by one or more clones, i.e., new candidates that...
DAGSTUHL
2007
13 years 9 months ago
2007
Automated political districting shares with electronic voting the aim of preventing electoral manipulation and pursuing an impartial electoral mechanism. Political districting can...
ICPR
2010
IEEE
13 years 5 months ago
2010
IEEE
In this paper we redefine and generalize the classic k-nearest neighbors (k-NN) voting rule in a Bayesian maximum-a-posteriori (MAP) framework. Therefore, annotated examples are u...