Criterion for complete determinacy for concave-convexlike games

DOI10.1007/BF01158303zbMath0733.90078MaRDI QIDQ810385

Iosif Pinelis

Publication date: 1991

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

minimaxconcave-convex payoffsTwo-person zero-sum continuous games

Mathematics Subject Classification ID

2-person games (91A05)

Related Items (2)

Exact Bounds on the Truncated-Tilted Mean, with Applications ⋮ Exact lower bounds for the agnostic probably-approximately-correct (PAC) machine learning model

Cites Work

• On general minimax theorems
• Minimax Theorems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Criterion for complete determinacy for concave-convexlike games