Note on a computation method in the theory of games

DOI10.1002/CPA.3160110408zbMATH Open0093.33102OpenAlexW2132299980WikidataQ126267785 ScholiaQ126267785MaRDI QIDQ3270249FDOQ3270249

Authors: Harold N. Shapiro 

Publication date: 1958

Published in: Communications on Pure and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/cpa.3160110408

zbMATH Keywords

applications of probability theory and statistics

Cited In (10)

• Fictitious play applied to sequences of games and discounted stochastic games
• On the rate of convergence of continuous-time fictitious play
• A weakened form of fictitious play in two-person zero-sum games
• On a relative measure of skill for games with chance elements
• A sublinear-time randomized approximation algorithm for matrix games
• Modified fictitious play for solving matrix games and linear-programming problems
• A new kind of fictitious play
• Modern practice of application of matrix games
• Fictitious play in networks
• On the rate of convergence of fictitious play

This page was built for publication: Note on a computation method in the theory of games

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