A Mixed-Strategy Minimax Theorem without Compactness
From MaRDI portal
Recommendations
Cited in
(21)- Convex semi-infinite games
- Minimax selection theorems
- The Minmax Theorem for U.S.C.-L.S.C. payoff functions
- Mixing on function spaces
- General theorem on a finite support of mixed strategy in the theory of zero-sum games
- Competitive search in a network
- The joint continuity of the expected payoff functions
- A Caching Game with Infinitely Divisible Hidden Material
- Search games: a review
- Searching symmetric networks with Utilitarian-Postman paths
- Optimal trade-off between speed and acuity when searching for a small object
- Non-convex infinite games
- scientific article; zbMATH DE number 1328119 (Why is no real title available?)
- scientific article; zbMATH DE number 1930735 (Why is no real title available?)
- Searching a variable speed network
- On Borel probability measures and noncooperative game theory
- The compactness of Pr(K)
- Solutions for zero‐sum two‐player games with noncompact decision sets and unbounded payoffs
- A new approach to Gal's theory of search games on weakly Eulerian networks
- Mixed strategy play and the minimax hypothesis
- On finite approximation of a game solution with mixed strategies
This page was built for publication: A Mixed-Strategy Minimax Theorem without Compactness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3813632)
