The LP formulation of finite zero-sum games with incomplete information

DOI10.1007/BF01769767MaRDI QIDQ1139507zbMATH OpenFDO

Authors Jean Pierre Ponssard, Sylvain Sorin

Publication date 1980

Published in International Journal of Game Theory (Search for Journal in Brave)

zbMATH Keywords

incomplete informationapplication of linear programmingdetermination of the valuefinite two-person zero-sum game

Mathematics Subject Classification ID

Linear programming (90C05) Applications of mathematical programming (90C90) 2-person games (91A05)

Cites work

• A note on the L-P formulation of zero-sum sequential games with incomplete information
• The value of two-person zero-sum repeated games with lack of information on both sides
• Zero-Sum Games with “Almost” Perfect Information

Cited in

(9)

• Upper and lower values in zero-sum stochastic games with asymmetric information
• Cyber-attack forecast modeling and complexity reduction using a game-theoretic framework
• Repeated games with incomplete information
• On stochastic games with lack of information on one side
• On the role of chance moves and information in two-person games
• Some results on zero-sum games with incomplete information: The dependent case
• Optimal strategies for the uninformed player
• Game theoretic resource allocation model for designing effective traffic safety solution against drunk driving
• Markov games with incomplete information

This page was built for publication: The LP formulation of finite zero-sum games with incomplete information

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