Pages that link to "Item:Q3569829"
From MaRDI portal
The following pages link to A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information (Q3569829):
Displaying 16 items.
- Quantitative verification and strategy synthesis for stochastic games (Q328165) (← links)
- On canonical forms for zero-sum stochastic mean payoff games (Q367425) (← links)
- On Nash equilibria and improvement cycles in pure positional strategies for chess-like and backgammon-like \(n\)-person games (Q409428) (← links)
- Strategy recovery for stochastic mean payoff games (Q528499) (← links)
- A convex programming-based algorithm for mean payoff stochastic games with perfect information (Q1686541) (← links)
- Approximation schemes for stochastic mean payoff games with perfect information and few random positions (Q1755732) (← links)
- Metric and ultrametric inequalities for directed graphs (Q2127613) (← links)
- An accretive operator approach to ergodic zero-sum stochastic games (Q2274616) (← links)
- A game theory approach to the existence and uniqueness of nonlinear Perron-Frobenius eigenvectors (Q2281568) (← links)
- Probabilistic punishment and reward under rule of trust-based decision-making in continuous public goods game (Q2288511) (← links)
- A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions (Q2417852) (← links)
- On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost (Q2440107) (← links)
- On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness (Q2450666) (← links)
- A potential reduction algorithm for two-person zero-sum mean payoff stochastic games (Q2636482) (← links)
- Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes (Q3012799) (← links)
- Max-Closed Semilinear Constraint Satisfaction (Q5740179) (← links)
