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