Pages that link to "Item:Q1367953"
From MaRDI portal
The following pages link to Algorithms for finding repeated game equilibria (Q1367953):
Displaying 13 items.
- On the computation of value correspondences for dynamic games (Q298295) (← links)
- A strategic dynamic programming method for studying short-memory equilibria of stochastic games with uncountable number of states (Q298297) (← links)
- Elementary subpaths in discounted stochastic games (Q338213) (← links)
- Computing equilibria in discounted dynamic games (Q668745) (← links)
- Subgame perfect equilibria in discounted stochastic games (Q892319) (← links)
- Game problem of adaptive selection of versions and an algorithm for solving it (Q1057820) (← links)
- Critical discount factor values in discounted supergames (Q1630459) (← links)
- Construction of subgame-perfect mixed-strategy equilibria in repeated games (Q1656984) (← links)
- Set-valued games and mixed-strategy equilibria in discounted supergames (Q1727718) (← links)
- Equilibrium paths in discounted supergames (Q1741494) (← links)
- Repeated games simulating exchange auction and recursive sequences (Q2017538) (← links)
- A distributed algorithm to obtain repeated games equilibria with discounting (Q2284815) (← links)
- Conditional Markov equilibria in discounted dynamic games (Q2391868) (← links)