Criterion for complete determinacy for concave-convexlike games

DOI10.1007/BF01158303MaRDI QIDQ810385zbMATHFDO

Authors 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)

Recommendations

• A minmax theorem for concave-convex mappings with no regularity assumptions
• Publication:4723588
• scientific article; zbMATH DE number 3062461
• Games with convex payoff function in the first variable
• scientific article; zbMATH DE number 3852825

Cites work

• scientific article; zbMATH DE number 3206518 (Why is no real title available?)
• scientific article; zbMATH DE number 3289807 (Why is no real title available?)
• scientific article; zbMATH DE number 3071410 (Why is no real title available?)
• scientific article; zbMATH DE number 3084669 (Why is no real title available?)
• Minimax Theorems
• On general minimax theorems

Cited in

(5)

• Exact Bounds on the Truncated-Tilted Mean, with Applications
• A minmax theorem for concave-convex mappings with no regularity assumptions
• A solution for a two-person zero-sum game with a concave payoff function
• scientific article; zbMATH DE number 4099084 (Why is no real title available?)
• Exact lower bounds for the agnostic probably-approximately-correct (PAC) machine learning model

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q810385)