Glenn Shafer
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Glenn Shafer has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Vladimir Vovk
Vladimir Vovk is Professor, Department of Computer Science, Royal Holloway, University of London, Egham, Surrey, UK
27 shared publications - Akimichi Takemura
Shiga University
5 shared publications - Ilia Nouretdinov
University of London
1 shared publication - Laurent Mazliak
Sorbonne Université LPSM
1 shared publication - Peter R. Gillett
Rutgers Business School, Newark and New Brunswick, Rutgers, The State University of New Jersey
1 shared publication - Richard B. Scherl
Monmouth University
1 shared publication
Latest Publications
- Open Access
- 13 May 2025
- Published by Cambridge University Press (CUP) in Judgment and Decision Making
- Vol. 20, e26
The martingale index: A measure of self-deception in betting and finance
People who repeatedly risk money, whether they be traders for financial institutions, corporate executives, day traders, or sports bettors, sometimes appear to do better than chance only because the risk of large losses is hidden or overlooked. As students of casino gambling know, one way to obscure the risk of large losses is to bet more when you are losing and less when you are winning. In 19th century casinos, betting strategies that did this were called martingales. Following such strategies, whether deliberately or unwittingly, was called martingaling. Traders in financial instruments often martingale; in fact, they are martingaling whenever they respond to a margin call. A businessperson who doubles down on an apparently losing investment is martingaling. Opinionated sports bettors easily fall into martingaling. The martingale index, defined in this paper, measures the portion of the apparent success of a betting, trading, or investment strategy that can be attributed to martingaling. We calculate the martingale index for some popular casino strategies and also for some strategies that model random trading in S&P 500 futures and in stocks. And we discuss how educating the public about the martingale index might help both businesses and individuals avoid the temptations of martingaling.
- 13 May 2025
- Published by Cambridge University Press (CUP) in Judgment and Decision Making
- Vol. 20, e26
Open AccessThe martingale index: A measure of self-deception in betting and finance
People who repeatedly risk money, whether they be traders for financial institutions, corporate executives, day traders, or sports bettors, sometimes appear to do better than chance only because the risk of large losses is hidden or overlooked. As students of casino gambling know, one way to obscure the risk of large losses is to bet more when you are losing and less when you are winning. In 19th century casinos, betting strategies that did this were called martingales. Following such strategies, whether deliberately or unwittingly, was called martingaling. Traders in financial instruments often martingale; in fact, they are martingaling whenever they respond to a margin call. A businessperson who doubles down on an apparently losing investment is martingaling. Opinionated sports bettors easily fall into martingaling. The martingale index, defined in this paper, measures the portion of the apparent success of a betting, trading, or investment strategy that can be attributed to martingaling. We calculate the martingale index for some popular casino strategies and also for some strategies that model random trading in S&P 500 futures and in stocks. And we discuss how educating the public about the martingale index might help both businesses and individuals avoid the temptations of martingaling.
- Open Access
The origins and legacy of Kolmogorov's Grundbegriffe
April 25, 2003, marked the 100th anniversary of the birth of Andrei Nikolaevich Kolmogorov, the twentieth century's foremost contributor to the mathematical and philosophical foundations of probability. The year 2003 was also the 70th anniversary of the publication of Kolmogorov's Grundbegriffe der Wahrscheinlichkeitsrechnung. Kolmogorov's Grundbegriffe put probability's modern mathematical formalism in place. It also provided a philosophy of probability - an explanation of how the formalism can be connected to the world of experience. In this article, we examine the sources of these two aspects of the Grundbegriffe - the work of the earlier scholars whose ideas Kolmogorov synthesized.
Open AccessThe origins and legacy of Kolmogorov's Grundbegriffe
April 25, 2003, marked the 100th anniversary of the birth of Andrei Nikolaevich Kolmogorov, the twentieth century's foremost contributor to the mathematical and philosophical foundations of probability. The year 2003 was also the 70th anniversary of the publication of Kolmogorov's Grundbegriffe der Wahrscheinlichkeitsrechnung. Kolmogorov's Grundbegriffe put probability's modern mathematical formalism in place. It also provided a philosophy of probability - an explanation of how the formalism can be connected to the world of experience. In this article, we examine the sources of these two aspects of the Grundbegriffe - the work of the earlier scholars whose ideas Kolmogorov synthesized.
- 17 November 2011
- Published by Springer Nature in Journal of Theoretical Probability
- Vol. 25 (1) , 1-24
Lévy’s Zero–One Law in Game-Theoretic Probability
- 17 November 2011
- Published by Springer Nature in Journal of Theoretical Probability
- Vol. 25 (1) , 1-24
Lévy’s Zero–One Law in Game-Theoretic Probability
- Open Access
Emile Borel's difficult days in 1941
The German forces occupying Paris arrested Emile Borel and three other members of the Acad\'emie des Sciences in October 1941 and released them about five weeks later. Why? We examine some relevant German and French archives and other sources and propose some hypotheses. In the process, we review how the Occupation was structured and how it dealt with French higher education and some French mathematicians.
Open AccessEmile Borel's difficult days in 1941
The German forces occupying Paris arrested Emile Borel and three other members of the Acad\'emie des Sciences in October 1941 and released them about five weeks later. Why? We examine some relevant German and French archives and other sources and propose some hypotheses. In the process, we review how the Occupation was structured and how it dealt with French higher education and some French mathematicians.
- 11 November 2009
- Published by Springer Nature in Annals of the Institute of Statistical Mathematics
- Vol. 63 (5) , 873-885
The generality of the zero-one laws
- 11 November 2009
- Published by Springer Nature in Annals of the Institute of Statistical Mathematics
- Vol. 63 (5) , 873-885
The generality of the zero-one laws
- Open Access
The generality of the zero-one laws
We prove game-theoretic generalizations of some well known zero-one laws. Our proofs make the martingales behind the laws explicit, and our results illustrate how martingale arguments can have implications going beyond measure-theoretic probability.
Open AccessThe generality of the zero-one laws
We prove game-theoretic generalizations of some well known zero-one laws. Our proofs make the martingales behind the laws explicit, and our results illustrate how martingale arguments can have implications going beyond measure-theoretic probability.
- Open Access
A tutorial on conformal prediction
Conformal prediction uses past experience to determine precise levels of confidence in new predictions. Given an error probability $\epsilon$, together with a method that makes a prediction $\hat{y}$ of a label $y$, it produces a set of labels, typically containing $\hat{y}$, that also contains $y$ with probability $1-\epsilon$. Conformal prediction can be applied to any method for producing $\hat{y}$: a nearest-neighbor method, a support-vector machine, ridge regression, etc. Conformal prediction is designed for an on-line setting in which labels are predicted successively, each one being revealed before the next is predicted. The most novel and valuable feature of conformal prediction is that if the successive examples are sampled independently from the same distribution, then the successive predictions will be right $1-\epsilon$ of the time, even though they are based on an accumulating dataset rather than on independent datasets. In addition to the model under which successive examples are sampled independently, other on-line compression models can also use conformal prediction. The widely used Gaussian linear model is one of these. This tutorial presents a self-contained account of the theory of conformal prediction and works through several numerical examples. A more comprehensive treatment of the topic is provided in "Algorithmic Learning in a Random World", by Vladimir Vovk, Alex Gammerman, and Glenn Shafer (Springer, 2005).Open AccessA tutorial on conformal prediction
Conformal prediction uses past experience to determine precise levels of confidence in new predictions. Given an error probability $\epsilon$, together with a method that makes a prediction $\hat{y}$ of a label $y$, it produces a set of labels, typically containing $\hat{y}$, that also contains $y$ with probability $1-\epsilon$. Conformal prediction can be applied to any method for producing $\hat{y}$: a nearest-neighbor method, a support-vector machine, ridge regression, etc. Conformal prediction is designed for an on-line setting in which labels are predicted successively, each one being revealed before the next is predicted. The most novel and valuable feature of conformal prediction is that if the successive examples are sampled independently from the same distribution, then the successive predictions will be right $1-\epsilon$ of the time, even though they are based on an accumulating dataset rather than on independent datasets. In addition to the model under which successive examples are sampled independently, other on-line compression models can also use conformal prediction. The widely used Gaussian linear model is one of these. This tutorial presents a self-contained account of the theory of conformal prediction and works through several numerical examples. A more comprehensive treatment of the topic is provided in "Algorithmic Learning in a Random World", by Vladimir Vovk, Alex Gammerman, and Glenn Shafer (Springer, 2005). - 25 September 2006
- Published by Elsevier in International Journal of Approximate Reasoning
- Vol. 44 (3) , 281-300
A probabilistic logic based on the acceptability of gambles
- 25 September 2006
- Published by Elsevier in International Journal of Approximate Reasoning
- Vol. 44 (3) , 281-300
A probabilistic logic based on the acceptability of gambles
- 1 November 2005
- Published by Oxford University Press (OUP) in Journal of the Royal Statistical Society Series B: Statistical Methodology
- Vol. 67 (5) , 747-763
Good Randomized Sequential Probability Forecasting is Always Possible
Summary: Building on the game theoretic framework for probability, we show that it is possible, using randomization, to make sequential probability forecasts that will pass any given battery of statistical tests. This result, an easy consequence of von Neumann's minimax theorem, simplifies and generalizes work by earlier researchers.
- 1 November 2005
- Published by Oxford University Press (OUP) in Journal of the Royal Statistical Society Series B: Statistical Methodology
- Vol. 67 (5) , 747-763
Good Randomized Sequential Probability Forecasting is Always Possible
Summary: Building on the game theoretic framework for probability, we show that it is possible, using randomization, to make sequential probability forecasts that will pass any given battery of statistical tests. This result, an easy consequence of von Neumann's minimax theorem, simplifies and generalizes work by earlier researchers.
- Open Access
Defensive forecasting for linear protocols
We consider a general class of forecasting protocols, called "linear protocols", and discuss several important special cases, including multi-class forecasting. Forecasting is formalized as a game between three players: Reality, whose role is to generate observations; Forecaster, whose goal is to predict the observations; and Skeptic, who tries to make money on any lack of agreement between Forecaster's predictions and the actual observations. Our main mathematical result is that for any continuous strategy for Skeptic in a linear protocol there exists a strategy for Forecaster that does not allow Skeptic's capital to grow. This result is a meta-theorem that allows one to transform any continuous law of probability in a linear protocol into a forecasting strategy whose predictions are guaranteed to satisfy this law. We apply this meta-theorem to a weak law of large numbers in Hilbert spaces to obtain a version of the K29 prediction algorithm for linear protocols and show that this version also satisfies the attractive properties of proper calibration and resolution under a suitable choice of its kernel parameter, with no assumptions about the way the data is generated.
Open AccessDefensive forecasting for linear protocols
We consider a general class of forecasting protocols, called "linear protocols", and discuss several important special cases, including multi-class forecasting. Forecasting is formalized as a game between three players: Reality, whose role is to generate observations; Forecaster, whose goal is to predict the observations; and Skeptic, who tries to make money on any lack of agreement between Forecaster's predictions and the actual observations. Our main mathematical result is that for any continuous strategy for Skeptic in a linear protocol there exists a strategy for Forecaster that does not allow Skeptic's capital to grow. This result is a meta-theorem that allows one to transform any continuous law of probability in a linear protocol into a forecasting strategy whose predictions are guaranteed to satisfy this law. We apply this meta-theorem to a weak law of large numbers in Hilbert spaces to obtain a version of the K29 prediction algorithm for linear protocols and show that this version also satisfies the attractive properties of proper calibration and resolution under a suitable choice of its kernel parameter, with no assumptions about the way the data is generated.