Hostname: page-component-6bf8c574d5-r4mrb Total loading time: 0 Render date: 2025-03-09T15:49:59.464Z Has data issue: false hasContentIssue false
  • English
  • Français

Stability in the gaming equation

Published online by Cambridge University Press:  17 April 2009

Jason Gait
Jason Gait
Affiliation:
National Bureau of Standards, Gaithersburg, Maryland 20760, USA and Carrier Hall, University of Mississippi, University, Mississippi 38677, USA.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We discuss a computationally stable numerical method for the solution of linear programs and games. The method is useful in obtaining approximate solutions to large numerically unstable linear programs.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 21 , Issue 2 , May 1980 , pp. 207 - 210
Copyright
Copyright © Australian Mathematical Society 1980

References

[1]Brown, G.W. and von Neumann, J., “Solutions of games by differential equations”, Contributions to the theory of games, 73–79 (Annals of Mathematics Studies, 24. Princeton University Press, Princeton, New Jersey, 1950).Google Scholar
[2]Dresher, Melvin, Games of strategy. Theory and applications (Prentice-Hall, Englewood Cliffs, New Jersey, 1961).Google Scholar
[3]Gale, D., Kuhn, H.W. and Tucker, A.W., “On symmetric games”, Contributions to the theory of games, 81–87 (Annals of Mathematics Studies, 24. Princeton University Press, Princeton, New Jersey, 1950).Google Scholar
[4]La Salle, Jospeh and Lefschetz, Solomon, Stability by Lyapunov's direct method with applications (Mathematics in Science and Engineering, 4. Academic Press, New York, London, 1961).Google Scholar