Equilibria of graphical games with symmetries
From MaRDI portal
Publication:627165
DOI10.1016/j.tcs.2010.11.002zbMath1237.91055OpenAlexW2175614758MaRDI QIDQ627165
Felix Brandt, Felix Fischer, Markus Holzer
Publication date: 21 February 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.11.002
Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) Games involving graphs (91A43)
Related Items (3)
Symmetry in \(n\)-player games ⋮ Symmetric games revisited ⋮ Symmetries and the complexity of pure Nash equilibrium
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria
- Symmetries and the complexity of pure Nash equilibrium
- Even cycles in directed graphs
- Permanents, Pfaffian orientations, and even directed circuits
- Non-cooperative games
- Reducibility among equilibrium problems
- The complexity of computing a Nash equilibrium
- The Computational Complexity of Nash Equilibria in Concisely Represented Games
- ON THE TWO-COLOURING OF HYPERGRAPHS
- The complexity of satisfiability problems
- Algorithms – ESA 2005
- On Context-Free Languages
This page was built for publication: Equilibria of graphical games with symmetries
