On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles. (Q1414826): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal paths in network games with \(p\) players / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positional strategies for mean payoff games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic Markov equilibria in stochastic games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight cyclic game forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4695866 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3798499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on the existence of equilibrium situations in pure stationary strategies for ergodic extensions of (2×<i>k</i>)-bimatrix games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3812077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Commodity Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of the minimum cycle mean in a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclical games with prohibitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contributions to the Theory of Games (AM-28), Volume II / rank
 
Normal rank
Property / cites work
 
Property / cites work: A subexponential randomized algorithm for the simple stochastic game problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Borel determinacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of Borel determinacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972747 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic games have a value / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4117607 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions of two person zero sum games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3332693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5844986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mean Cost Cyclical Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On stochastic games with additive reward and transition structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zermelo and the early history of game theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic games with non-absorbing states. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect information stochastic games and related classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-player stochastic games. I: A reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fictitious play applied to sequences of games and discounted stochastic games / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0165-4896(03)00077-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1984807749 / rank
 
Normal rank

Latest revision as of 10:54, 30 July 2024

scientific article
Language Label Description Also known as
English
On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles.
scientific article

    Statements

    On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles. (English)
    0 references
    0 references
    0 references
    4 December 2003
    0 references
    backward induction
    0 references
    cyclic game
    0 references
    Nash equilibrium
    0 references
    perfect information
    0 references
    pure strategies
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers