Pages that link to "Item:Q2466864"
From MaRDI portal
The following pages link to Approachable sets of vector payoffs in stochastic games (Q2466864):
Displayed 6 items.
- Approachability of convex sets in generalized quitting games (Q1651293) (← links)
- Approachability in Stackelberg stochastic games with vector costs (Q1707454) (← links)
- Q-learning for Markov decision processes with a satisfiability criterion (Q1749413) (← links)
- Approachability with constraints (Q2030626) (← links)
- Stochastic Games (Q5149735) (← links)
- Opportunistic Approachability and Generalized No-Regret Problems (Q5247611) (← links)