Equilibria problems on games: complexity versus succinctness (Q657923): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Maria J. Serna / rank
Normal rank
 
Property / author
 
Property / author: Maria J. Serna / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2011.01.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2094143906 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4321931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetries and the complexity of pure Nash equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing a Nash equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of pure Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Game Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Equilibria Problems in Angel-Daemon Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5817864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Game Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3512518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3576736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms, games, and the internet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921656 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing correlated equilibria in multi-player games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Complexity of Nash Equilibria in Concisely Represented Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of equivalence and isomorphism problems / rank
 
Normal rank

Latest revision as of 20:27, 4 July 2024

scientific article
Language Label Description Also known as
English
Equilibria problems on games: complexity versus succinctness
scientific article

    Statements

    Equilibria problems on games: complexity versus succinctness (English)
    0 references
    0 references
    0 references
    0 references
    11 January 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    extensive games
    0 references
    strategic games, Nash equilibria
    0 references
    complexity classes
    0 references
    succinct representations
    0 references
    0 references