A Mixed-Strategy Minimax Theorem without Compactness
From MaRDI portal
Publication:3813632
DOI10.1137/0326077zbMath0662.90092OpenAlexW2037884978MaRDI QIDQ3813632
Publication date: 1988
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0326077
measurable spacemixed strategiesinfinite gamesmeasurable functioncompact Hausdorff spaceBorel probability measuresconvex set of probability measuresMinimax theorems
Related Items (8)
Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object ⋮ Competitive search in a network ⋮ A Caching Game with Infinitely Divisible Hidden Material ⋮ Solutions for zero‐sum two‐player games with noncompact decision sets and unbounded payoffs ⋮ Search Games: A Review ⋮ A new approach to Gal's theory of search games on weakly Eulerian networks ⋮ Searching symmetric networks with Utilitarian-Postman paths ⋮ Searching a Variable Speed Network
This page was built for publication: A Mixed-Strategy Minimax Theorem without Compactness