LOOKING FOR A GOOD TIME TO BET

Save this PDF as:

Size: px
Start display at page:

Transcription

1 LOOKING FOR A GOOD TIME TO BET LAURENT SERLET Abstract. Suppose that the cards of a well shuffled deck of cards are turned up one after another. At any time-but once only- you may bet that the next card to be turned up will be black. If it is correct you win 1\$, if not you lose 1\$. If you never bet you lose 1\$. Is there a good strategy to play that game and make it profitable? Discussing this will be a good opportunity to see an example of a random walk and introduce the notion of a martingale. 1. Let s play a game! To play this game one needs an ordinary deck of cards, for instance with N = 5 cards. In fact we will only look at the colours of the cards, black for half of them and red for the other half. First the cards are properly shuffled. Then the cards are turned up one after another in front of you. At any time-but once only- you may bet that the next card to be turned up will be black. If it is correct you win 1\$, if not you lose 1\$. If you never bet you lose 1\$. Naturally, the question is : is there a way to make money playing this game? Of course the gain is random so making money must be understood as choosing a strategy which ensures that the mean gain is strictly positive, that is : probability to win 1\$ minus probability to lose 1\$ is strictly positive. If it is the case, the most famous theorem of probability theory, called Kolmogorov s law of large numbers, implies that if you play the game a large number of times, the average gain per play will be close to this mean, hence strictly positive. Let us examine two naive strategies. First betting at a fixed time, for instance at the very beginning, before the first card is revealed that will at least save time. In that case black or red have the same probability of occuring so the average gain is 0. This is also true for betting at any other fixed time in particular on the last card. Note that in that case the colour of this last card is known for sure but it happens to be black only with probability 1/! However you also have the right to bet at a random time depending of the colours of the cards previously revealed. And there are random times such that the next card revealed has more chances to be black than red which implies a strictly positive (conditional mean gain. Typically it happens if there is a deficit of black cards among the cards Date: January 4,

2 LAURENT SERLET revealed up to that time. More precisely, suppose that, among the k first cards turned up (1 k N 1, there are b black ones and r red ones (k = b + r. Then, betting at this time, your mean gain will be : (1 r b N k. Indeed, in the specified situation, (N/ b black cards and (N/ r red ones are left to be drawn so the probability of a black card to be drawn is (N/ b ( (N/ b + (N/ r = 1 ( 1 + r b. N k Similarly, the probability of a red one is ( 1 (3 1 r b N k and (1 follows. We can see from this formula that the mean gain is proportional to the deficit of black cards and inversely proportional to the number of cards still to be drawn, so one could be tempted to wait for a large deficit of black cards or a low number of remaining cards. But the longer you wait the less probability there is that this situation will occur and remember that in the case of non-betting there is a 1\$ penalty. To go further we need to formalize the problem a little more. In view of formula (1, let us introduce, for 0 k N, the random variable S k defined as the number of red cards minus the number of black cards, among the k first cards drawn. In probability theory, (S k 0 k N is called an unbiased random walk on Z starting from 0 and conditioned on S N = 0. Many explicit computations can be performed on this object by combinatorial techniques as we will see in the next section. For the moment let us give a general formula for the mean gain generated by a strategy. Let us say that a strategy is associated with a random time τ if it consists in betting after τ cards have been revealed. Thus τ is a random variable taking its values in {0, 1,..., N 1} and we add the possibility that τ takes the value + to mean that the player never bets. We restrict our analysis to the strategies that we call admissible, in the sense that, for every k {0, 1,..., N 1}, the event τ = k only depends on the values S 1,..., S k. In other words, we assume that the player has no psychic power to anticipate the future. For instance the strategy of waiting for a deficit of q black cards drawn (q 1 is denoted by τ q given by τ q = min{k {1,..., N 1}, S k = q} with the convention τ q = + if S k < q for all k {0, 1,..., N}. In probabilistic terms τ q is the hitting time of q for the random walk (S k 0 k N. Here hitting time means first hitting time but one could possibly consider the strategy associated to the second, third,... hitting time.

3 LOOKING FOR A GOOD TIME TO BET 3 With the notation above, it follows from (1 that the mean gain of the admissible strategy associated to τ is : [ N 1 ] S k (4 MG(τ = E N k 1 {τ=k} P(τ = +. k=0 In this formula, we denote by 1 {τ=k} the variable equal to 1 if the event τ = k is realized and 0 if not ; P is our notation for probability and E is the associated expectation (mean. The problem we want to solve is to find the admissible strategies τ which maximize MG(τ given by (4 and determine if the maximum is strictly positive. Probability theory has the ideal tool to solve the problem completely as we will explain in Section 3. However this argument could seem rather abstract so we first perform the explicit computation with a natural candidate to be a good strategy. This strategy is simply τ 1 which consists in betting as soon as red cards have been turned up more often than black ones. This will be an opportunity to see the techniques needed to do such a computation and the difficulty to conclude this way. By contrast, it will hopefully convince the reader of the power of the abstract argument developed in Section 3.. Is the natural strategy profitable? We want to compute MG(τ 1 using (4. We first remark that on the event τ 1 = k, we have S k = 1 so the formula simplifies to 1 1 (5 MG(τ 1 = N k P(τ 1 = k P(τ 1 = +. k=0 We are left with computing the probabilities appearing in this formula which amounts to computing the law of τ 1. To state the results we need to introduce the usual binomial coefficients : ( n k = n! k! (n k! when n is a non-negative integer and k {0,..., n}; moreover, when these requirements are not satisfied, the binomial coefficient above is set equal to 0. We claim that (6 P(τ 1 = + = 1 and, for every k {1,..., N 1}, (7 P(τ 1 = k = 1 k ( k k+1 N ( +1 N N/ k N k 1 N/.

4 4 LAURENT SERLET The proof is given in Section 5. Substituting these values in (8 and putting N = n, we get : (8 MG(τ 1 = 1 ( n 1 i ( n i 1 i n i 1 (n i 1 (i + 1 n + 1. i=0 Remember that we want to determine if this expression is strictly positive. A priori it is not clear but computing the value for n = 1,, 3, we always find 0. In fact the value is 0 for every n 1. This will be a consequence of the arguments given later in this article, but very similar identities exist in the literature, see for instance [Go] Formula (1.34 attributed to Bruckman. This result is disappointing because the strategy associated to τ 1 which seemed rather sensible is not better than the strategy of betting on the first card. Both strategies are not profitable. However both are fair is the sense that the mean gain is 0. One could ask about the strategy associated to τ q for q > 1. The computations are rather similar but it is even harder to see the sign of MG(τ q. Because of the rather negative result of this experimental approach, we feel the need of a more abstract probabilistic tool to settle the problem. The next section is going to present the ad hoc concept. ( n n 3. Let s use a martingale! In the gambler vocabulary a martingale is a technique which enables one to win. In probability theory a martingale is simply a sequence of random variables which satisfy a certain property concerning the (conditional means. See [MS] for the historical aspects and, for instance, [Wi] or [Ne] for an account of the full theory. The paradox is that a martingale of probability theory can often be used to show that a gambler s martingale does not exist. In our setting a martingale (M k 0 k N is defined as a sequence of random variables such that, for every i {0,... N 1} and for every event B depending only on the values of S 1,..., S i, we have (9 E [M i 1 B ] = E [M i+1 1 B ]. In our problem, it happens that the sequence ( Sk (10 (M k 0 k N = N k 0 k N is a martingale. Let us justify this fact. Equation (9 amounts to showing that, for all integers s 1,..., s i, the mean of M i+1 = S i+1 /(N i 1 conditionally on S 1 = s 1,..., S i = s i is s i /(N i. But as seen in ( and (3, conditionally on S 1 = s 1,..., S i = s i, we have S i+1 = s i 1 with proba- ( bility s i N i and S i+1 = s i + 1 with probability 1 conditional mean of S i+1 is (s i 1 1 ( 1 + s i + (s i N i ( 1 s i N i so the ( 1 s i N (i + 1 = s i. N i N i

5 LOOKING FOR A GOOD TIME TO BET 5 Simply dividing by N (i + 1, we obtain the martingale property. From this property we deduce the following result. Theorem 1. The mean gain associated to an admissible strategy τ is (11 MG(τ = P(S N 1 = 1; τ = +. Proof. Let k {1,..., N 1}. If we iterate (9 for the martingale given in (10, letting i take the values k, k + 1,..., N and B = {τ = k}, we obtain that [ ] Sk E N k 1 {τ=k} = E [ ] S N 1 1 {τ=k}. Substituting this expression in (4, we get that the mean gain is [ 1 ] (1 MG(τ = E S N 1 1 {τ=k} P(τ = +. But N 1 k=0 k=0 1 {τ=k} = 1 1 {τ=+ } and it is clear by symmetry that E(S N 1 = 0. Substituting in (1, we obtain that (13 MG(τ = E [ (1 + S N 1 1 {τ=+ } ] and (11 is just another formulation. The proof is complete. Let us now discuss the consequences of this theorem. The most important is that the mean gain cannot be strictly positive. There is no way to make money with this game. Conversely any strategy associated with τ such that P(τ = + = 0 i.e. such that the player always bets at some time is fair. It also confirms that the strategy associated with τ 1 is fair because, for this strategy, the event τ 1 = + (no bet automatically implies S N 1 = 1. So this theorem shows no strategy can do better than the strategy of betting on the first card drawn. More sophisticated strategies like those associated to τ q for q > 1 can in fact be even worse since, as we will see in (14, the mean gain is strictly negative. Conversely it is astonishing that certain strategies which sound stupid are in fact fair and by consequence among the best ones. For instance, suppose that you bet at the first time when black cards have turned up q times more than red ones (q 1 or on the last card if this never happens. It does not seem to make sense but in fact this strategy is as clever as the best ones. In fact (11 shows that losing money is caused by non-betting even when you know for sure that the last card drawn will be black, which is effectively a stupid behaviour!

6 6 LAURENT SERLET 4. Further questions and remarks Some new questions arise if the problem is changed or extended. In particular what happens if the penalty for non-betting is cancelled? Of course profitable strategies arise. Starting again from (1, we obtain that the mean gain of an admissible strategy associated to τ is now MG(τ = E [ ] S N 1 1 {τ<+ } = P(S N 1 = 1, τ < + P(S N 1 = 1, τ < +. The strategy which maximizes this quantity is τ defined by τ = N 1 if S N 1 = 1 and + otherwise. This is the last minute strategy which consists in waiting for the last draw and in that case MG( τ = 1/. In that case too the best strategy is not a clever one. One can also imagine several generalizations of this game with bets on the suit, but note that the modelling will then require to consider a random walk in dimension bigger than 1, which certainly complicates the arguments. We end this article by giving a few additional results that the reader can treat as application exercises. (1 Show that ( N 1 N (14 MG(τ q = 1 N/ N/. +q 1 and, using the well known monotonicity properties of binomial coefficients, show that, for q > 1, the mean gain MG(τ q is strictly negative. ( Combine (14 with (4 to deduce a not so obvious combinatorial identity : for N even integer and q 1, N q k=q 1 k (N k ( k k+q k N k q = q N which is a generalization of [Go] Formula (1.34. (3 With the notation N = n, show that MG(τ q = q (n! n (n + q! (n q!. N + q Check that this quantity reaches a maximum for q 0 being the least integer q such that q (q + 1 > n. In particular when n is large, q 0 n/ and MG(τ q0 is, up to multiplicative constants, of order n 1/ which is much lower than the last minute strategy. 5. Appendix : computation of a law This section is devoted to the computation of the law of τ 1 that we announced in (6 and (7. Since it requires no more effort, we will compute the law of τ q for q 1. It uses well known combinatorial techniques on the

7 LOOKING FOR A GOOD TIME TO BET 7 set of trajectories of random walks, the main argument being the so-called reflection principle. Chapter III of Feller s book ([Fe] is a nice and classical reference on the techniques we use in the present section. Note that τ q takes in fact its values in {q,..., N q} {+ } and we will moreover see that τ q may only take integer values having the same parity as q. Let us denote by S(N, a, b the set of all finite sequences of integers (s k 0 k N of length N + 1 with increments +1 or 1, starting from s 0 = a and arriving at s N = b. Such a sequence is easily represented by a graph in the plane. A sequence belonging to S(N, a, b is entirely determined by specifying which increments are +1 and the number of those increments equal to +1 is exactly (N + b a/ in order to meet the requirements on s 0 and s N. Hence the cardinal (number of elements of S(N, a, b is ( N (15 #[S(N, a, b] = N+b a. The random sequence (S k 0 k N takes its values in S(N, 0, 0 and moreover, the distribution of this random sequence is the uniform probability on S(N, 0, 0. As a consequence computing the desired probabilities will consist essentially in determining the cardinal of the specified events. For instance let us start with P(τ q = + and for convenience, we prefer to compute the probability P(τ q < + of the complementary event. It is the cardinal of the subset of S(N, 0, 0 formed by the sequences that reach q, divided by the cardinal of S(N, 0, 0. But there is a one-to-one correspondence between sequences in S(N, 0, 0 that reach q and sequences in S(N, 0, q. The correspondence consists in applying a reflection with respect to level q from the hitting time of q up to time N. Therefore this argument is called the reflection principle. By (15, it follows that (16 P(τ q < + = #[S(N, 0, q] #[S(N, 0, 0] = N ( q N N/ hence (6. Now we pass to P(τ q = k. Decomposing into the part before time k and the part after time k, we get (17 P(τ q = k = #[S(k, 0, q; < q] #[S(N k, q, 0] #[S(N, 0, 0] where S(k, 0, q; < q is the subset of S(k, 0, q consisting of sequences that reach level q for the first time at time k. This set has same cardinal as the set of sequences in S(k 1, 0, q 1 which do not reach level q. Another application of the reflection principle shows that the latter set has same cardinal as #[S(k 1, 0, q 1] #[S(k 1, 0, q + 1] = q ( k k+q. k

8 8 LAURENT SERLET Substituting in (17 and expressing the other terms using (15, we get the final expression of the law of τ q : (18 P(τ q = k = q k and (7 is a particular case. ( k k+q k N k q N/ REFERENCES Fe: Feller W. An introduction to probability theory and its applications, volume 1. Third edition. Wiley. Go: Gould H.W. Tables of combinatorial identities, unpublished manuscripts collected by J. Quaintance. Available on the web page : gould/ MS: Mazliak L., Shafer G. (editors. The splendors and miseries of martingales. Electronic Journal for History of Probability and Statistics 5 (1, june 009. Ne: Neveu J. Discrete-parameter martingales. Vol. 10 of North- Holland math. library. Elsevier (1975 Wi: Williams D. Probability with martingales. Cambridge University Press. (1991 Laurent Serlet. After studying at the École Normale Supérieure de Cachan, I obtained my Ph.D. at the University Paris 6 in Since 005, I am a professor at the University Blaise Pascal in Clermont-Ferrand. My research interests have been first measure-valued and path-valued processes; now I am mostly interested in perturbed random walks and reinforced processes. Clermont Université, Université Blaise Pascal, Laboratoire de Mathématiques (CNRS umr 660, Complexe scientifique des Cézeaux, BP 8006, AUBIÈRE, FRANCE address:

arxiv:1112.0829v1 [math.pr] 5 Dec 2011

How Not to Win a Million Dollars: A Counterexample to a Conjecture of L. Breiman Thomas P. Hayes arxiv:1112.0829v1 [math.pr] 5 Dec 2011 Abstract Consider a gambling game in which we are allowed to repeatedly

Wald s Identity. by Jeffery Hein. Dartmouth College, Math 100

Wald s Identity by Jeffery Hein Dartmouth College, Math 100 1. Introduction Given random variables X 1, X 2, X 3,... with common finite mean and a stopping rule τ which may depend upon the given sequence,

Goal Problems in Gambling and Game Theory. Bill Sudderth. School of Statistics University of Minnesota

Goal Problems in Gambling and Game Theory Bill Sudderth School of Statistics University of Minnesota 1 Three problems Maximizing the probability of reaching a goal. Maximizing the probability of reaching

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 13. Random Variables: Distribution and Expectation

CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 3 Random Variables: Distribution and Expectation Random Variables Question: The homeworks of 20 students are collected

Chapter 4 Lecture Notes

Chapter 4 Lecture Notes Random Variables October 27, 2015 1 Section 4.1 Random Variables A random variable is typically a real-valued function defined on the sample space of some experiment. For instance,

Decision Theory. 36.1 Rational prospecting

36 Decision Theory Decision theory is trivial, apart from computational details (just like playing chess!). You have a choice of various actions, a. The world may be in one of many states x; which one

6.042/18.062J Mathematics for Computer Science December 12, 2006 Tom Leighton and Ronitt Rubinfeld. Random Walks

6.042/8.062J Mathematics for Comuter Science December 2, 2006 Tom Leighton and Ronitt Rubinfeld Lecture Notes Random Walks Gambler s Ruin Today we re going to talk about one-dimensional random walks. In

\$2 4 40 + ( \$1) = 40

THE EXPECTED VALUE FOR THE SUM OF THE DRAWS In the game of Keno there are 80 balls, numbered 1 through 80. On each play, the casino chooses 20 balls at random without replacement. Suppose you bet on the

24. The Branch and Bound Method

24. The Branch and Bound Method It has serious practical consequences if it is known that a combinatorial problem is NP-complete. Then one can conclude according to the present state of science that no

Week 4: Gambler s ruin and bold play

Week 4: Gambler s ruin and bold play Random walk and Gambler s ruin. Imagine a walker moving along a line. At every unit of time, he makes a step left or right of exactly one of unit. So we can think that

9.2 Summation Notation

9. Summation Notation 66 9. Summation Notation In the previous section, we introduced sequences and now we shall present notation and theorems concerning the sum of terms of a sequence. We begin with a

Stochastic Inventory Control

Chapter 3 Stochastic Inventory Control 1 In this chapter, we consider in much greater details certain dynamic inventory control problems of the type already encountered in section 1.3. In addition to the

Game Theory and Poker

Game Theory and Poker Jason Swanson April, 2005 Abstract An extremely simplified version of poker is completely solved from a game theoretic standpoint. The actual properties of the optimal solution are

Economics 1011a: Intermediate Microeconomics

Lecture 12: More Uncertainty Economics 1011a: Intermediate Microeconomics Lecture 12: More on Uncertainty Thursday, October 23, 2008 Last class we introduced choice under uncertainty. Today we will explore

About the inverse football pool problem for 9 games 1

Seventh International Workshop on Optimal Codes and Related Topics September 6-1, 013, Albena, Bulgaria pp. 15-133 About the inverse football pool problem for 9 games 1 Emil Kolev Tsonka Baicheva Institute

2DI36 Statistics. 2DI36 Part II (Chapter 7 of MR)

2DI36 Statistics 2DI36 Part II (Chapter 7 of MR) What Have we Done so Far? Last time we introduced the concept of a dataset and seen how we can represent it in various ways But, how did this dataset came

Supplement to Call Centers with Delay Information: Models and Insights

Supplement to Call Centers with Delay Information: Models and Insights Oualid Jouini 1 Zeynep Akşin 2 Yves Dallery 1 1 Laboratoire Genie Industriel, Ecole Centrale Paris, Grande Voie des Vignes, 92290

Math/Stats 425 Introduction to Probability. 1. Uncertainty and the axioms of probability

Math/Stats 425 Introduction to Probability 1. Uncertainty and the axioms of probability Processes in the real world are random if outcomes cannot be predicted with certainty. Example: coin tossing, stock

Probability and Expected Value

Probability and Expected Value This handout provides an introduction to probability and expected value. Some of you may already be familiar with some of these topics. Probability and expected value are

Cycles in a Graph Whose Lengths Differ by One or Two

Cycles in a Graph Whose Lengths Differ by One or Two J. A. Bondy 1 and A. Vince 2 1 LABORATOIRE DE MATHÉMATIQUES DISCRÉTES UNIVERSITÉ CLAUDE-BERNARD LYON 1 69622 VILLEURBANNE, FRANCE 2 DEPARTMENT OF MATHEMATICS

Worksheet for Teaching Module Probability (Lesson 1)

Worksheet for Teaching Module Probability (Lesson 1) Topic: Basic Concepts and Definitions Equipment needed for each student 1 computer with internet connection Introduction In the regular lectures in

ROULETTE ODDS AND PROFITS. The Mathematics of Complex Bets. Cătălin Bărboianu

ROULETTE ODDS AND PROFITS The Mathematics of Complex Bets Cătălin Bărboianu 1 Cătălin Bărboianu PO Box 1 230 Craiova, Romania http://probability.infarom.ro INFAROM Publishing Pure and applied mathematics

SCRATCHING THE SURFACE OF PROBABILITY. Robert J. Russell, University of Paisley, UK

SCRATCHING THE SURFACE OF PROBABILITY Robert J. Russell, University of Paisley, UK Scratch cards are widely used to promote the interests of charities and commercial concerns. They provide a useful mechanism

CPC/CPA Hybrid Bidding in a Second Price Auction

CPC/CPA Hybrid Bidding in a Second Price Auction Benjamin Edelman Hoan Soo Lee Working Paper 09-074 Copyright 2008 by Benjamin Edelman and Hoan Soo Lee Working papers are in draft form. This working paper

The degree, size and chromatic index of a uniform hypergraph

The degree, size and chromatic index of a uniform hypergraph Noga Alon Jeong Han Kim Abstract Let H be a k-uniform hypergraph in which no two edges share more than t common vertices, and let D denote the

The Math. P (x) = 5! = 1 2 3 4 5 = 120.

The Math Suppose there are n experiments, and the probability that someone gets the right answer on any given experiment is p. So in the first example above, n = 5 and p = 0.2. Let X be the number of correct

1. (First passage/hitting times/gambler s ruin problem:) Suppose that X has a discrete state space and let i be a fixed state. Let

Copyright c 2009 by Karl Sigman 1 Stopping Times 1.1 Stopping Times: Definition Given a stochastic process X = {X n : n 0}, a random time τ is a discrete random variable on the same probability space as

Bonus Maths 2: Variable Bet Sizing in the Simplest Possible Game of Poker (JB)

Bonus Maths 2: Variable Bet Sizing in the Simplest Possible Game of Poker (JB) I recently decided to read Part Three of The Mathematics of Poker (TMOP) more carefully than I did the first time around.

How to build a probability-free casino

How to build a probability-free casino Adam Chalcraft CCR La Jolla dachalc@ccrwest.org Chris Freiling Cal State San Bernardino cfreilin@csusb.edu Randall Dougherty CCR La Jolla rdough@ccrwest.org Jason

11 Ideals. 11.1 Revisiting Z

11 Ideals The presentation here is somewhat different than the text. In particular, the sections do not match up. We have seen issues with the failure of unique factorization already, e.g., Z[ 5] = O Q(

IEOR 6711: Stochastic Models I Fall 2012, Professor Whitt, Tuesday, September 11 Normal Approximations and the Central Limit Theorem

IEOR 6711: Stochastic Models I Fall 2012, Professor Whitt, Tuesday, September 11 Normal Approximations and the Central Limit Theorem Time on my hands: Coin tosses. Problem Formulation: Suppose that I have

THE WHE TO PLAY. Teacher s Guide Getting Started. Shereen Khan & Fayad Ali Trinidad and Tobago

Teacher s Guide Getting Started Shereen Khan & Fayad Ali Trinidad and Tobago Purpose In this two-day lesson, students develop different strategies to play a game in order to win. In particular, they will

In the situations that we will encounter, we may generally calculate the probability of an event

What does it mean for something to be random? An event is called random if the process which produces the outcome is sufficiently complicated that we are unable to predict the precise result and are instead

CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.

CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,

1 Short Introduction to Time Series

ECONOMICS 7344, Spring 202 Bent E. Sørensen January 24, 202 Short Introduction to Time Series A time series is a collection of stochastic variables x,.., x t,.., x T indexed by an integer value t. The

The Kelly Betting System for Favorable Games.

The Kelly Betting System for Favorable Games. Thomas Ferguson, Statistics Department, UCLA A Simple Example. Suppose that each day you are offered a gamble with probability 2/3 of winning and probability

Lecture 13: Martingales

Lecture 13: Martingales 1. Definition of a Martingale 1.1 Filtrations 1.2 Definition of a martingale and its basic properties 1.3 Sums of independent random variables and related models 1.4 Products of

The epistemic structure of de Finetti s betting problem

The epistemic structure of de Finetti s betting problem Tommaso Flaminio 1 and Hykel Hosni 2 1 IIIA - CSIC Campus de la Univ. Autònoma de Barcelona s/n 08193 Bellaterra, Spain. Email: tommaso@iiia.csic.es

Prediction Markets, Fair Games and Martingales

Chapter 3 Prediction Markets, Fair Games and Martingales Prediction markets...... are speculative markets created for the purpose of making predictions. The current market prices can then be interpreted

Sums of Independent Random Variables

Chapter 7 Sums of Independent Random Variables 7.1 Sums of Discrete Random Variables In this chapter we turn to the important question of determining the distribution of a sum of independent random variables

A simple criterion on degree sequences of graphs

Discrete Applied Mathematics 156 (2008) 3513 3517 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Note A simple criterion on degree

Adaptive Online Gradient Descent Peter L Bartlett Division of Computer Science Department of Statistics UC Berkeley Berkeley, CA 94709 bartlett@csberkeleyedu Elad Hazan IBM Almaden Research Center 650

Mathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson

Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement

Gambling Systems and Multiplication-Invariant Measures

Gambling Systems and Multiplication-Invariant Measures by Jeffrey S. Rosenthal* and Peter O. Schwartz** (May 28, 997.. Introduction. This short paper describes a surprising connection between two previously

1 Portfolio mean and variance

Copyright c 2005 by Karl Sigman Portfolio mean and variance Here we study the performance of a one-period investment X 0 > 0 (dollars) shared among several different assets. Our criterion for measuring

Chapter 21: The Discounted Utility Model

Chapter 21: The Discounted Utility Model 21.1: Introduction This is an important chapter in that it introduces, and explores the implications of, an empirically relevant utility function representing intertemporal

ECE302 Spring 2006 HW3 Solutions February 2, 2006 1

ECE302 Spring 2006 HW3 Solutions February 2, 2006 1 Solutions to HW3 Note: Most of these solutions were generated by R. D. Yates and D. J. Goodman, the authors of our textbook. I have added comments in

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory

Betting rules and information theory

Betting rules and information theory Giulio Bottazzi LEM and CAFED Scuola Superiore Sant Anna September, 2013 Outline Simple betting in favorable games The Central Limit Theorem Optimal rules The Game

Lesson 4 Annuities: The Mathematics of Regular Payments

Lesson 4 Annuities: The Mathematics of Regular Payments Introduction An annuity is a sequence of equal, periodic payments where each payment receives compound interest. One example of an annuity is a Christmas

THE CENTRAL LIMIT THEOREM TORONTO

THE CENTRAL LIMIT THEOREM DANIEL RÜDT UNIVERSITY OF TORONTO MARCH, 2010 Contents 1 Introduction 1 2 Mathematical Background 3 3 The Central Limit Theorem 4 4 Examples 4 4.1 Roulette......................................

Ideal Class Group and Units

Chapter 4 Ideal Class Group and Units We are now interested in understanding two aspects of ring of integers of number fields: how principal they are (that is, what is the proportion of principal ideals

Factoring Patterns in the Gaussian Plane

Factoring Patterns in the Gaussian Plane Steve Phelps Introduction This paper describes discoveries made at the Park City Mathematics Institute, 00, as well as some proofs. Before the summer I understood

Cryptography and Network Security Department of Computer Science and Engineering Indian Institute of Technology Kharagpur

Cryptography and Network Security Department of Computer Science and Engineering Indian Institute of Technology Kharagpur Module No. # 01 Lecture No. # 05 Classic Cryptosystems (Refer Slide Time: 00:42)

Basic Probability. Probability: The part of Mathematics devoted to quantify uncertainty

AMS 5 PROBABILITY Basic Probability Probability: The part of Mathematics devoted to quantify uncertainty Frequency Theory Bayesian Theory Game: Playing Backgammon. The chance of getting (6,6) is 1/36.

Phantom bonuses. November 22, 2004

Phantom bonuses November 22, 2004 1 Introduction The game is defined by a list of payouts u 1, u 2,..., u l, and a list of probabilities p 1, p 2,..., p l, p i = 1. We allow u i to be rational numbers,

CORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREER-READY FOUNDATIONS IN ALGEBRA

We Can Early Learning Curriculum PreK Grades 8 12 INSIDE ALGEBRA, GRADES 8 12 CORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREER-READY FOUNDATIONS IN ALGEBRA April 2016 www.voyagersopris.com Mathematical

Computing divisors and common multiples of quasi-linear ordinary differential equations

Computing divisors and common multiples of quasi-linear ordinary differential equations Dima Grigoriev CNRS, Mathématiques, Université de Lille Villeneuve d Ascq, 59655, France Dmitry.Grigoryev@math.univ-lille1.fr

WHERE DOES THE 10% CONDITION COME FROM?

1 WHERE DOES THE 10% CONDITION COME FROM? The text has mentioned The 10% Condition (at least) twice so far: p. 407 Bernoulli trials must be independent. If that assumption is violated, it is still okay

Ch. 13.3: More about Probability Complementary Probabilities Given any event, E, of some sample space, U, of a random experiment, we can always talk about the complement, E, of that event: this is the

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES Contents 1. Random variables and measurable functions 2. Cumulative distribution functions 3. Discrete

36 Odds, Expected Value, and Conditional Probability

36 Odds, Expected Value, and Conditional Probability What s the difference between probabilities and odds? To answer this question, let s consider a game that involves rolling a die. If one gets the face

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column

1 Introduction to Option Pricing

ESTM 60202: Financial Mathematics Alex Himonas 03 Lecture Notes 1 October 7, 2009 1 Introduction to Option Pricing We begin by defining the needed finance terms. Stock is a certificate of ownership of

FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z

FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization

Probability and Statistics

CHAPTER 2: RANDOM VARIABLES AND ASSOCIATED FUNCTIONS 2b - 0 Probability and Statistics Kristel Van Steen, PhD 2 Montefiore Institute - Systems and Modeling GIGA - Bioinformatics ULg kristel.vansteen@ulg.ac.be

The Relation between Two Present Value Formulae

James Ciecka, Gary Skoog, and Gerald Martin. 009. The Relation between Two Present Value Formulae. Journal of Legal Economics 15(): pp. 61-74. The Relation between Two Present Value Formulae James E. Ciecka,

A natural introduction to probability theory. Ronald Meester

A natural introduction to probability theory Ronald Meester ii Contents Preface v 1 Experiments 1 1.1 Definitions and examples........................ 1 1.2 Counting and combinatorics......................

Introductory Probability. MATH 107: Finite Mathematics University of Louisville. March 5, 2014

Introductory Probability MATH 07: Finite Mathematics University of Louisville March 5, 204 What is probability? Counting and probability 2 / 3 Probability in our daily lives We see chances, odds, and probabilities

How to Gamble If You Must

How to Gamble If You Must Kyle Siegrist Department of Mathematical Sciences University of Alabama in Huntsville Abstract In red and black, a player bets, at even stakes, on a sequence of independent games

BINOMIAL OPTIONS PRICING MODEL. Mark Ioffe. Abstract

BINOMIAL OPTIONS PRICING MODEL Mark Ioffe Abstract Binomial option pricing model is a widespread numerical method of calculating price of American options. In terms of applied mathematics this is simple

Moral Hazard. Itay Goldstein. Wharton School, University of Pennsylvania

Moral Hazard Itay Goldstein Wharton School, University of Pennsylvania 1 Principal-Agent Problem Basic problem in corporate finance: separation of ownership and control: o The owners of the firm are typically

You can place bets on the Roulette table until the dealer announces, No more bets.

Roulette Roulette is one of the oldest and most famous casino games. Every Roulette table has its own set of distinctive chips that can only be used at that particular table. These chips are purchased

R Simulations: Monty Hall problem

R Simulations: Monty Hall problem Monte Carlo Simulations Monty Hall Problem Statistical Analysis Simulation in R Exercise 1: A Gift Giving Puzzle Exercise 2: Gambling Problem R Simulations: Monty Hall

Understanding Basic Calculus

Understanding Basic Calculus S.K. Chung Dedicated to all the people who have helped me in my life. i Preface This book is a revised and expanded version of the lecture notes for Basic Calculus and other

6 EXTENDING ALGEBRA. 6.0 Introduction. 6.1 The cubic equation. Objectives

6 EXTENDING ALGEBRA Chapter 6 Extending Algebra Objectives After studying this chapter you should understand techniques whereby equations of cubic degree and higher can be solved; be able to factorise

Probabilities and Random Variables

Probabilities and Random Variables This is an elementary overview of the basic concepts of probability theory. 1 The Probability Space The purpose of probability theory is to model random experiments so

Pascal is here expressing a kind of skepticism about the ability of human reason to deliver an answer to this question.

Pascal s wager So far we have discussed a number of arguments for or against the existence of God. In the reading for today, Pascal asks not Does God exist? but Should we believe in God? What is distinctive

International Journal of Information Technology, Modeling and Computing (IJITMC) Vol.1, No.3,August 2013

FACTORING CRYPTOSYSTEM MODULI WHEN THE CO-FACTORS DIFFERENCE IS BOUNDED Omar Akchiche 1 and Omar Khadir 2 1,2 Laboratory of Mathematics, Cryptography and Mechanics, Fstm, University of Hassan II Mohammedia-Casablanca,

Am I Decisive? Handout for Government 317, Cornell University, Fall 2003. Walter Mebane

Am I Decisive? Handout for Government 317, Cornell University, Fall 2003 Walter Mebane I compute the probability that one s vote is decisive in a maority-rule election between two candidates. Here, a decisive

Basic concepts in probability. Sue Gordon

Mathematics Learning Centre Basic concepts in probability Sue Gordon c 2005 University of Sydney Mathematics Learning Centre, University of Sydney 1 1 Set Notation You may omit this section if you are

ON THE EMBEDDING OF BIRKHOFF-WITT RINGS IN QUOTIENT FIELDS

ON THE EMBEDDING OF BIRKHOFF-WITT RINGS IN QUOTIENT FIELDS DOV TAMARI 1. Introduction and general idea. In this note a natural problem arising in connection with so-called Birkhoff-Witt algebras of Lie

The Characteristic Polynomial

Physics 116A Winter 2011 The Characteristic Polynomial 1 Coefficients of the characteristic polynomial Consider the eigenvalue problem for an n n matrix A, A v = λ v, v 0 (1) The solution to this problem

Math 408, Actuarial Statistics I, Spring 2008. Solutions to combinatorial problems

, Spring 2008 Word counting problems 1. Find the number of possible character passwords under the following restrictions: Note there are 26 letters in the alphabet. a All characters must be lower case

Probability Generating Functions

page 39 Chapter 3 Probability Generating Functions 3 Preamble: Generating Functions Generating functions are widely used in mathematics, and play an important role in probability theory Consider a sequence

3 Introduction to Assessing Risk

3 Introduction to Assessing Risk Important Question. How do we assess the risk an investor faces when choosing among assets? In this discussion we examine how an investor would assess the risk associated

You know from calculus that functions play a fundamental role in mathematics.

CHPTER 12 Functions You know from calculus that functions play a fundamental role in mathematics. You likely view a function as a kind of formula that describes a relationship between two (or more) quantities.

The Basics of Interest Theory

Contents Preface 3 The Basics of Interest Theory 9 1 The Meaning of Interest................................... 10 2 Accumulation and Amount Functions............................ 14 3 Effective Interest

A New Interpretation of Information Rate

A New Interpretation of Information Rate reproduced with permission of AT&T By J. L. Kelly, jr. (Manuscript received March 2, 956) If the input symbols to a communication channel represent the outcomes

How many numbers there are?

How many numbers there are? RADEK HONZIK Radek Honzik: Charles University, Department of Logic, Celetná 20, Praha 1, 116 42, Czech Republic radek.honzik@ff.cuni.cz Contents 1 What are numbers 2 1.1 Natural

Nonparametric adaptive age replacement with a one-cycle criterion

Nonparametric adaptive age replacement with a one-cycle criterion P. Coolen-Schrijner, F.P.A. Coolen Department of Mathematical Sciences University of Durham, Durham, DH1 3LE, UK e-mail: Pauline.Schrijner@durham.ac.uk

Sets and Cardinality Notes for C. F. Miller

Sets and Cardinality Notes for 620-111 C. F. Miller Semester 1, 2000 Abstract These lecture notes were compiled in the Department of Mathematics and Statistics in the University of Melbourne for the use

WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?

WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly

Chapter 7. Sealed-bid Auctions

Chapter 7 Sealed-bid Auctions An auction is a procedure used for selling and buying items by offering them up for bid. Auctions are often used to sell objects that have a variable price (for example oil)

LOGNORMAL MODEL FOR STOCK PRICES

LOGNORMAL MODEL FOR STOCK PRICES MICHAEL J. SHARPE MATHEMATICS DEPARTMENT, UCSD 1. INTRODUCTION What follows is a simple but important model that will be the basis for a later study of stock prices as

CONTRIBUTIONS TO ZERO SUM PROBLEMS

CONTRIBUTIONS TO ZERO SUM PROBLEMS S. D. ADHIKARI, Y. G. CHEN, J. B. FRIEDLANDER, S. V. KONYAGIN AND F. PAPPALARDI Abstract. A prototype of zero sum theorems, the well known theorem of Erdős, Ginzburg

JUST THE MATHS UNIT NUMBER 1.8. ALGEBRA 8 (Polynomials) A.J.Hobson

JUST THE MATHS UNIT NUMBER 1.8 ALGEBRA 8 (Polynomials) by A.J.Hobson 1.8.1 The factor theorem 1.8.2 Application to quadratic and cubic expressions 1.8.3 Cubic equations 1.8.4 Long division of polynomials

1 Introduction. Linear Programming. Questions. A general optimization problem is of the form: choose x to. max f(x) subject to x S. where.

Introduction Linear Programming Neil Laws TT 00 A general optimization problem is of the form: choose x to maximise f(x) subject to x S where x = (x,..., x n ) T, f : R n R is the objective function, S

E3: PROBABILITY AND STATISTICS lecture notes

E3: PROBABILITY AND STATISTICS lecture notes 2 Contents 1 PROBABILITY THEORY 7 1.1 Experiments and random events............................ 7 1.2 Certain event. Impossible event............................