A Mixed-Strategy Minimax Theorem without Compactness

DOI10.1137/0326077zbMATH Open0662.90092OpenAlexW2037884978MaRDI QIDQ3813632FDOQ3813632

Steve Alpern, Shmuel Gal

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

zbMATH Keywords

compact Hausdorff spacemeasurable functionmixed strategiesmeasurable spaceinfinite gamesBorel probability measuresconvex set of probability measuresMinimax theorems

Mathematics Subject Classification ID

2-person games (91A05)

Cited In (11)

• A new approach to Gal's theory of search games on weakly Eulerian networks
• Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object
• Searching symmetric networks with Utilitarian-Postman paths
• Mixed strategy play and the minimax hypothesis
• Mixing on function spaces
• Search Games: A Review
• A Caching Game with Infinitely Divisible Hidden Material
• Competitive search in a network
• Solutions for zero‐sum two‐player games with noncompact decision sets and unbounded payoffs
• Searching a Variable Speed Network
• Title not available (Why is that?)

   Recommendations

• Title not available (Why is that?) 👍 👎
• A general min-max theorem 👍 👎
• On Borel probability measures and noncooperative game theory 👍 👎
• Non-convex infinite games 👍 👎
• Title not available (Why is that?) 👍 👎

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)