Equilibrium play in matches: binary Markov games
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3128725 (Why is no real title available?)
- scientific article; zbMATH DE number 3128726 (Why is no real title available?)
- scientific article; zbMATH DE number 2013849 (Why is no real title available?)
- On the Existence of Easy Initial States for Undiscounted Stochastic Games
- On the irrelevance of risk attitudes in repeated two-outcome games
- Recursive Repeated Games with Absorbing States
- Stochastic Games
- Stochastic games
- The Big Match
- The bad match; a total reward stochastic game
- Two-player stochastic games. I: A reduction
- Two-player stochastic games. II: The case of recursive games
Cited in
(11)- Special issue: supermodularity and monotonicity in economics
- The value of a draw
- Psychological pressure and the right to determine the moves in dynamic tournaments -- evidence from a natural field experiment
- On Markov perfect equilibria in baseball
- The efficiency of top agents: an analysis through service strategy in tennis
- Allocating energy in a first-to-n match
- Strategic complements in two stage, \(2\times 2\) games
- The endgame
- Expertise, gender, and equilibrium play
- The tennis coach problem: a game-theoretic and experimental study
- First-mover advantage in best-of series: an experimental comparison of role-assignment rules
This page was built for publication: Equilibrium play in matches: binary Markov games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q632969)