Sciweavers

Share
11 search results - page 1 / 3
» Exact algorithms for weighted and unweighted Borda manipulat...
Sort
View
CORR
2010
Springer
112views Education» more  CORR 2010»
8 years 5 months ago
An Empirical Study of Borda Manipulation
We study the problem of coalitional manipulation in elections using the unweighted Borda rule. We provide empirical evidence of the manipulability of Borda elections in the form o...
Jessica Davies, George Katsirelos, Nina Narodytska...
AAAI
2008
8 years 7 months ago
Approximability of Manipulating Elections
In this paper, we set up a framework to study approximation of manipulation, control, and bribery in elections. We show existence of approximation algorithms (even fully polynomia...
Eric Brelsford, Piotr Faliszewski, Edith Hemaspaan...
SAGT
2010
Springer
191views Game Theory» more  SAGT 2010»
8 years 3 months ago
Complexity of Safe Strategic Voting
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...
Noam Hazon, Edith Elkind
WADS
2005
Springer
114views Algorithms» more  WADS 2005»
8 years 11 months ago
Linear Time Algorithms for Generalized Edge Dominating Set Problems
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...
André Berger, Ojas Parekh
books