The Complexity of Nash Equilibria in Infinite Multiplayer Games (Q5458348): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1007/978-3-540-78499-9_3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1589508846 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3956774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: DAG-Width and Parity Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Science Logic / 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: Q5817866 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Borel determinacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: DAG-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-Width and Parity Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3576736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational Behaviour and Strategy Construction in Infinite Multiplayer Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite games on finitely coloured graphs with applications to automata on infinite trees / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:16, 27 June 2024

scientific article; zbMATH DE number 5262397
Language Label Description Also known as
English
The Complexity of Nash Equilibria in Infinite Multiplayer Games
scientific article; zbMATH DE number 5262397

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references