Constrained nonzero-sum games with partially controllable strategies

DOI10.1007/BF01262978zbMATH Open0416.90082MaRDI QIDQ754780FDOQ754780

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

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

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)