Pages that link to "Item:Q3813632"
From MaRDI portal
The following pages link to A Mixed-Strategy Minimax Theorem without Compactness (Q3813632):
Displayed 8 items.
- A new approach to Gal's theory of search games on weakly Eulerian networks (Q692087) (← links)
- Competitive search in a network (Q2184175) (← links)
- A Caching Game with Infinitely Divisible Hidden Material (Q2949985) (← links)
- Search Games: A Review (Q2961390) (← links)
- Searching symmetric networks with Utilitarian-Postman paths (Q3057096) (← links)
- Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object (Q3195234) (← links)
- Searching a Variable Speed Network (Q5244863) (← links)
- Solutions for zero‐sum two‐player games with noncompact decision sets and unbounded payoffs (Q6079117) (← links)