Game-theoretic probability and its applications Glenn Shafer December 14, 2009 Subjective Bayes 2009 Warwick University.

Slides:



Advertisements
Similar presentations
Designing Investigations to Predict Probabilities Of Events.
Advertisements

CS1512 Foundations of Computing Science 2 Week 3 (CSD week 32) Probability © J R W Hunter, 2006, K van Deemter 2007.
Nash’s Theorem Theorem (Nash, 1951): Every finite game (finite number of players, finite number of pure strategies) has at least one mixed-strategy Nash.
Week 11 Review: Statistical Model A statistical model for some data is a set of distributions, one of which corresponds to the true unknown distribution.
Overview Fundamentals
Statistics: Purpose, Approach, Method. The Basic Approach The basic principle behind the use of statistical tests of significance can be stated as: Compare.
4 Why Should we Believe Politicians? Lupia and McCubbins – The Democratic Dilemma GV917.
Solve for x. 28 = 4(2x + 1) = 8x = 8x + 8 – 8 – 8 20 = 8x = x Distribute Combine Subtract Divide.
Chapter 4: Reasoning Under Uncertainty
Binomial Distribution & Bayes’ Theorem. Questions What is a probability? What is the probability of obtaining 2 heads in 4 coin tosses? What is the probability.
Probability Chapter 11 1.
7.1 Sample space, events, probability
Learning Objectives for Section 8.1 Probability
Section 1 Sample Spaces, Events, and Probability
Probabilities Random Number Generators –Actually pseudo-random –Seed Same sequence from same seed Often time is used. Many examples on web. Custom random.
Probability theory Much inspired by the presentation of Kren and Samuelsson.
Basic Probability. Theoretical versus Empirical Theoretical probabilities are those that can be determined purely on formal or logical grounds, independent.
Slide Slide 1 Copyright © 2007 Pearson Education, Inc Publishing as Pearson Addison-Wesley. Created by Tom Wegleitner, Centreville, Virginia Section 4-2.
DANSS Colloquium By Prof. Danny Dolev Presented by Rica Gonen
Review of Probability and Binomial Distributions
A Practical Course in Graphical Bayesian Modeling; Class 1 Eric-Jan Wagenmakers.
INTRODUCTORY MATHEMATICAL ANALYSIS For Business, Economics, and the Life and Social Sciences  2007 Pearson Education Asia Chapter 8 Introduction to Probability.
De Finetti’s ultimate failure Krzysztof Burdzy University of Washington.
Probability Part 1 – Fundamental and Factorial Counting Rules.
COMP14112: Artificial Intelligence Fundamentals L ecture 3 - Foundations of Probabilistic Reasoning Lecturer: Xiao-Jun Zeng
1 G Lect 1a Lecture 1a Perspectives on Statistics in Psychology Applications of statistical arguments Describing central tendency and variability.
Sections 4-1 and 4-2 Review and Preview and Fundamentals.
Chapter 1 Probability and Distributions Math 6203 Fall 2009 Instructor: Ayona Chatterjee.
Sullivan – Fundamentals of Statistics – 2 nd Edition – Chapter 5 Section 1 – Slide 1 of 33 Chapter 5 Section 1 Probability Rules.
3.1 & 3.2: Fundamentals of Probability Objective: To understand and apply the basic probability rules and theorems CHS Statistics.
Lecture 5. Basic Probability David R. Merrell Intermediate Empirical Methods For Public Policy and Management.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 12.1 The Nature of Probability.
What is Probability?  Hit probabilities  Damage probabilities  Personality (e.g. chance of attack, run, etc.)  ???  Probabilities are used to add.
CPSC 531: Probability Review1 CPSC 531:Probability & Statistics: Review Instructor: Anirban Mahanti Office: ICT Class.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 11 Counting Methods and Probability Theory.
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall.
1.3 Simulations and Experimental Probability (Textbook Section 4.1)
G. Cowan Lectures on Statistical Data Analysis Lecture 1 page 1 Lectures on Statistical Data Analysis London Postgraduate Lectures on Particle Physics;
K. Shum Lecture 6 Various definitions of Probability.
On joint modelling of random uncertainty and fuzzy imprecision Olgierd Hryniewicz Systems Research Institute Warsaw.
Basic Concepts of Probability Coach Bridges NOTES.
Bayesian vs. frequentist inference frequentist: 1) Deductive hypothesis testing of Popper--ruling out alternative explanations Falsification: can prove.
What is Probability?. The Mathematics of Chance How many possible outcomes are there with a single 6-sided die? What are your “chances” of rolling a 6?
Reasoning Under Uncertainty. 2 Objectives Learn the meaning of uncertainty and explore some theories designed to deal with it Find out what types of errors.
Copyright © 2010 Pearson Education, Inc. Unit 4 Chapter 14 From Randomness to Probability.
Sixth lecture Concepts of Probabilities. Random Experiment Can be repeated (theoretically) an infinite number of times Has a well-defined set of possible.
1 Probability Ernesto A. Diaz Faculty Mathematics Department.
Copyright © 2010, 2007, 2004 Pearson Education, Inc. Lecture Slides Elementary Statistics Eleventh Edition and the Triola Statistics Series by.
Population Genetics Lab Lab Instructor: Hari Chhetri PhD student Department of Biology Area of Research: Association genetics (Populus) Office:Life Sciences.
1 Chapter 4, Part 1 Basic ideas of Probability Relative Frequency, Classical Probability Compound Events, The Addition Rule Disjoint Events.
S U C C E S S I O N. Z Z Scissors Paper Stone  Scissors beats paper (cuts it)  Paper beats rock (wraps it)  Rock beats scissors (blunts it)
#1 Make sense of problems and persevere in solving them How would you describe the problem in your own words? How would you describe what you are trying.
7.1: Thinking About Chance Statistics Chap 7:Chance and Probability.
Chapter 8 Probability Section 1 Sample Spaces, Events, and Probability.
The Law of Averages. What does the law of average say? We know that, from the definition of probability, in the long run the frequency of some event will.
Which of Mill’s methods does research through controlled experimentation closely resemble?
PROBABILITY AND COMPUTING RANDOMIZED ALGORITHMS AND PROBABILISTIC ANALYSIS CHAPTER 1 IWAMA and ITO Lab. M1 Sakaidani Hikaru 1.
1 COMP2121 Discrete Mathematics Principle of Inclusion and Exclusion Probability Hubert Chan (Chapters 7.4, 7.5, 6) [O1 Abstract Concepts] [O3 Basic Analysis.
Dealing with Random Phenomena
Lecture Slides Elementary Statistics Twelfth Edition
Reasoning Under Uncertainty in Expert System
5.1 Probability of Simple Events
Elementary Statistics
Chapter 5 Probability.
Section 12.1 The Nature of Probability
Section 12.1 The Nature of Probability
6.1 Sample space, events, probability
Section 12.1 The Nature of Probability
Presentation transcript:

Game-theoretic probability and its applications Glenn Shafer December 14, 2009 Subjective Bayes 2009 Warwick University

2 Three advertisements 1.Electronic Journal for History of Probability and Statistics 2.Upcoming workshop on game-theoretic probability, Royal Holloway, June Vovk/Shafer website and book on game- theoretic probability

3 Electronic Journal for History of Probability and Statistics June 2009 issue: History of Martingales Who knew this journal exists?

4 GTP 2010 Third Workshop on Game-Theoretic Probability and Related Topics June 2010 Royal Holloway, University of London Egham, Surrey, UK

5 Game-Theoretic Probability Glenn Shafer & Vladimir Vovk Wiley, 2001 Today’s talk emphasizes working papers 31 & 32.

6 Use game theory instead of measure theory as a mathematical framework for probability. Classical theorems are proven by betting strategies that multiply a player's stake by a large factor if the theorem's prediction fails. Some applications: (1) defensive forecasting (2) regression with x’s chosen as we go along (3) Bayesian inference (4) Dempster-Shafer inference (5) finance

7 Pascal’s question to Fermat Paul needs 2 points to win. Peter needs only one. If the game must be broken off, how much of the stake should Paul get?

8 Fermat’s answer (measure theory) Count the possible outcomes. Suppose they play two rounds. There are 4 possible outcomes: 1. Peter wins first, Peter wins second 2. Peter wins first, Paul wins second 3. Paul wins first, Peter wins second 4. Paul wins first, Paul wins second Pierre Fermat, Paul wins only in outcome 4. So his share should be ¼, or 16 pistoles. Pascal didn’t like the argument.

9 Pascal’s answer (game theory)

10 Another probability problem: HH before TT $3 $1 H T If you bet $1 on heads… $0 H 1/3 2/3 T PROBABILITIES Toss the biased coin repeatedly. What is the probability of HH before TT? PAYOFFS

11 Measure-theoretic solution H 1/3 2/3 T PROBABILITIES What is the probability of HH before TT? Measure-theoretic question

12 Game-theoretic question What is $p, the price of a $1 payoff conditional on HH before TT? $3c $c H T $0 Payoff on each toss Game-theoretic solution $1 $p$p HH before TT TT before HH $0 $1 conditional on HH before TT $1 $a$a H T $b$b Last toss was H $a$a $b$b H T $0 Last toss was T $3/7 $p$p H T $1/7 Beginning of game

13 Measure-theoretic probability begins with a probability space: Classical: elementary events with probabilities adding to one. Modern: space with filtration and probability measure. Probability of A = total of probabilities for elementary events that favor A. Game-theoretic probability begins with a game: One player offers prices for uncertain payoffs. Another player decides what to buy. Probability of A = initial stake you need in order to get 1 if A happens.

14 Interpretation of game-theoretic probability Mathematical definition of probability: P(A) = cost of getting $1 if A happens Version 1. An event of very small probability will not happen. (Cournot’s principle) Version 2. You will not multiply your capital by a large factor without risking bankruptcy. (Efficient market hypothesis / empirical interpretation of game-theoretic probability) Borel, Kolmogorov, and others advocated version 1 between 1900 and Jean Ville stated version 2 in the 1930s.

15 Emile Borel Andrei Kolmogorov You do the mathematics of probability by finding the measures of sets. Jean André Ville (Borel’s student) Volodya Vovk (Kolmogorov’s student) You do the mathematics of probability by finding betting strategies. Measure-theoretic probabilityGame-theoretic probability

16 Every event has a probability in measure-theoretic probability. To guarantee this, we worry about measurability. Not so in game-theoretic probability. Probability of A = initial stake you need in order to get exactly 1 if A happens 0 if A fails. Sometimes we only have upper and lower probabilities: Upper probability of A = initial stake you need in order to get at least 1 if A happens, 0 if A fails. No issue about measurability in the foundation.

17 Theorems We prove a claim (e.g., law of large numbers) by constructing a strategy that multiplies the capital risked by a large factor if the claim fails. Statistics A statistical test is a strategy for trying to multiply the capital risked.

18 To make Pascal’s theory part of modern game theory, we must define the game precisely. Rules of play Each player’s information Rule for winning

19

20

21 =

22 =

23 Assumptions about the bets offered by forecaster at each step Condition 4 replaces countable additivity.

24

25 As an empirical theory, game-theoretic probability makes predictions: A will not happen if there is a strategy that multiplies your capital without risking bankruptcy when A happens. Defensive forecasting: Amazingly, predictions that pass all statistical tests are possible (defensive forecasting).

26

27

28

29 Nuances: 1.When a probabilistic theory successfully predicts a long sequence of future events (as quantum mechanics does), it tells us something about phenomena. 2.When a probabilistic theory predicts only one step at a time (basing each successive prediction on what happened previously), it has practical value but tells us nothing about phenomena. Defensive forecasting pass statistical tests regardless of how events come out. 3.When we talk about the probability of an isolated event, which different people can place in different sequences, we are weighing arguments. This is the place of evidence theory.

30

31

32 De Finetti interpreted De Moivre’s prices in a particular way. There are other ways. In game-theoretic probability (Shafer and Vovk 2001) we interpret the prices as a prediction. The prediction: You will not multiply by a large factor the capital you risk at these prices.

33

34

35 Comments 1.Game-theoretic advantage over de Finetti: the condition that we learn only A and nothing else (relevant) has a meaning without a prior protocol (see my 1985 article on conditional probability). 2.Winning against probabilities by multiplying the capital risked over the long run: To understand this fully, learn about game- theoretic probability.

36 My paper on the game-theoretic argument for conditional probability: A betting interpretation for probabilities and Dempster-Shafer degrees of belief On-line in International Journal of Approximate Reasoning. Also at as working paper 31.