The following pages link to Eilon Solan (Q203957):
Displaying 50 items.
- Bounded computational capacity equilibrium (Q281361) (← links)
- A general internal regret-free strategy (Q291209) (← links)
- Non-existence of subgame-perfect \(\varepsilon \)-equilibrium in perfect information games with infinite horizon (Q480860) (← links)
- Strong approachability (Q482552) (← links)
- Equilibrium payoffs of finite games (Q533910) (← links)
- Communication, correlation and cheap-talk in games with public information (Q665090) (← links)
- Correlated equilibrium in stochastic games (Q700122) (← links)
- A sequential selection game with vetoes (Q844901) (← links)
- Computing uniformly optimal strategies in two-player stochastic games (Q847800) (← links)
- An application of Ramsey theorem to stopping games. (Q1395588) (← links)
- Randomization and simplification in dynamic decision-making. (Q1406467) (← links)
- Characterization of correlated equilibria in stochastic games (Q1414402) (← links)
- Correlated equilibrium payoffs and public signalling in absorbing games (Q1414439) (← links)
- Quitting games -- an example (Q1414458) (← links)
- Deterministic multi-player Dynkin games. (Q1415913) (← links)
- Continuity of the value of competitive Markov decision processes (Q1426850) (← links)
- The maxmin value of stochastic games with imperfect monitoring (Q1434484) (← links)
- Absorbing team games (Q1577959) (← links)
- Stochastic games with non-absorbing states. (Q1594888) (← links)
- Acceptable strategy profiles in stochastic games (Q1651302) (← links)
- Robust optimal strategies in Markov decision problems (Q1667199) (← links)
- The value functions of Markov decision processes (Q1755814) (← links)
- The modified stochastic game (Q1757093) (← links)
- Continuous-time games of timing (Q1774814) (← links)
- Blackwell optimality in Markov decision processes with partial observation. (Q1848970) (← links)
- Uniform value in recursive games. (Q1872365) (← links)
- Games with espionage (Q1885430) (← links)
- Two-player nonzero-sum stopping games in discrete time. (Q1889797) (← links)
- Dynamic sender-receiver games (Q1945834) (← links)
- Optimal dynamic information provision (Q2013351) (← links)
- Approachability with constraints (Q2030626) (← links)
- Dynamic monitoring under resource constraints (Q2049495) (← links)
- Sunspot equilibrium in positive recursive general quitting games (Q2051505) (← links)
- Browder's theorem with general parameter space (Q2073454) (← links)
- Logit equilibrium as an approximation of Nash equilibrium (Q2183201) (← links)
- Reachability and safety objectives in Markov decision processes on long but finite horizons (Q2188953) (← links)
- Solving two-state Markov games with incomplete information on one side (Q2195688) (← links)
- On the optimal amount of experimentation in sequential decision problems (Q2267618) (← links)
- Jointly controlled lotteries with biased coins (Q2291182) (← links)
- Characterizing the value functions of polynomial games (Q2294535) (← links)
- Cooperation under incomplete information on the discount factors (Q2349412) (← links)
- Approximating a sequence of observations by a simple process (Q2388342) (← links)
- Informational externalities and emergence of consensus (Q2389318) (← links)
- Approachability with bounded memory (Q2389319) (← links)
- Sporadic overtaking optimality in Markov decision problems (Q2397931) (← links)
- Strategic information exchange (Q2437831) (← links)
- Zero-sum dynamic games and a stochastic variation of Ramsey's theorem (Q2485779) (← links)
- Equilibrium uniqueness with perfect complements (Q2502349) (← links)
- Learning from Michael Maschler and working with him (Q2519469) (← links)
- Discounted Stochastic Games (Q2757578) (← links)
