Sciweavers

17 search results - page 3 / 4
» Computing voting power in easy weighted voting games
Sort
View
ATAL
2008
Springer
13 years 7 months ago
Approximating power indices
Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are une...
Yoram Bachrach, Evangelos Markakis, Ariel D. Proca...
SAGT
2010
Springer
191views Game Theory» more  SAGT 2010»
13 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
CORR
2002
Springer
125views Education» more  CORR 2002»
13 years 5 months ago
Complexity of Manipulating Elections with Few Candidates
In multiagent settings where the agents have different preferences, preference aggregation is a central issue. Voting is a general method for preference aggregation, but seminal r...
Vincent Conitzer, Tuomas Sandholm
IWCMC
2006
ACM
13 years 11 months ago
A probabilistic voting-based filtering scheme in wireless sensor networks
In this paper, we study the fabricated report with false votes attack and the false votes on real reports attack in wireless sensor networks. Since most of the existing works addr...
Feng Li, Jie Wu
SDM
2012
SIAM
278views Data Mining» more  SDM 2012»
11 years 7 months ago
Legislative Prediction via Random Walks over a Heterogeneous Graph
In this article, we propose a random walk-based model to predict legislators’ votes on a set of bills. In particular, we first convert roll call data, i.e. the recorded votes a...
Jun Wang, Kush R. Varshney, Aleksandra Mojsilovic