Note on a Computation Method in the Theory of Games
By H. N. Shapiro. 1958
Subfields: Probabilistic & Bayesian Methods, Game & Decision Theory
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Probabilistic & Bayesian Methods
In Game & Decision Theory
Citations in the corpus
- Frank-Wolfe Algorithms for Saddle Point Problems (2016, background): “Its convergence has been proved by Robinson (1951), while Shapiro (1958) showed that one can deduce from Robinson’s proof a O ( t − 1 / ( p + q − 2) ) rate.”