Information, Control and Games

Slides:



Advertisements
Similar presentations
Mixed Strategies.
Advertisements

Pondering more Problems. Enriching the Alice-Bob story Go to AGo to B Go to A Alice Go to B Go to A Go to B Go shoot pool Alice.
Game Theory Assignment For all of these games, P1 chooses between the columns, and P2 chooses between the rows.
Mixed Strategies CMPT 882 Computational Game Theory Simon Fraser University Spring 2010 Instructor: Oliver Schulte.
Mixed Strategies For Managers
Chapter Twenty-Eight Game Theory. u Game theory models strategic behavior by agents who understand that their actions affect the actions of other agents.
Simultaneous- Move Games with Mixed Strategies Zero-sum Games.
Game Theory “I Used to Think I Was Indecisive - But Now I’m Not So Sure” - Anonymous Mike Shor Lecture 5.
ECO290E: Game Theory Lecture 5 Mixed Strategy Equilibrium.
MIT and James Orlin © Game Theory 2-person 0-sum (or constant sum) game theory 2-person game theory (e.g., prisoner’s dilemma)
EC3224 Autumn Lecture #04 Mixed-Strategy Equilibrium
Non-cooperative Games Elon Kohlberg February 2, 2015.
Network Theory and Dynamic Systems Game Theory: Mixed Strategies
Chapter 6 © 2006 Thomson Learning/South-Western Game Theory.
Eponine Lupo.  Game Theory is a mathematical theory that deals with models of conflict and cooperation.  It is a precise and logical description of.
Information, Control and Games Shi-Chung Chang EE-II 245, Tel: ext Office.
An Introduction to Game Theory Part II: Mixed and Correlated Strategies Bernhard Nebel.
Lecture 1 - Introduction 1.  Introduction to Game Theory  Basic Game Theory Examples  Strategic Games  More Game Theory Examples  Equilibrium  Mixed.
January 20 Lecture Econ 171. The game of matching pennies has A)two pure strategy Nash equilibria B)One pure strategy Nash equilibrium C)One mixed strategy.
Harsanyi transformation Players have private information Each possibility is called a type. Nature chooses a type for each player. Probability distribution.
Chapter Twenty-Eight Game Theory. u Game theory models strategic behavior by agents who understand that their actions affect the actions of other agents.
Game Theory and Applications following H. Varian Chapters 28 & 29.
Game theory The study of multiperson decisions Four types of games
1 Introduction APEC 8205: Applied Game Theory. 2 Objectives Distinguishing Characteristics of a Game Common Elements of a Game Distinction Between Cooperative.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Review Midterm3/19 3/12.
Learning in Games. Fictitious Play Notation! For n Players we have: n Finite Player’s Strategies Spaces S 1, S 2, …, S n n Opponent’s Strategies Spaces.
6.1 Consider a simultaneous game in which player A chooses one of two actions (Up or Down), and B chooses one of two actions (Left or Right). The game.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
Extensive Game with Imperfect Information Part I: Strategy and Nash equilibrium.
Nash Equilibrium - definition A mixed-strategy profile σ * is a Nash equilibrium (NE) if for every player i we have u i (σ * i, σ * -i ) ≥ u i (s i, σ.
Game Theoretic Analysis of Oligopoly lr L R 0000 L R 1 22 The Lane Selection Game Rational Play is indicated by the black arrows.
EC941 - Game Theory Francesco Squintani Lecture 3 1.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Review Midterm3/23 3/9.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
Game Theory.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
EC941 - Game Theory Prof. Francesco Squintani Lecture 2 1.
Chapter 9 Games with Imperfect Information Bayesian Games.
© 2009 Institute of Information Management National Chiao Tung University Lecture Note II-3 Static Games of Incomplete Information Static Bayesian Game.
Information, Control and Games Shi-Chung Chang EE-II 245, Tel: ext Office.
Bayes-Nash equilibrium with Incomplete Information.
Games with Imperfect Information Bayesian Games. Complete versus Incomplete Information So far we have assumed that players hold the correct belief about.
\ B A \ Draw a graph to show the expected pay-off for A. What is the value of the game. How often should A choose strategy 1? If A adopts a mixed.
Dominance Since Player I is maximizing her security level, she prefers “large” payoffs. If one row is smaller (element- wise) than another,
Extensive Games with Imperfect Information
Mixed Strategies and Repeated Games
Algorithms for solving two-player normal form games
1 Information, Control and Games Shi-Chung Chang EE-II 245, Tel: ext Office.
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.
Incomplete information: Perfect Bayesian equilibrium
Zero-sum Games The Essentials of a Game Extensive Game Matrix Game Dominant Strategies Prudent Strategies Solving the Zero-sum Game The Minimax Theorem.
Dynamic games, Stackelburg Cournot and Bertrand
5.1.Static Games of Incomplete Information
1 The Volunteer’s Dilemma (Mixed Strategies). 2 The Volunteer Dilemma Game Simultaneously and independently, players have to decide if they wish to volunteer.
Extensive Form (Dynamic) Games With Perfect Information (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.
Game theory basics A Game describes situations of strategic interaction, where the payoff for one agent depends on its own actions as well as on the actions.
Chapter 28 Game Theory.
Mixed Strategies Keep ‘em guessing.
Game Theory M.Pajhouh Niya M.Ghotbi
Nash Equilibrium: Theory
Simultaneous-Move Games: Mixed Strategies
Information, Control and Games
LECTURE 2 MIXED STRATEGY GAME
Games with Imperfect Information Bayesian Games
Lecture 20 Linear Program Duality
Molly W. Dahl Georgetown University Econ 101 – Spring 2009
Lecture Game Theory.
Presentation transcript:

Information, Control and Games Shi-Chung Chang EE-II 245, Tel: 2363-5251 ext. 245 scchang@cc.ee.ntu.edu.tw, http://recipe.ee.ntu.edu.tw/scc.htm Office Hours: Mon/Wed 1:00-2:00 pm or by appointment Yi-Nung Yang (03 ) 2655201 ext. 5205, yinung@cycu.edu.tw

Mixed Strategy

Mixed Strategy Definition: A mixed strategy of a player in a strategic game is a probability distribution over the player’s actions. i(ai) : the probability assigned by player i’s mixed strategy i to her actions ai. Pure strategy i(ai) =1

Matching Pennies p=1(Head), (1-p)= 1(Tail) q=2(Head), (1-q)= 2(Tail) Mixed Strategy pair (1, 2) = ({p,1-p},{q,1-q})

Expected Payoffs For player 1 to the strategy pair (1, 2) if she play T, the expected payoff is E1(T,2)=[q  u1(T,L)+ (1-q) u1(T,R)] if she play B, the expected payoff is E1(B,2)=[q  u1(B,L)+ (1-q) u1(B,R)] Player 1’s expected payoff pE1 (T,2)+(1-p) E1(B,2) linear function of p

Linear function of p

Best Response If E1 (T,2)>E1(B,2), player 1 chooses T (pure strategy) If E1 (T,2)<E1(B,2), player 1 chooses B (pure strategy) If E1 (T,2)=E1(B,2), all mixed strategies (p,1-p) yields the same expected payoff.

Matching Pennies No Nash equil. in pure strategy game Given player 2’s mixed strategy Player 1’s expected payoff if she chooses H E1 (H,2)= q1+(1-q) (-1) = 2q-1 Player 1’s expected payoff if she chooses T E1 (T,2)= q(-1)+(1-q) 1 = 1-2q

Best Response in Matching Pennies If 2q-1<0 (q<1/2), E1 (H,2)< E1 (T,2) Player 1 should choose T, i.e., p=0 If 2q-1>0 (q>1/2), E1 (H,2)> E1 (T,2) Player 1 should choose H, i.e., p=1 If 2q-1=1-2q (q=1/2), E1 (H,2)= E1 (T,2) Player 1 either one, i.e., p=1/2

Best response function

Best response in M-P game Mixed strategy equil. (1, 2) = ({1/2,1/2},{1/2,1/2})

Mixed Strategy Nash Equil. * is a mixed strategy Nash equilibrium if for each player i and every mixed strategy i of player i , the expected payoff to player i of i is at least as large as the expected payoff to player i of (i -i) Ei (*) Ei (i,-i) for every mixed strategy i of player i

Mixed Strategy in BoS game Player 1’s expected payoff to B: 2  q+0(1-q)=2q to S: 0  q+1(1-q)=1-q Best response if 2q>1-q (q>1/3), then she should choose B if 2q<1-q (q<1/3), then she should choose S

Best response function in BoS

Best response in BoS game Mixed strategy equil. (p,q) = ({0,0},{2/3,1/3},{1,1})

Math optimization to the BoS game Player 1 max p1(2q1)+p2(q2) s.t. p1+p2=1 p10, p2  0 Z= p1(2q1)+p2(q2) + (1- p1+p2)-1p1-2p2 Player 2 does the same reasoning.