The complexity of game isomorphism
From MaRDI portal
Publication:650900
DOI10.1016/j.tcs.2011.07.022zbMath1227.91016OpenAlexW2052601701MaRDI QIDQ650900
Joaquim Gabarró, Alina García, Maria J. Serna
Publication date: 7 December 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.07.022
computational complexitygraph isomorphismBoolean formulasgame isomorphismBoolean formula isomorphismcircuit isomorphismformula gamessuccinct representations
Related Items (7)
Some results of Maria Serna on strategic games: complexity of equilibria and models ⋮ Strong isomorphism in Eisert-Wilkens-Lewenstein type quantum games ⋮ Weighted Boolean Formula Games ⋮ Quantification and statistical analysis of topological features of recursive trees ⋮ Computational aspects of uncertainty profiles and angel-daemon games ⋮ Quantum games with strategies induced by basis change rules ⋮ Project games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Equilibria problems on games: complexity versus succinctness
- A note on isomorphism and strategic equivalence of cooperative games
- Monotone circuits for monotone weighted threshold functions
- On the computational complexity of some classical equivalence relations on boolean functions
- Weak isomorphism of extensive games.
- The canonical extensive form of a game form. II: Representation
- Limiting distributions of the number of pure strategy Nash equilibria in \(n\)-person games
- Asymptotic expected number of Nash equilibria of two-player normal form games
- The Computational Complexity of Nash Equilibria in Concisely Represented Games
- The complexity of computations by networks
- On Threshold Circuits and Polynomial Computation
- The Formula Isomorphism Problem
- Algorithms, games, and the internet
- Algorithmic Game Theory
This page was built for publication: The complexity of game isomorphism
