Login / Signup
False-Name Manipulation in Weighted Voting Games is Hard for Probabilistic Polynomial Time.
Anja Rey
Jörg Rothe
Published in:
J. Artif. Intell. Res. (2014)
Keyphrases
</>
generative model
special case
computational complexity
probabilistic model
multiagent systems
bayesian networks
coalition formation
markov random field
approximation algorithms
weighted voting games