Stochastic Games with Perfect Information and Time Average Payoff

DOI10.1137/1011093zbMath0193.19602OpenAlexW2078268196MaRDI QIDQ5588290

Steven A. Lippman, Thomas M. Liggett

Publication date: 1969

Published in: SIAM Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1011093

zbMATH Keywords

operations research

Related Items (49)

TROPICAL POLYHEDRA ARE EQUIVALENT TO MEAN PAYOFF GAMES ⋮ Tropically convex constraint satisfaction ⋮ STATIONARY STRATEGIES IN ZERO-SUM STOCHASTIC GAMES ⋮ Algorithms for stochastic games ? A survey ⋮ Quantitative verification and strategy synthesis for stochastic games ⋮ Stochastic games with additive transitions ⋮ Perfect information stochastic games and related classes ⋮ The level set method for the two-sided max-plus eigenproblem ⋮ On canonical forms for zero-sum stochastic mean payoff games ⋮ Generic uniqueness of the bias vector of finite zero-sum stochastic games with perfect information ⋮ Solving generic nonarchimedean semidefinite programs using stochastic game algorithms ⋮ Unnamed Item ⋮ A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions ⋮ A convex programming-based algorithm for mean payoff stochastic games with perfect information ⋮ Examples concerning Abel and Cesàro limits ⋮ Subgame optimal strategies in finite concurrent games with prefix-independent objectives ⋮ On Nash equilibria and improvement cycles in pure positional strategies for chess-like and backgammon-like \(n\)-person games ⋮ Tropical Linear Regression and Mean Payoff Games: Or, How to Measure the Distance to Equilibria ⋮ Convex lattice equation systems ⋮ Unnamed Item ⋮ Value Iteration ⋮ Submixing and shift-invariant stochastic games ⋮ Tropical linear-fractional programming and parametric mean payoff games ⋮ Unnamed Item ⋮ On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost ⋮ Constraint Satisfaction Problems over Numeric Domains ⋮ On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness ⋮ Cycles in extensive form perfect information games ⋮ Stochastic limit-average games are in EXPTIME ⋮ Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes ⋮ A three-person deterministic graphical game without Nash equilibria ⋮ A nested family of \(k\)-total effective rewards for positional games ⋮ Approximation schemes for stochastic mean payoff games with perfect information and few random positions ⋮ Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games ⋮ Strategy recovery for stochastic mean payoff games ⋮ Reduction of stochastic parity to stochastic mean-payoff games ⋮ The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata ⋮ Max-Closed Semilinear Constraint Satisfaction ⋮ Tropical polar cones, hypergraph transversals, and mean payoff games ⋮ A computation method for matrix differential games ⋮ On Solving Mean Payoff Games Using Pivoting Algorithms ⋮ Average-discounted equilibria in stochastic games ⋮ On Memoryless Quantitative Objectives ⋮ A non-iterative algorithm for generalized pig games ⋮ Pure subgame-perfect equilibria in free transition games ⋮ MARKOV STRATEGIES ARE BETTER THAN STATIONARY STRATEGIES ⋮ Qualitative analysis of concurrent mean-payoff games ⋮ Looking at mean-payoff and total-payoff through windows ⋮ Some comments on a theorem of Hardy and Littlewood

This page was built for publication: Stochastic Games with Perfect Information and Time Average Payoff