On the complexity of problems on simple games (original) (raw)
Related papers
On the dimensionality of voting games
P. Goldberg, Michael Wooldridge
2008
NP-completeness of some problems concerning voting games
International Journal of Game Theory, 1990
The Complexity of Testing Properties of Simple Games
ArXiv e-prints, 2008
Complexity of some aspects of control and manipulation in weighted voting games}
2009
Mathematical Social Sciences, 2000
Mathematical structures of simple voting games
On the Complexity of the Decisive Problem in Simple, Regular and Weighted Games
2013
Forms of representation for simple games: Sizes, conversions and equivalences
Mathematical Social Sciences, 2015
Solving Weighted Voting Game Design Problems Optimally: Representations, Synthesis, and Enumeration
2012
Simple games and weighted games: A theoretical and computational viewpoint
Discrete Applied Mathematics, 2009
The computational difficulty of manipulating an election
Social Choice and Welfare, 1989
Weighted and roughly weighted simple games
Mathematical Social Sciences, 2011
The computational complexity of nash equilibria in concisely represented games
Proceedings of the 7th ACM conference on Electronic commerce - EC '06, 2006
Computational complexity of weighted threshold games
P. Goldberg, Michael Wooldridge
2007
On the complexity of compact coalitional games
2009
A Mathematical Analysis of Conflicts in Voting Systems
2012
On the Construction of High Dimensional Simple Games
2016
Dimension of complete simple games with minimum
European Journal of Operational Research, 2008
Dimension and codimension of simple games
arXiv (Cornell University), 2016
Representation and Complexity in Boolean Games
Lecture Notes in Computer Science, 2004
On the complexity of manipulating elections
… of the thirteenth Australasian symposium on …, 2007
Complexity of manipulation with partial information in voting
Theoretical Computer Science
A relation-algebraic approach to simple games
European Journal of Operational Research, 2011
A note on the core of voting games
Journal of Mathematical Economics, 2000
The Complexity of Multiwinner Voting Rules with Variable Number of Winners
arXiv (Cornell University), 2017
On the computational complexity of qualitative coalitional games
Artificial Intelligence, 2004
Minimal winning coalitions in weighted-majority voting games
Social Choice and Welfare, 1996
False-Name Manipulation in Weighted Voting Games Is Hard for Probabilistic Polynomial Time
Lecture Notes in Computer Science, 2014
False-Name Manipulations in Weighted Voting Games
Journal of Artificial Intelligence Research, 2011
Complexity of Unweighted Coalitional Manipulation under Some Common Voting Rules
International Joint Conference on Artificial Intelligence, 2009
Kernelization complexity of possible winner and coalitional manipulation problems in voting
Theoretical Computer Science, 2016
The Complexity of the Possible Winner Problem over Partitioned Preferences
2019
International Journal of Game Theory, 1997
On complexity of lobbying in multiple referenda
Review of Economic Design, 2007