The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
An analog of the minimax theorem for vector payoffs
Open accessAbstract
1. Introduction * The von Neumann minimax theorem [2] for finite games asserts that for every rxs matrix M=\\\\m(i, j)\\ \\ with real elements there exist a number v and vectors such that P=(Pi, •••, P
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Theory of games and economic behavior
(2019) · 100 Years of Math Milestones · doi:10.1090/mbk/121/32 · Cited by 16,632
Theory of Games and Economic Behavior
Hawkins, D. (1945) · Philosophy of Science · doi:10.1086/286866 · Cited by 3,887
Review: John von Neumann and Oskar Morgenstern, Theory of games and economic behavior
Copeland, A. H. (1945) · Project Euclid (Cornell University) · Cited by 301
Complex bundles with Abelian group
Hawley, N. S. (1956) · Pacific Journal of Mathematics · doi:10.2140/pjm.1956.6.65 · Cited by 19
Cited by
A decision-theoretic generalization of on-line learning and an application to boosting
Freund, Y., & Schapire, R. E. (1997) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1504 · Cited by 20,466
Prediction, Learning, and Games
Cesa-Bianchi, N., & Lugosi, G. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546921 · Cited by 3,162
(2003) · Cited by 1,733
A Simple Adaptive Procedure Leading to Correlated Equilibrium
Hart, S., & Mas-Colell, A. (2000) · Econometrica · doi:10.1111/1468-0262.00153 · Cited by 1,088
Concentration of Measure for the Analysis of Randomized Algorithms
Dubhashi, D. P., & Panconesi, A. (2009) · Cambridge University Press eBooks · doi:10.1017/cbo9780511581274 · Cited by 945
Adaptive Game Playing Using Multiplicative Weights
Freund, Y., & Schapire, R. E. (1999) · Games and Economic Behavior · doi:10.1006/game.1999.0738 · Cited by 515
Regret Minimization in Games with Incomplete Information
Bowling, M., Johanson, M., Zinkevich, M., & Piccione, C. (2007) · doi:10.7939/r3q23r282 · Cited by 480
Merhav, N., & Feder, M. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720534 · Cited by 438
A Convergence Theorem for Non Negative Almost Supermartingales and Some Applications
Robbins, H., & Siegmund, D. (1985) · Herbert Robbins Selected Papers · doi:10.1007/978-1-4612-5110-1_10 · Cited by 412
Game theory, on-line prediction and boosting
Freund, Y., & Schapire, R. E. (1996) · Proceedings of the ninth annual conference on Computational learning theory - COLT '96 · doi:10.1145/238061.238163 · Cited by 383
Universal prediction of individual sequences
Feder, M., Merhav, N., & Gutman, M. (1992) · IEEE Transactions on Information Theory · doi:10.1109/18.144706 · Cited by 373
Maschler, M., Solan, E., & Zamir, S. (2013) · Cambridge University Press eBooks · doi:10.1017/cbo9780511794216 · Cited by 369
Calibrated Learning and Correlated Equilibrium
Foster, D. P., & Vohra, R. V. (1997) · Games and Economic Behavior · doi:10.1006/game.1997.0595 · Cited by 365
Universal portfolios with side information
Cover, T. M., & Ordentlich, E. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.485708 · Cited by 347
Non-stationary stochastic optimization
Besbes, O., Gur, Y., & Zeevi, A. (2015) · Operations Research · doi:10.1287/opre.2015.1408 · Cited by 337
A Review of Safe Reinforcement Learning: Methods, Theories, and Applications
Gu, S., Yang, L., Du, Y., Chen, G., Walter, F., Wang, J., & Knoll, A. (2024) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2024.3457538 · Cited by 315
Regret in the On-Line Decision Problem
Foster, D. P., & Vohra, R. (1999) · Games and Economic Behavior · doi:10.1006/game.1999.0740 · Cited by 302
Relative Loss Bounds for On-Line Density Estimation with the Exponential Family of Distributions
Azoury, K. S., & Warmuth, M. K. (2001) · Machine Learning · doi:10.1023/a:1010896012157 · Cited by 298
Repeated insurance contracts and moral hazard
Rubinstein, A., & Yaari, M. E. (1983) · Journal of Economic Theory · doi:10.1016/0022-0531(83)90094-7 · Cited by 265
A survey of multicriteria optimization or the vector maximum problem, part I: 1776?1960
Stadler, W. (1979) · Journal of Optimization Theory and Applications · doi:10.1007/bf00932634 · Cited by 237
Metadata
- Authors
- Blackwell, D.
- Venue
- Pacific Journal of Mathematics
- Publisher
- Mathematical Sciences Publishers
- Published
- 1956-03-01
- Volume
- 6
- Issue
- 1
- Pages
- 1-8
- ISSN
- 0030-8730 (ISSN-L)
- OpenAlex
- W1982813377
- Cited by
- 740
- References
- 4
- FWCI
- 14.00
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.