Skip to main content
Book Chapter

Zero-sum two person games

Springer New York, (2012), 3372-3395
DOI: 10.1007/978-1-4614-1800-9_209
2Citations
Citations of this article
72Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Article Outline: Introduction Games with Perfect Information Mixed Strategy and Minimax Theorem Behavior Strategies in Games with Perfect Recall Efficient Computation of Behavior Strategies General Minimax Theorems Applications of Infinite Games Epilogue Acknowledgment Bibliography

Cite

CITATION STYLE

APA

Raghavan, T. E. S. (2012). Zero-sum two person games. In Computational Complexity: Theory, Techniques, and Applications (Vol. 9781461418009, pp. 3372–3395). Springer New York. https://doi.org/10.1007/978-1-4614-1800-9_209

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free