  Introduction game Theory 2008-09. Peter van Emde Boas CHANCE MOVES WHY WOULD YOU EVEN CONSIDER TO PLAY.

Slides:



Advertisements
Similar presentations
Unit 3: Probability 3.1: Introduction to Probability
Advertisements

Copyright © Cengage Learning. All rights reserved.
Fundamentals of Probability
Lecture Slides Elementary Statistics Eleventh Edition
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide
Thursday, March 7 Duality 2 – The dual problem, in general – illustrating duality with 2-person 0-sum game theory Handouts: Lecture Notes.
LAW 11 Offside.
Probability I Introduction to Probability
CS CS1512 Foundations of Computing Science 2 Lecture 23 Probability and statistics (4) © J.
CS1512 Foundations of Computing Science 2 Week 3 (CSD week 32) Probability © J R W Hunter, 2006, K van Deemter 2007.
5.1 Probability of Simple Events
Beginning Probability
Discrete Distributions
The basics for simulations
An Extra Point Quiz. Are You Smarter than a Pre-Calc Student is a game in which the first 10 questions the class is playing the game together to earn.
Law 14 The Penalty Kick. 2 At the end of this lesson the student will do the following 3 things: Objectives 1.state when a penalty kick should be awarded.
MAT 103 Probability In this chapter, we will study the topic of probability which is used in many different areas including insurance, science, marketing,
Business and Economics 6th Edition
Chapter 2.3 Counting Sample Points Combination In many problems we are interested in the number of ways of selecting r objects from n without regard to.
Introduction to Probability
Probability: The Study of Randomness Chapter Randomness Think about flipping a coin n times If n = 2, can have 2 heads (100% heads), 1 heads and.
Chapter 8 Estimation Understandable Statistics Ninth Edition
PSSA Preparation.
Lecture 13 Elements of Probability CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
Copyright © 2010, 2007, 2004 Pearson Education, Inc. Chapter 14 From Randomness to Probability.
Distributed Computing 9. Sorting - a lower bound on bit complexity Shmuel Zaks ©
Distributed Computing 5. Snapshot Shmuel Zaks ©
Commonly Used Distributions
Copyright © Cengage Learning. All rights reserved.
Probability Simple Events
Presentation 5. Probability.
Mathematics in Today's World
Section 1.1, Slide 1 Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 13.4, Slide 1 13 Probability What Are the Chances?
Warm up 1)We are drawing a single card from a standard deck of 52 find the probability of P(seven/nonface card) 2)Assume that we roll two dice and a total.
Chapter 3 Probability.
CSC-2259 Discrete Structures
Probability Theory: Probability theory is the branch of mathematics concerned with analysis of random phenomena. (Encyclopedia Britannica) Probability.
Probability And Expected Value ————————————
Expected Value.  In gambling on an uncertain future, knowing the odds is only part of the story!  Example: I flip a fair coin. If it lands HEADS, you.
Game of Chaos: 35e Nederlands Mathematisch Congres Utrecht;   The Game of Chaos Peter.
Review of Probability and Binomial Distributions
Fundamentals of Probability
Section 1.1, Slide 1 Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 13.4, Slide 1 13 Probability What Are the Chances?
Probability Chapter 3. § 3.1 Basic Concepts of Probability.
Random Variables A random variable A variable (usually x ) that has a single numerical value (determined by chance) for each outcome of an experiment A.
Sets, Combinatorics, Probability, and Number Theory Mathematical Structures for Computer Science Chapter 3 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesProbability.
Sets, Combinatorics, Probability, and Number Theory Mathematical Structures for Computer Science Chapter 3 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesProbability.
Lecture Discrete Probability. 5.1 Probabilities Important in study of complexity of algorithms. Modeling the uncertain world: information, data.
Chapter 8 Probability Section R Review. 2 Barnett/Ziegler/Byleen Finite Mathematics 12e Review for Chapter 8 Important Terms, Symbols, Concepts  8.1.
Sullivan – Fundamentals of Statistics – 2 nd Edition – Chapter 5 Section 1 – Slide 1 of 33 Chapter 5 Section 1 Probability Rules.
Rules of the game: Syllabus and time table are available at: Read Appendix.
L Berkley Davis Copyright 2009 MER301: Engineering Reliability1 LECTURE 1: Basic Probability Theory.
Peter van Emde Boas: Games and Computer Science 1999 GAMES AND COMPUTER SCIENCE Theoretical Models 1999 Peter van Emde Boas References available at:
22C:19 Discrete Structures Discrete Probability Spring 2014 Sukumar Ghosh.
Probability Distributions: Binomial & Normal Ginger Holmes Rowell, PhD MSP Workshop June 2006.
Natural Language Processing Giuseppe Attardi Introduction to Probability IP notice: some slides from: Dan Jurafsky, Jim Martin, Sandiway Fong, Dan Klein.
Lecture 12. Game theory So far we discussed: roulette and blackjack Roulette: – Outcomes completely independent and random – Very little strategy (even.
WOULD YOU PLAY THIS GAME? Roll a dice, and win $1000 dollars if you roll a 6.
Chapter 2. Conditional Probability Weiqi Luo ( 骆伟祺 ) School of Data & Computer Science Sun Yat-Sen University :
Introduction to Probability – Experimental Probability.
Probability theory is the branch of mathematics concerned with analysis of random phenomena. (Encyclopedia Britannica) An experiment: is any action, process.
Week 21 Rules of Probability for all Corollary: The probability of the union of any two events A and B is Proof: … If then, Proof:
Chapter 4 Probability 4-1 Review and Preview 4-2 Basic Concepts of Probability 4-3 Addition Rule 4-4 Multiplication Rule: Basics 4-5 Multiplication Rule:
PROBABILITY DISTRIBUTIONS DISCRETE RANDOM VARIABLES OUTCOMES & EVENTS Mrs. Aldous & Mr. Thauvette IB DP SL Mathematics.
Probability Distributions ( 확률분포 ) Chapter 5. 2 모든 가능한 ( 확률 ) 변수의 값에 대해 확률을 할당하는 체계 X 가 1, 2, …, 6 의 값을 가진다면 이 6 개 변수 값에 확률을 할당하는 함수 Definition.
Discrete Probability Chapter 7 With Question/Answer Animations
Chapter 17 Thinking about Chance.
A random experiment gives rise to possible outcomes, but any particular outcome is uncertain – “random”. For example, tossing a coin… we know H or T will.
Sets, Combinatorics, Probability, and Number Theory
Presentation transcript:

  Introduction game Theory Peter van Emde Boas CHANCE MOVES WHY WOULD YOU EVEN CONSIDER TO PLAY THIS GAME? Peter van Emde Boas ILLC-FNWI-UvA Bronstee.com Software & Services B.V See:

  Introduction game Theory Peter van Emde Boas Sorry; it is in French! Game of Chaos Sorcery Play head or tails against a target opponent. The looser of the game looses one life. The winner of the game gains one life, and may choose to repeat the procedure. For every repetition the ante in life is doubled.

  Introduction game Theory Peter van Emde Boas CHANCE MOVES Chance moves controled by another player (Nature) who is not interested in the result Nature is bound to choose her moves fairly with respect to commonly known probabilities Resulting outcomes for active players become lotteries

  Introduction game Theory Peter van Emde Boas Flipping a coin HEADSTAILS 1 / -1-1/ 1 1 / -1 hhtt Thorgrim calls head or tails and Urgat flips the coin. Urgat’s move is irrelevant. Nature determines the outcome.

  Introduction game Theory Peter van Emde Boas Probability Theory Set of outcomes:  Probability measure  : Pow(  --> [0,1] Conditions: Non degeneracy:  (  ) = 0,  (  ) = 1 Additivity:  ( A  B ) =  (A) +  (B) when A  B =  Additivity extends to countable disjoint unions  (  A i ) =   (A i ), when A i  A j =  i ≠ j)

  Introduction game Theory Peter van Emde Boas Interpretation of probability Frequentionalist –If the experiment is repeated many many times, the proportion of instances where the event occurs converges to its probability Subjective –Related to the odds against which someone is willing to place a fair bet on the outcome of the experiment: odds a against b ( a:b ) denotes probability p = b/(a+b)

  Introduction game Theory Peter van Emde Boas Probability Theory Example: Fair Dice Set of outcomes:  { 1, 2, 3, 4, 5, 6 } Probability measure  (A) = #A / 6 with 2 dices the set of outcomes is . Each outcome has prob. 1/36 assuming the dice are independent.  (A  B) =  (A)   (B) when A (B) involves the first (second) dice only

  Introduction game Theory Peter van Emde Boas Possible sets   is finite : {1,2,3,4,5,6} all computations finite (but tedious) no problem with existence  is countably infinite: {0,1,2,3,....} few problems with existence (convergence) few computations possible (analytic)  is continuous: [0, 1] problems with existence (not all events measurable) hard to compute

  Introduction game Theory Peter van Emde Boas Independent Events   E F E  F  (E  F) =  (E)   (F)

  Introduction game Theory Peter van Emde Boas Paying off an old debt Azagh and Bolgh owe Urgat the amount of 1000 skulls. They only have 2 skulls. They decide to gamble in the two Lotteries organized in their tribe (Gork’s Whaagh support and Mork’s Wyvern protection campaign). Each ticket costs 1 skull and has a 1 in 2000 chance for a price of exactly the 1000 skulls needed. Failure to pay has the traditional consequences Option 1: buy tickets in same lottery Option 2: buy tickets in different lotteries © the Games Workshop

  Introduction game Theory Peter van Emde Boas Conditional Probability E  F E F   ( E|F ) =  (E  F) /  (F)  (E  F) =  ( E|F )   (F) = =  ( F|E )   (E)  ( F|E ) =  ( E|F )   (F) /  (E) BAYES’ RULE

  Introduction game Theory Peter van Emde Boas Multiple Choice Test A Multiple choice test question has k possible answers Students which have prepared themselves always answer right Students which went to the House Party always guess the answer Only a fraction p of the students have prepared themselves What is the probability that the right answer was obtained by guessing?  ( unprepared | right ) =  (right | unprepared)  (unprepared) /  (right)  (prepared | right ) =  (right | prepared)  (prepared) /  (right) q := 1 /  (right)  ( unprepared | right ) +  (prepared | right ) = 1

  Introduction game Theory Peter van Emde Boas Multiple Choice Test Solving the Equations for X =  ( unprepared | right ) : X = (1-p).q /k ; 1-X = p.q : so 1 = ( (1-p)/k + p).q. Therefore q = k/(1-p+pk) and X = (1-p)/(1-p+pk) = (k/k-1).1/(1+(k-1)p) - 1/(k-1) X=1 X=0 p=0p=1 k=1 k=3

  Introduction game Theory Peter van Emde Boas Random Variables Random Variable: function X:  -> R EExpectation: E X =  w  X(w)   (w) –for continuous W summation becomes integration.... Convergence guaranteed for bounded X ; but who guarantees that X is bounded ???!!

  Introduction game Theory Peter van Emde Boas Lotteries A Lottery is just a stochastic variable –outcomes draws –function value price collected Expectation of lottery expected price expected cost for participating Compound lottery : Price is free participation in another lottery....

  Introduction game Theory Peter van Emde Boas Lotteries price prob. $3 1/3 $12 1/6 -$2 1/2 Expectation: 1/ / /3. 3 = 2

  Introduction game Theory Peter van Emde Boas Compound Lottery price prob. $3 1/3 $12 1/6 -$2 1/2 $3 1/2 -$2 1/2 1/54/5 price prob. $3 7/15 $12 1/30 -$2 1/2 In compound lotteries all drawings are assumed to be independent

  Introduction game Theory Peter van Emde Boas Game Values Without chance moves –Game value Best result player can obtain from game –Computed by Zermelo’s algorithm (Backward induction) With chance moves –Game value becomes a lottery –if final pay-off is numeric expectation can be computed

  Introduction game Theory Peter van Emde Boas Flipping a coin HEADSTAILS 1 / -1-1/ 1 1 / -1 hhtt 1/2 Expectation0 / 0

  Introduction game Theory Peter van Emde Boas Flipping a Biased coin HEADSTAILS 1 / -1-1/ 1 1 / -1 hhtt 2/31/32/31/3 Expectation -1/3 / 1/31/3 / -1/3 Value for Thorgrim -1/31/3

  Introduction game Theory Peter van Emde Boas Lotteries as game Values in chapter 2 Binmore restricts himself to very simple lotteries WL p1 - p p These lotteries are outcomes of games. p Thorgrim prefers p q over q when p > q ; for Urgat the opposite holds

  Introduction game Theory Peter van Emde Boas Comparing Complex Lotteries 010 $0M$1M$5M $0M$1M$5M $0M$1M$5M $0M$1M$5M ??

  Introduction game Theory Peter van Emde Boas The St. Petersburg Paradox Flip a fair coin until H appears Price = 2 #T in this sequence so H ---> 1 TH ---> 2 TTH ---> 4 TTTH ---> 8 etc. Expectation: 1/2 * 1 + 1/4 * 2 + 1/8 * 4 + 1/16 * = 1/2 + 1/2 + 1/2 + 1/ =  But how much are you willing to pay for participation??!

  Introduction game Theory Peter van Emde Boas DUEL The two warriors approach each other. Both are equipped with a javelin which they can throw at their opponent. The probability of hitting the opponent is a decreasing function of the distance. The warrior who throws first and has missed his throw remains unarmed and is therefore doomed to die. © the Games Workshop Lord Tyrion © the Games Workshop Sir Urquard

  Introduction game Theory Peter van Emde Boas Duel p100q99p98q51p50q49q1p0 Distance p100q99p98q51p50q49q1p0 HHHHHHHHMMMMMMMM TTTTTTTT DDD DD D D U U U U U U U U TT TT T T T T

  Introduction game Theory Peter van Emde Boas Duel p100q99p98q51p50q49q1p0 Distance p100q99p98q51p50q49q1p0 TTTTTTTT DDD DD D D p1001-q991-p981-q511-p501-q491-q11-p0 1 0 (p + q)

  Introduction game Theory Peter van Emde Boas Parcheesi Very simplified version of traditional board game, like Mens erger je Niet,..... Players move tokens from start to target over trajectory. Distance moved determined by chance. Opponent’s tokens are reset to start when hit by your’s. Urgat start Thorgrim start Target Chance = Coin Flip: Heads = 2 Tails = 1 Target may be overthrown waiting allowed

  Introduction game Theory Peter van Emde Boas Parcheesi - Positions Urgat to move Thorgrim to move T U

  Introduction game Theory Peter van Emde Boas Parcheesi - Moves and values T U 11abcdef 001-a1-b1-c1-d1-e1-f 11abcdef 001-a1-b1-c1-d1-e1-f

  Introduction game Theory Peter van Emde Boas Analyzing a Subgame HT 1/2 MMWW 3 10 U 14 1 a 01-d0 a = 1/2 ( d ) = 1 - d/2

  Introduction game Theory Peter van Emde Boas Analyzing a Subgame HT 1/2 MMWW d 01-d0 d = 1/2 (1-d ) ; d = 1/3 a = 5/6 9 0

  Introduction game Theory Peter van Emde Boas Parcheesi - Moves and values T U 115/6bc1/3ef 001/61-b1-c2/31-e1-f 115/6bc1/3ef 001/61-b1-c2/31-e1-f 1/2

  Introduction game Theory Peter van Emde Boas Analyzing a Subgame HT 1/2 MMWW 4 12 b 1-b best move on T ? b ≥ 5/6 ==> b = 1/2 (1 + 1/6) ==> b = 7/12 ==> false Hence b ≤ 5/6 b = 1/2 (1 + 1-b) b = 2/3 11 1/6 U

  Introduction game Theory Peter van Emde Boas Analyzing Subgames HT 1/2 MMWW 5 15 c 1-e 14 2/3 U HT 1/2 MMWW 7 13 e 1-c 12 1/3 11 1/6 e ≤ 1/3 ==> c = 1/2 ( e) c + e/2 = 1 e > 1/3 ==> c = 1/2 ( 1 + 2/3 ) = 5/6 ==> e = 1/2 ( 1/3 + 1/6) = 1/4 ==> false 1-c = e/2 ≤ 1/6 ==> e = 1/2 ( 1/6 + 1/3) = 1/4 & c = 7/8

  Introduction game Theory Peter van Emde Boas Analyzing Start Position HT 1/2 MMWW 8 16 f 1-f 15 3/4 14 2/3 f ≥ 1/2 ; otherwise nobody moves..... hence f = 1/2 ( 2/3 + 3/4) f = 17/24 which represents the value of the game

  Introduction game Theory Peter van Emde Boas Parcheesi - Moves and values T U 115/62/31/3 001/61/31/82/33/47/24 115/62/37/81/31/417/24 001/61/32/3 7/8 1/8 1/4 3/4 17/24 7/24