1 / 9

MiniMax Principle in Game Theory

MiniMax Principle in Game Theory. Slides Made by Senjuti Basu Roy. MiniMax Principle from Game Theory is used to provide a lower bound of the running time of the Randomized AND-OR tree algorithm. Rachael and Chris play a game with three objects: Stone Paper Scissors

moses
Download Presentation

MiniMax Principle in Game Theory

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. MiniMax Principle in Game Theory Slides Made by Senjuti Basu Roy

  2. MiniMax Principle from Game Theory is used to provide a lower bound of the running time of the Randomized AND-OR tree algorithm. • Rachael and Chris play a game with three objects: • Stone • Paper • Scissors • In this simultaneous game,both Rachael and Chris pick up one of these three objects. • This three objects have the following order of preference : Stone >> (preferred than) Scissors Scissors >> Paper and Paper >> Stone. The winner of the game Played by Rachael and Chris is determined by the following way: The person who picks up a more preferred item than the other is the winner. The loser pays $1 to the winner and the outcome is a draw when both of them picks up the same object

  3. Scissors Paper Stone This is called Two Person Zero Sum Game since Money are Getting exchanged Between hands and There is no External money flow. Scissors 0 1 -1 Paper 1 -1 0 Stone -1 0 1 Matrix for Scissors-Paper-Stone

  4. A Deterministic Strategy – Chris Pays Rachael The minimum Amount Rachael Makes if she selects Scissors Scissors Paper Stone 0 1 -1 -1 Scissors Paper -1 -1 0 1 Paper Maxm Amount Chris has To pay Rachael if he selects -1 1 -1 0 Stone Stone 1 1 1 Scissors Paper Stone

  5. Another Pay Off Matrix Scissors Paper Stone Scissors 0 0 1 2 Paper -1 -1 1 0 -2 -1 -2 0 Stone VR= maxi{minj Mij} VR= 0 0 1 2 VC= minj{maxi Mij} VC= 0

  6. What is VR and Vc in a Conservative Game Strategy? • VR = The lower bound of the amount of money that Rachael can make/round • Vc = The upper bound of the money that Chris can give to Rachael. • And in general VR <= Vc • For certain Pay-offmatrices , VR = Vc

  7. Probabilistic Game Playing Strategy PDF of Chris’ moves 1 2 n 1 2 PDF of Rachael’s moves n n x n Expected [payoff] = (Σ i=1 ..n) (Σ j=1 ..n) piMijqj = pTMq

  8. How does this strategy work?- Von Neumann’s MiniMax Principle • Say Rachael has selected p. Then Chris should select a distribution q such that PTMq is minimized. • Minq PTMq. • Rachael wants VR = maxp minq PTMq. • Chris wants VC = minq maxp PTMq. • In the probabilistic game playing strategy , VR = VC • This is known as Von Neumann’s MiniMax Principle.

  9. PDF interpretation of Deterministic Game: • All moves get 0 as the probability and the move chosen by the player gets 1. • PDF looks like 1 0 - - - - - - 0 0 0 0 Loomi’s Theorem: It says maxp mine PTM e = minq maxf fTM q, where e and f are special distributions has only 1 and 0 everywhere else.

More Related