The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Adaptive Game Playing Using Multiplicative Weights
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Probability Inequalities for sums of Bounded Random Variables
Hoeffding, W. (1994) · Springer Series in Statistics · doi:10.1007/978-1-4612-0865-5_26 · Cited by 6,666
Probability Inequalities for Sums of Bounded Random Variables
Hoeffding, W. (1963) · Journal of the American Statistical Association · doi:10.1080/01621459.1963.10500830 · Cited by 4,852
The Weighted Majority Algorithm
Littlestone, N., & Warmuth, M. K. (1994) · Information and Computation · doi:10.1006/inco.1994.1009 · Cited by 1,975
Contributions to the theory of games.
(1960) · Journal of the Franklin Institute · doi:10.1016/0016-0032(60)90366-5 · Cited by 1,824
Mathematical Statistics A Decision Theoretic Approach
Rogers, G. S. (1968) · Technometrics · doi:10.1080/00401706.1968.10490555 · Cited by 1,488
Elements of Information Theory
Phoenix, S. J. D. (1992) · Journal of Modern Optics · doi:10.1080/09500349214551641 · Cited by 1,380
Contributions to the Theory of Games
Rubin, H., Kuhn, H. W., & Tucker, A. W. (1952) · Econometrica · doi:10.2307/1907817 · Cited by 1,198
Dawid, A. P. (1984) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2981683 · Cited by 1,085
Theory of Games and Statistical Decisions.
Vajda, S., Blackwell, D., & Girshick, M. A. (1955) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2342525 · Cited by 1,032
Exponentiated Gradient versus Gradient Descent for Linear Predictors
Kivinen, J., & Warmuth, M. K. (1997) · Information and Computation · doi:10.1006/inco.1996.2612 · Cited by 864
Gambling in a rigged casino: The adversarial multi-armed bandit problem
Auer, P., Cesa-Bianchi, N., Freund, Y., & Schapire, R. E. (2002) · Proceedings of IEEE 36th Annual Foundations of Computer Science · doi:10.1109/sfcs.1995.492488 · Cited by 742
Self-citationAn analog of the minimax theorem for vector payoffs
Blackwell, D. (1956) · Pacific Journal of Mathematics · doi:10.2140/pjm.1956.6.1 · Cited by 740
Cesa-Bianchi, N., Freund, Y., Haussler, D., Helmbold, D. P., Schapire, R. E., & Warmuth, M. K. (1997) · Journal of the ACM · doi:10.1145/258128.258179 · Cited by 634
Self-citationCover, T. M. (1991) · Mathematical Finance · doi:10.1111/j.1467-9965.1991.tb00002.x · Cited by 587
Fast probabilistic algorithms for hamiltonian circuits and matchings
Angluin, D., & Valiant, L. G. (1979) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(79)90045-x · Cited by 570
Vovk, V. G. (1990) · Conference on Learning Theory · doi:10.5555/92571.92672 · Cited by 551
Fast Approximation Algorithms for Fractional Packing and Covering Problems
Plotkin, S. A., Shmoys, D. B., & Tardos, É. (1995) · Mathematics of Operations Research · doi:10.1287/moor.20.2.257 · Cited by 542
Optimal Stopping and the American Put
Jacka, S. D. (1991) · Mathematical Finance · doi:10.1111/j.1467-9965.1991.tb00007.x · Cited by 513
On‐Line Portfolio Selection Using Multiplicative Updates
Helmbold, D. P., Schapire, R. E., Singer, Y., & Warmuth, M. K. (1998) · Mathematical Finance · doi:10.1111/1467-9965.00058 · Cited by 387
Self-citationGame 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
Self-citationUniversal prediction of individual sequences
Feder, M., Merhav, N., & Gutman, M. (1992) · IEEE Transactions on Information Theory · doi:10.1109/18.144706 · Cited by 373
Universal portfolios with side information
Cover, T. M., & Ordentlich, E. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.485708 · Cited by 347
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
Consistency and cautious fictitious play
Fudenberg, D., & Levine, D. K. (1995) · Journal of Economic Dynamics and Control · doi:10.1016/0165-1889(94)00819-4 · Cited by 286
A Game of Prediction with Expert Advice
Vovk, V (1998) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1556 · Cited by 281
Additive versus exponentiated gradient updates for linear prediction
Kivinen, J., & Warmuth, M. K. (1995) · Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95 · doi:10.1145/225058.225121 · Cited by 223
Foster, D. (1998) · Biometrika · doi:10.1093/biomet/85.2.379 · Cited by 204
Randomized Rounding without Solving the Linear Program
Young, N. E. (1995) · Cited by 183
Coding theorems for individual sequences
Ziv, J. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055911 · Cited by 180
Cesa‐Bianchi, N., Freund, Y., Helmbold, D. P., Haussler, D. H., Schapire, R. E., & Warmuth, M. K. (1993) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/167088.167198 · Cited by 143
Self-citationA sublinear-time randomized approximation algorithm for matrix games
Grigoriadis, M. D., & Khachiyan, L. G. (1995) · Operations Research Letters · doi:10.1016/0167-6377(95)00032-0 · Cited by 128
A game of prediction with expert advice
Vovk, V. (1995) · Annual Conference on Computational Learning Theory (COLT) · doi:10.1145/225298.225304 · Cited by 88
A Randomization Rule for Selecting Forecasts
Foster, D. P., & Vohra, R. (1993) · Operations Research · doi:10.1287/opre.41.4.704 · Cited by 58
Cited by
Prediction, Learning, and Games
Cesa-Bianchi, N., & Lugosi, G. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546921 · Cited by 3,162
Boosting the margin: a new explanation for the effectiveness of voting methods
Bartlett, P., Freund, Y., Lee, W. S., & Schapire, R. E. (1998) · The Annals of Statistics · doi:10.1214/aos/1024691352 · Cited by 2,306
Self-citation(2002) · doi:10.1137/s0097539701398375 · Cited by 2,275
The Boosting Approach to Machine Learning: An Overview
Schapire, R. E. (2003) · Lecture Notes in Statistics · doi:10.1007/978-0-387-21579-2_9 · Cited by 2,003
Self-citation(2003) · Cited by 1,733
Metadata
- Authors
- Freund, Y., & Schapire, R. E.
- Venue
- Games and Economic Behavior
- Publisher
- Elsevier BV
- Published
- 1999-10
- Volume
- 29
- Issue
- 1-2
- Pages
- 79-103
- ISSN
- 0899-8256 (ISSN-L)
- OpenAlex
- W2106887613
- Cited by
- 515
- References
- 34
- FWCI
- 12.32
- Type
- journal article
- Language
- en
- Open access
- closed
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.