Modified fictitious play for solving matrix games and linear-programming problems
From MaRDI portal
Recommendations
Cites work
- An analysis of an available set of linear programming test problems
- An iterative method of solving a game
- scientific article; zbMATH DE number 3926672 (Why is no real title available?)
- scientific article; zbMATH DE number 3956805 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3062452 (Why is no real title available?)
- scientific article; zbMATH DE number 3062453 (Why is no real title available?)
- scientific article; zbMATH DE number 3062454 (Why is no real title available?)
- scientific article; zbMATH DE number 3069635 (Why is no real title available?)
- Implementation of a Dual Affine Interior Point Algorithm for Linear Programming
- Note on a computation method in the theory of games
- On Finding Primal- and Dual-Optimal Bases
- Recovering an optimal LP basis from an interior point solution
Cited in
(7)- Geometrically convergent projection method in matrix games
- A weakened form of fictitious play in two-person zero-sum games
- scientific article; zbMATH DE number 1988045 (Why is no real title available?)
- A new kind of fictitious play
- Robustness properties in fictitious-play-type algorithms
- scientific article; zbMATH DE number 961683 (Why is no real title available?)
- scientific article; zbMATH DE number 4189498 (Why is no real title available?)
This page was built for publication: Modified fictitious play for solving matrix games and linear-programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1919970)