Equilibria in nonantagonistic positional games on graphs and searching for them (Q1642049): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Cyclic games and an algorithm to find minimax cycle means in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5817864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Nash equilibria and improvement cycles in pure positional strategies for chess-like and backgammon-like \(n\)-person games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclicity of improvements in finite game forms / rank
 
Normal rank

Revision as of 00:01, 16 July 2024

scientific article
Language Label Description Also known as
English
Equilibria in nonantagonistic positional games on graphs and searching for them
scientific article

    Statements

    Equilibria in nonantagonistic positional games on graphs and searching for them (English)
    0 references
    0 references
    20 June 2018
    0 references
    0 references
    positional games
    0 references
    stationary Nash equilibria
    0 references
    Cournot acyclicity
    0 references
    polynomial algorithm
    0 references