The following pages link to Stochastic games (Q5905121):
Displayed 50 items.
- Perfect information stochastic games and related classes (Q1365006) (← links)
- Asymptotic behavior of continuous stochastic games (Q1367870) (← links)
- On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles. (Q1414826) (← links)
- Absorbing team games (Q1577959) (← links)
- Almost stationary \(\epsilon\)-equilibria in zero-sum stochastic games (Q1584025) (← links)
- Stochastic games with non-absorbing states. (Q1594888) (← links)
- Two-player stochastic games. I: A reduction (Q1594889) (← links)
- Two-player stochastic games. II: The case of recursive games (Q1594890) (← links)
- Tauberian theorem for value functions (Q1649024) (← links)
- Approachability of convex sets in generalized quitting games (Q1651293) (← links)
- Tauberian theorems for general iterations of operators: applications to zero-sum stochastic games (Q1651300) (← links)
- Acceptable strategy profiles in stochastic games (Q1651302) (← links)
- Stationary, completely mixed and symmetric optimal and equilibrium strategies in stochastic games (Q1677250) (← links)
- Uniform value for recursive games with compact action sets (Q1755811) (← links)
- The modified stochastic game (Q1757093) (← links)
- An operator solution of stochastic games (Q1802730) (← links)
- Stationary \(\varepsilon\)-optimal strategies in stochastic games (Q1803743) (← links)
- Uniform value in recursive games. (Q1872365) (← links)
- Regularity of dynamic opinion games (Q1995489) (← links)
- On Tauberian theorem for stationary Nash equilibria (Q2010140) (← links)
- Continuous-time stochastic games (Q2013336) (← links)
- Should I remember more than you? Best responses to factored strategies (Q2021813) (← links)
- Absorbing games with a clock and two bits of memory (Q2031198) (← links)
- Sunspot equilibrium in positive recursive general quitting games (Q2051505) (← links)
- Nonzero-sum risk-sensitive average stochastic games: The case of unbounded costs (Q2068913) (← links)
- Constant payoff in zero-sum stochastic games (Q2077348) (← links)
- On completely mixed stochastic games (Q2079301) (← links)
- The evolution of ambiguity in sender -- receiver signaling games (Q2091654) (← links)
- When and how much the altruism impacts your privileged information? Proposing a new paradigm in game theory: the ``boxers game'' (Q2149234) (← links)
- Costless delay in negotiations (Q2168534) (← links)
- Best-response dynamics in zero-sum stochastic games (Q2211487) (← links)
- The value of a draw (Q2218538) (← links)
- The complexity of solving reachability games using value and strategy iteration (Q2254503) (← links)
- ``Big Match'' with lack of information on one side. I (Q2266674) (← links)
- Dynamic competition over social networks (Q2273916) (← links)
- An accretive operator approach to ergodic zero-sum stochastic games (Q2274616) (← links)
- Zero-sum stochastic games over the field of real algebraic numbers (Q2292115) (← links)
- Tauberian theorem for games with unbounded running cost (Q2314448) (← links)
- Communicating zero-sum product stochastic games (Q2314820) (← links)
- The operator approach to entropy games (Q2321934) (← links)
- Qualitative analysis of concurrent mean-payoff games (Q2346403) (← links)
- Solvable states in stochastic games (Q2366103) (← links)
- Generic uniqueness of the bias vector of finite zero-sum stochastic games with perfect information (Q2408625) (← links)
- Orderfield property of mixtures of stochastic games (Q2431021) (← links)
- Approachable sets of vector payoffs in stochastic games (Q2466864) (← links)
- Value and perfection in stochastic games (Q2472752) (← links)
- Zero-sum dynamic games and a stochastic variation of Ramsey's theorem (Q2485779) (← links)
- A potential reduction algorithm for two-person zero-sum mean payoff stochastic games (Q2636482) (← links)
- Two-person zero-sum stochastic games (Q2638976) (← links)
- PIVOTING ALGORITHMS FOR SOME CLASSES OF STOCHASTIC GAMES: A SURVEY (Q2772856) (← links)