The following pages link to Janos Flesch (Q1364997):
Displaying 50 items.
- (Q257257) (redirect page) (← links)
- Subgame-perfection in free transition games (Q257260) (← links)
- Subgame-perfection in recursive perfect information games, where each player controls one state (Q267090) (← links)
- Subgame-perfect \(\epsilon\)-equilibria in perfect information games with sigma-discrete discontinuities (Q281206) (← links)
- Doing it now, later, or never (Q290176) (← links)
- (Q328544) (redirect page) (← links)
- On refinements of subgame perfect \(\epsilon\)-equilibrium (Q328545) (← links)
- Evolutionary stochastic games (Q367434) (← links)
- Dynamic competition with consumer inertia (Q392659) (← links)
- Non-existence of subgame-perfect \(\varepsilon \)-equilibrium in perfect information games with infinite horizon (Q480860) (← links)
- Implementable and ex-post IR rules in bilateral trading with discrete values (Q502369) (← links)
- Zero-sum games with charges (Q523534) (← links)
- Stochastic games on a product state space: the periodic case (Q532671) (← links)
- Strategic disclosure of random variables (Q617521) (← links)
- Loss of skills in coordination games (Q647344) (← links)
- Behavioral perfect equilibrium in Bayesian games (Q738928) (← links)
- Stochastic games with additive transitions (Q858465) (← links)
- Repeated games with bonuses (Q927221) (← links)
- Repeated games with voluntary information purchase (Q1021588) (← links)
- Pure subgame-perfect equilibria in free transition games (Q1042162) (← links)
- Cyclic Markov equilibria in stochastic games (Q1364998) (← links)
- Optimality in different strategy classes in zero-sum stochastic games (Q1396935) (← links)
- Almost stationary \(\epsilon\)-equilibria in zero-sum stochastic games (Q1584025) (← links)
- Simplifying optimal strategies in \(\limsup\) and \(\liminf\) stochastic games (Q1627843) (← links)
- Approachability of convex sets in generalized quitting games (Q1651293) (← links)
- Average-discounted equilibria in stochastic games (Q1806896) (← links)
- Stochastic games with non-observable actions (Q1880255) (← links)
- Optimal choice for finite and infinite horizons (Q1939690) (← links)
- Perfect information games where each player acts only once (Q1996105) (← links)
- Catch games: the impact of modeling decisions (Q2002066) (← links)
- Search for a moving target in a competitive environment (Q2041083) (← links)
- Discrete stop-or-go games (Q2041084) (← links)
- Legitimate equilibrium (Q2051501) (← links)
- Subgame perfection in recursive perfect information games (Q2061123) (← links)
- Subgame maxmin strategies in zero-sum stochastic games with tolerance levels (Q2068906) (← links)
- Individual upper semicontinuity and subgame perfect \(\epsilon\)-equilibria in games with almost perfect information (Q2143909) (← links)
- A competitive search game with a moving target (Q2158054) (← links)
- Parameterized games of perfect information (Q2177793) (← links)
- Reachability and safety objectives in Markov decision processes on long but finite horizons (Q2188953) (← links)
- Positive zero-sum stochastic games with countable state and action spaces (Q2198159) (← links)
- The doubling metric and doubling measures (Q2210770) (← links)
- Sporadic overtaking optimality in Markov decision problems (Q2397931) (← links)
- Naiveté and sophistication in dynamic inconsistency (Q2406935) (← links)
- Perfect equilibrium in games with compact action spaces (Q2437833) (← links)
- Fictitious play in stochastic games (Q2472192) (← links)
- Repeated Games with Endogenous Choice of Information Mechanisms (Q2757608) (← links)
- Subgame-Perfect ϵ-Equilibria in Perfect Information Games with Common Preferences at the Limit (Q2833100) (← links)
- Existence of Secure Equilibrium in Multi-player Games with Perfect Information (Q2922609) (← links)
- Stochastic Games on a Product State Space (Q3168973) (← links)
- Subgame Perfection in Positive Recursive Games with Perfect Information (Q3169089) (← links)
