Login / Signup
False-Name Manipulation in Weighted Voting Games Is Hard for Probabilistic Polynomial Time.
Anja Rey
Jörg Rothe
Published in:
LATIN (2014)
Keyphrases
</>
weighted voting games
special case
bayesian networks
probabilistic model
computational complexity
approximation algorithms
worst case
coalition formation
coalitional games
np hard
upper bound
generative model