In generic symmetric two-player games, a Nash equilibrium is learnable if and only if it has index +1.
Real-time logics: Complexity and expressiveness
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Non-Markovian policies from decomposed temporal logic value functions are proven optimal for nested Until, Globally, and Globally-Until specifications and extend Q-function safety filters to complex tasks.
citing papers explorer
-
A Note on Learnable Nash Equilibrium
In generic symmetric two-player games, a Nash equilibrium is learnable if and only if it has index +1.
-
Value Functions for Temporal Logic: Optimal Policies and Safety Filters
Non-Markovian policies from decomposed temporal logic value functions are proven optimal for nested Until, Globally, and Globally-Until specifications and extend Q-function safety filters to complex tasks.