Perfect information stochastic games and related classes
From MaRDI portal
Publication:1365006
DOI10.1007/BF01263280zbMATH Open0880.90148OpenAlexW3122224521MaRDI QIDQ1365006FDOQ1365006
Authors: Frank Thuijsman, Thirukkannamangai E. S. Raghavan 
Publication date: 5 February 1998
Published in: International Journal of Game Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01263280
Recommendations
Stochastic games, stochastic differential games (91A15) Computational methods for problems pertaining to game theory, economics, and finance (91-08)
Cites Work
- Stochastic games
- On stochastic games with additive reward and transition structure
- Recursive Repeated Games with Absorbing States
- Stochastic Games with Perfect Information and Time Average Payoff
- Ordered field property for stochastic games when the player who controls transitions changes from state to state
- Title not available (Why is that?)
- A finite algorithm for the switching control stochastic game
Cited In (45)
- A policy improvement algorithm for solving a mixture class of perfect information and AR-at semi-Markov games
- Subgame-perfection in free transition games
- Perfect equilibria in stochastic games
- Solving subclasses of multi-player stochastic games via linear complementarity problem formulations -- a survey and some new results
- Subgame-perfection in recursive perfect information games, where each player controls one state
- Zero-sum two person games
- Parameterized games of perfect information
- On Nash-solvability of \(n\)-person graphical games under Markov and a-priori realizations
- Foundations of Software Science and Computation Structures
- On stochastic games with additive reward and transition structure
- Pure subgame-perfect equilibria in free transition games
- Multiplayer cost games with simple Nash equilibria
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- The Complexity of Nash Equilibria in Limit-Average Games
- Unraveling in a repeated moral hazard model with multiple agents
- Orderfield property of mixtures of stochastic games
- Discrete stop-or-go games
- On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles.
- Almost stationary \(\epsilon\)-equilibria in zero-sum stochastic games
- Two-player stochastic games. I: A reduction
- Dynamic Games with Perfect Information
- Selfish cops and active robber: multi-player pursuit evasion on graphs
- Extending finite-memory determinacy to multi-player games
- A new perfect information game; No chance backgammon
- Average-discounted equilibria in stochastic games
- Perfect Information Stochastic Priority Games
- Branching time, perfect information games, and backward induction
- On discounted AR-AT semi-Markov games and its complementarity formulations
- Stationary Markov Nash equilibria for nonzero-sum constrained ARAT Markov games
- On pure stationary almost Markov Nash equilibria in nonzero-sum ARAT stochastic games
- Pure Equilibrium Strategies for Stochastic Games via Potential Functions
- Generalized cops and robbers: a multi-player pursuit game on graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Pure Strategies in Imperfect Information Stochastic Games
- Stochastic games
- Identification of complete information games
- Perfect information two-person zero-sum Markov games with imprecise transition probabilities
- Equilibrium in two-player stochastic games with shift-invariant payoffs
- Absorbing team games
- EQUILIBRIUM STRATEGIES IN STOCHASTIC GAMES WITH ADDITIVE COST AND TRANSITION STRUCTURE
- Stochastic games with additive transitions
- On positionality of trigger strategies Nash equilibria in SCAR
- The Condorcet paradox revisited
This page was built for publication: Perfect information stochastic games and related classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1365006)
