Note on a computation method in the theory of games

DOI10.1002/cpa.3160110408zbMath0093.33102OpenAlexW2132299980WikidataQ126267785 ScholiaQ126267785MaRDI QIDQ3270249

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

Related Items (11)

A sublinear-time randomized approximation algorithm for matrix games ⋮ Modified fictitious play for solving matrix games and linear-programming problems ⋮ On the rate of convergence of fictitious play ⋮ On the rate of convergence of continuous-time fictitious play ⋮ Fictitious play in networks ⋮ Fictitious play applied to sequences of games and discounted stochastic games ⋮ A WEAKENED FORM OF FICTITIOUS PLAY IN TWO-PERSON ZERO-SUM GAMES ⋮ On a relative measure of skill for games with chance elements ⋮ A new kind of fictitious play ⋮ On randomized fictitious play for approximating saddle points over convex sets ⋮ MODERN PRACTICE OF APPLICATION OF MATRIX GAMES

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