Constrained nonzero-sum games with partially controllable strategies

DOI10.1007/BF01262978MaRDI QIDQ754780zbMATH OpenFDO

Authors J. K. Sengupta

Publication date 1980

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

linear programmingnonlinear programmingapproximate solutionscomplementary eigenvalue problemsconstraints on the strategiesfinite strategiesNash-equilibrium solutionsnonzero-sum two-person gamespartially controllable strategies

Mathematics Subject Classification ID

2-person games (91A05)

Cites work

• scientific article; zbMATH DE number 3175708 (Why is no real title available?)
• scientific article; zbMATH DE number 3599329 (Why is no real title available?)
• scientific article; zbMATH DE number 3414075 (Why is no real title available?)
• AN ALGORITHM FOR EQUILIBRIUM POINTS IN BIMATRIX GAMES
• Adaptive decision rules for stochastic linear programming
• Chance-Constrained Games with Partially Controllable Strategies
• Equilibrium Points of Bimatrix Games
• Incorrectly posed problems of optimal programming
• Sensitivity of Decisions to Probability Estimation Errors
• Sensitivity of Decisions to Probability Estimation Errors: A Reexamination
• TESTING AND VALIDATION PROBLEMS IN STOCHASTIC LINEAR PROGRAMMING
• Two-person nonzero-sum games and quadratic programming

Cited in

(1)

• Constrained games as complementary eigenvalue problems

This page was built for publication: Constrained nonzero-sum games with partially controllable strategies

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