Criterion for complete determinacy for concave-convexlike games

DOI10.1007/BF01158303zbMATH Open0733.90078MaRDI QIDQ810385FDOQ810385

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)

Cites Work

• Minimax Theorems
• On general minimax theorems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• Exact Bounds on the Truncated-Tilted Mean, with Applications
• Exact lower bounds for the agnostic probably-approximately-correct (PAC) machine learning model
• Title not available (Why is that?)
• A solution for a two-person zero-sum game with a concave payoff function

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)