On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost (Q2440107): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q923675
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Vladimir A. Gurvich / 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.dam.2013.10.025 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2039792186 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On acyclicity of games with cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Graphical Games Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: On short paths interdiction problems: Total and node-wise limited interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: On effectivity functions of game forms / 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 canonical forms for zero-sum stochastic mean payoff 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: Nash-solvable two-person symmetric cycle game forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chess-like games may have no uniform Nash equilibria even in mixed strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time algorithms for energy games with special weight structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating minimum vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bottleneck extrema / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positional strategies for mean payoff games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pure subgame-perfect equilibria in free transition games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgame Perfection in Positive Recursive Games with Perfect Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the minimum source-sink path subject to a budget constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum-Minimum Sätze über Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3245641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The solvability of positional games in pure strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stochastic game with complete information and without equilibrium situations in pure stationary strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3821979 / 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: Q3980317 / rank
 
Normal rank
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: Q4526964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-path network interdiction / 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: Extending Dijkstra’s Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc Interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Games with Perfect Information and Time Average Payoff / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5611539 / 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: Q4117607 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equilibrium points in <i>n</i> -person games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-cooperative games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Shortest Path Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bad match; a total reward stochastic game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total reward stochastic games and sensitive average reward strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic graphical games / rank
 
Normal rank

Latest revision as of 13:13, 7 July 2024

scientific article
Language Label Description Also known as
English
On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost
scientific article

    Statements

    On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost (English)
    0 references
    0 references
    0 references
    27 March 2014
    0 references
    0 references
    stochastic games
    0 references
    chess-like games
    0 references
    local cost
    0 references
    mean and total effective cost
    0 references
    pure and stationary strategies
    0 references
    Nash equilibrium
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references