February 2, 2016 Stochastic Games Mr Sujit P Gujar. e-Enterprise Lab Computer Science and Automation IISc, Bangalore.

Slides:



Advertisements
Similar presentations
Uri Zwick Tel Aviv University Simple Stochastic Games Mean Payoff Games Parity Games.
Advertisements

Introduction to Game Theory
9.1 Strictly Determined Games Game theory is a relatively new branch of mathematics designed to help people who are in conflict situations determine the.
Infinitely Repeated Games
NON - zero sum games.
GAME THEORY.
Two Player Zero-Sum Games
Module 4 Game Theory To accompany Quantitative Analysis for Management, Tenth Edition, by Render, Stair, and Hanna Power Point slides created by Jeff Heyl.
M9302 Mathematical Models in Economics Instructor: Georgi Burlakov 3.1.Dynamic Games of Complete but Imperfect Information Lecture
Crime, Punishment, and Forgiveness
Game Theory Assignment For all of these games, P1 chooses between the columns, and P2 chooses between the rows.
Mechanism Design without Money Lecture 1 Avinatan Hassidim.
Totally Unimodular Matrices
Mixed Strategies CMPT 882 Computational Game Theory Simon Fraser University Spring 2010 Instructor: Oliver Schulte.
Game Theory S-1.
Introduction to Game theory Presented by: George Fortetsanakis.
Two-Player Zero-Sum Games
Non-Cooperative Game Theory To define a game, you need to know three things: –The set of players –The strategy sets of the players (i.e., the actions they.
Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.
An Introduction to... Evolutionary Game Theory
The Theory of Games By Tara Johnson, Lisa Craig and Amanda Parlin.
MIT and James Orlin © Game Theory 2-person 0-sum (or constant sum) game theory 2-person game theory (e.g., prisoner’s dilemma)
Copyright (c) 2003 Brooks/Cole, a division of Thomson Learning, Inc
Study Group Randomized Algorithms 21 st June 03. Topics Covered Game Tree Evaluation –its expected run time is better than the worst- case complexity.
Game theory.
EC941 - Game Theory Lecture 7 Prof. Francesco Squintani
Game Theory. “If you don’t think the math matters, then you don’t know the right math.” Chris Ferguson 2002 World Series of Poker Champion.
Part 3: The Minimax Theorem
Economics 202: Intermediate Microeconomic Theory 1.HW #6 on website. Due Thursday. 2.No new reading for Thursday, should be done with Ch 8, up to page.
GAME THEORY By Ben Cutting & Rohit Venkat. Game Theory: General Definition  Mathematical decision making tool  Used to analyze a competitive situation.
Lecture 1 - Introduction 1.  Introduction to Game Theory  Basic Game Theory Examples  Strategic Games  More Game Theory Examples  Equilibrium  Mixed.
Duality Lecture 10: Feb 9. Min-Max theorems In bipartite graph, Maximum matching = Minimum Vertex Cover In every graph, Maximum Flow = Minimum Cut Both.
Matrix Games Mahesh Arumugam Borzoo Bonakdarpour Ali Ebnenasir CSE 960: Selected Topics in Algorithms and Complexity Instructor: Dr. Torng.
APEC 8205: Applied Game Theory Fall 2007
Games of Chance Introduction to Artificial Intelligence COS302 Michael L. Littman Fall 2001.
Finite Mathematics & Its Applications, 10/e by Goldstein/Schneider/SiegelCopyright © 2010 Pearson Education, Inc. 1 of 68 Chapter 9 The Theory of Games.
1 On the Agenda(s) of Research on Multi-Agent Learning by Yoav Shoham and Rob Powers and Trond Grenager Learning against opponents with bounded memory.
Game Theory Statistics 802. Lecture Agenda Overview of games 2 player games representations 2 player zero-sum games Render/Stair/Hanna text CD QM for.
MAKING COMPLEX DEClSlONS
Game Theory The Prisoner’s Dilemma Game. “Strategic thinking is the art of outdoing an adversary, knowing that the adversary is trying to do the same.
Dynamic Games of complete information: Backward Induction and Subgame perfection - Repeated Games -
9  Markov Chains  Regular Markov Chains  Absorbing Markov Chains  Game Theory and Strictly Determined Games  Games with Mixed Strategies Markov Chains.
Standard and Extended Form Games A Lesson in Multiagent System Based on Jose Vidal’s book Fundamentals of Multiagent Systems Henry Hexmoor, SIUC.
Markov Decision Processes1 Definitions; Stationary policies; Value improvement algorithm, Policy improvement algorithm, and linear programming for discounted.
A Little Game Theory1 A LITTLE GAME THEORY Mike Bailey MSIM 852.
Game theory & Linear Programming Steve Gu Mar 28, 2008.
Chapter 11 Game Theory Math Game Theory What is it? – a way to model conflict and competition – one or more "players" make simultaneous decisions.
Game theory is the study of the best play–safe strategy to adopt if 2 players are playing a game where decisions affect each other. Ex Two men are caught.
When dealing with a model, we use the letter  for the mean. We write or, more often, replacing p by, Instead of , we can also write E(X ). ( Think of.
Part 3 Linear Programming
1 What is Game Theory About? r Analysis of situations where conflict of interests is present r Goal is to prescribe how conflicts can be resolved 2 2 r.
Designing Games for Distributed Optimization Na Li and Jason R. Marden IEEE Journal of Selected Topics in Signal Processing, Vol. 7, No. 2, pp ,
1. 2 You should know by now… u The security level of a strategy for a player is the minimum payoff regardless of what strategy his opponent uses. u A.
Game tree search Thanks to Andrew Moore and Faheim Bacchus for slides!
1 a1a1 A1A1 a2a2 a3a3 A2A Mixed Strategies When there is no saddle point: We’ll think of playing the game repeatedly. We continue to assume that.
Strategic Game Theory for Managers. Explain What is the Game Theory Explain the Basic Elements of a Game Explain the Importance of Game Theory Explain.
Statistics Overview of games 2 player games representations 2 player zero-sum games Render/Stair/Hanna text CD QM for Windows software Modeling.
Introduction to Game Theory Presented by 蘇柏穎 2004/12/9 2004/12/9.
Stochastic Processes and Transition Probabilities D Nagesh Kumar, IISc Water Resources Planning and Management: M6L5 Stochastic Optimization.
GAME THEORY Day 5. Minimax and Maximin Step 1. Write down the minimum entry in each row. Which one is the largest? Maximin Step 2. Write down the maximum.
Lec 23 Chapter 28 Game Theory.
9.2 Mixed Strategy Games In this section, we look at non-strictly determined games. For these type of games the payoff matrix has no saddle points.
Evolution of Cooperation in Mobile Ad Hoc Networks Jeff Hudack (working with some Italian guy)
Game Theory By Ben Cutting & Rohit Venkat.
Game Theory M.Pajhouh Niya M.Ghotbi
Chapter 6 Game Theory (Module 4) 1.
Multiagent Systems Repeated Games © Manfred Huber 2018.
Lecture 20 Linear Program Duality
9.3 Linear programming and 2 x 2 games : A geometric approach
Presentation transcript:

February 2, 2016 Stochastic Games Mr Sujit P Gujar. e-Enterprise Lab Computer Science and Automation IISc, Bangalore.

February 2, 2016e-Enterprise Lab Agenda Stochastic Game Special Class of Stochastic Games Analysis : Shapley’s Result. Applications

February 2, 2016e-Enterprise Lab Repeated Game When players interact by playing a similar stage game (such as the prisoner's dilemma) numerous times, the game is called a repeated game.prisoner's dilemma

February 2, 2016e-Enterprise Lab Stochastic Game Stochastic game is repeated game with probabilistic/stochastic transitions. There are different states of a game. Transition probabilities depend upon actions of players. Two player stochastic game : 2 and 1/2 player game.

February 2, 2016e-Enterprise Lab Repeated Prisoner’s Dilemma Consider Game tree for PD repeated twice. What is Player 1’s strategy set? (Cross product of all choice sets at all information sets…) {C,D} x {C,D} x {C,D} x {C,D} x {C,D} 2 5 = 32 possible strategies First Iteratio n Second Iteratio n subga me 1 2 Assume each player has the same two options at each info set: {C,D}

February 2, 2016e-Enterprise Lab Issues in Analyzing Repeated Games How to we solve infinitely repeated games? Strategies are infinite in number. Need to compare sums of infinite streams of payoffs

February 2, 2016e-Enterprise Lab Stochastic Game : The Big Match Every day player 2 chooses a number, 0 or 1 Player 1 tries to predict it. Wins a point if he is correct. This continues as long as player 1 predicts 0. But if he ever predicts 1, all future choices for both players are required to be the same as that day's choices.

February 2, 2016e-Enterprise Lab The Big Match S = {0,1 *,2 * } : State space P 01 = s 0 ={0,1} s 1 ={0} s 2 ={1} P 02 = N = {1,2} P 00 = A = Payoff Matrix = 1*1* 0*0* 01

February 2, 2016e-Enterprise Lab The "Big-Match" game is introduced by Gillette (1957) as a difficult example. The Big Match David Blackwell; T. S. Ferguson The Annals of Mathematical Statistics, Vol. 39, No. 1. (Feb., 1968), pp

February 2, 2016e-Enterprise Lab Scenario NTotal number of States/Positions mkmk Choices for row player at position k nknk Choices for column player at position k s k ij > 0The probability with which the game in position k stops when player 1 plays i and player 2, j. p kl ij The probability with which the game in position k moves to l when player 1 plays i and player 2, j. sMin s k ij a k ij Payoff to row player in stage k. MMax |a k ij |

February 2, 2016e-Enterprise Lab Stationary Strategies Enumerating all pure and mixed strategies is cumbersome and redundant. Behavior strategies those which specify a player the same probabilities for his choices every time the same position is reached by whatever route. x = (x 1,x 2,…,x N ) each x k = (x k 1, x k 2,…, x k m k )

February 2, 2016e-Enterprise Lab Notation Given a matrix game B, val[B] = minimax value to the first player. X[B] = The set of optimal strategies for first player. Y[B] = The set of optimal strategies for second player. It can be shown, (B and C having same dimensions) |val[B] - val[C]| ≤ max |b ij - c ij |

February 2, 2016e-Enterprise Lab When we start in position k, we obtain a particular game, We will refer stochastic game as, Define,

February 2, 2016e-Enterprise Lab Shapley’s 1 Results 1 L.S. Shapley, Stochastic Games. PNAS 39(1953)

February 2, 2016e-Enterprise Lab Let, denote the collection of games whose pure strategies are the stationary strategies of. The payoff function of these new games must satisfy,

February 2, 2016e-Enterprise Lab Shapley’s Result,

February 2, 2016e-Enterprise Lab Applications 1 When N = 1, By setting all s k ij = s > 0, we get model of infinitely repeated game with future payments are discounted by a factor = (1-s). If we set n k = 1 for all k, the result is “dynamic programming model”. 1 von Neumann J., Ergennise eines Math, Kolloquims, (1937)

February 2, 2016e-Enterprise Lab Example Consider the game with N = 1, A = 1-s P1 = x=(0.6,0.4) y=(0.4, 0.6) 1-2s 1-s1-2s P2 = x=(0.61,0.39) y=(0.39, 0.61)

February 2, 2016e-Enterprise Lab Thank You!!