The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Regret in the On-Line Decision Problem
Open accessAbstract
At each point in time a decision maker must make a decision. The payoff in a period from the decision made depends on the decision as well as on the state of the world that obtains at that time. The difficulty is that the decision must be made in advance of any knowledge, even probabilistic, about which state of the world will obtain. A range of problems from a variety of disciplines can be framed in this way. In this paper we survey the main results obtained, as well as some of their applications. Journal of Economic Literature Classification Numbers: C70, C73.
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
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
(2015) · Adversarial Risk Analysis · doi:10.1201/b18653-3 · Cited by 3,632
Approximation Algorithms for NP-Hard Problems
(1997) · ACM SIGACT News · doi:10.1145/261342.571216 · Cited by 3,103
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
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
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
An 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
Cover, T. M. (1991) · Mathematical Finance · doi:10.1111/j.1467-9965.1991.tb00002.x · Cited by 587
Vovk, V. G. (1990) · Conference on Learning Theory · doi:10.5555/92571.92672 · Cited by 551
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
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
Self-citationConsistency 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
Foster, D. (1998) · Biometrika · doi:10.1093/biomet/85.2.379 · Cited by 204
Self-citation2009 50th Annual IEEE Symposium on Foundations of Computer Science
(2009) · doi:10.1109/focs16189.2009 · Cited by 195
Conditional Universal Consistency
Drew Fudenberg, B., & Levine, D. K. (1999) · Games and Economic Behavior · doi:10.1006/game.1998.0705 · Cited by 171
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
Tight worst-case loss bounds for predicting with expert advice
Haussler, D. H., Kivinen, J., & Warmuth, M. K. (1995) · Lecture notes in computer science · doi:10.1007/3-540-59119-2_169 · Cited by 99
Learning probabilistic prediction functions
Santis, A. D., Markowsky, G., & Wegman, M. N. (1988) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1988.21929 · Cited by 95
Fudenberg, D., & Levine, D. K. (1999) · Games and Economic Behavior · doi:10.1006/game.1999.0726 · Cited by 62
A Randomization Rule for Selecting Forecasts
Foster, D. P., & Vohra, R. (1993) · Operations Research · doi:10.1287/opre.41.4.704 · Cited by 58
Self-citationOn repeated games with incomplete information played by non-Bayesian players
Megiddo, N. (1980) · International Journal of Game Theory · doi:10.1007/bf01781370 · Cited by 53
Baños, A. (1968) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177698023 · Cited by 52
Proceedings of the Second European Conference on Computational Learning Theory
Vitanyi, P. M. B. (1995) · Cited by 43
Using Experts for Predicting Continuous OutcomesPreprint
Kivinen, J., & Warmuth, M. K. (1994) · RePEc: Research Papers in Economics · Cited by 22
Approximate methods for sequential decision making using expert advice
Chung, T. H. (1994) · Annual Conference on Computational Learning Theory (COLT) · doi:10.1145/180139.181097 · Cited by 21
Cited by
Prediction, Learning, and Games
Cesa-Bianchi, N., & Lugosi, G. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546921 · Cited by 3,162
(2002) · doi:10.1137/s0097539701398375 · Cited by 2,275
Multiagent systems: algorithmic, game-theoretic, and logical foundations
(2009) · Choice Reviews Online · doi:10.5860/choice.46-5662 · Cited by 1,756
(2003) · Cited by 1,733
Foundations of Machine Learning
Mohri, M., Rostamizadeh, A., & Talwalkar, A. (2018) · doi:10.7551/mitpress/10290.001.0001 · Cited by 1,122
Metadata
- Authors
- Foster, D. P., & Vohra, R.
- Venue
- Games and Economic Behavior
- Publisher
- Elsevier BV
- Published
- 1999-10
- Volume
- 29
- Issue
- 1-2
- Pages
- 7-35
- ISSN
- 0899-8256 (ISSN-L)
- OpenAlex
- W2135730283
- Cited by
- 302
- References
- 27
- FWCI
- 12.32
- Type
- journal article
- Language
- en
- Open access
- hybrid
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.