Beliefs and Sequential Equilibrium

Similar documents
ECO 5341 Signaling Games: Another Example. Saltuk Ozerturk (SMU)

Games in Extensive Form

final examination on May 31 Topics from the latter part of the course (covered in homework assignments 4-7) include:

MS&E 246: Lecture 15 Perfect Bayesian equilibrium. Ramesh Johari

Perfect Bayesian Equilibrium

Incomplete Information. So far in this course, asymmetric information arises only when players do not observe the action choices of other players.

Basics of Game Theory

CHAPTER LEARNING OUTCOMES. By the end of this section, students will be able to:

February 11, 2015 :1 +0 (1 ) = :2 + 1 (1 ) =3 1. is preferred to R iff

CSCI 699: Topics in Learning and Game Theory Fall 2017 Lecture 3: Intro to Game Theory. Instructor: Shaddin Dughmi

Topic 1: defining games and strategies. SF2972: Game theory. Not allowed: Extensive form game: formal definition

Refinements of Sequential Equilibrium

Algorithmic Game Theory and Applications. Kousha Etessami

Summary Overview of Topics in Econ 30200b: Decision theory: strong and weak domination by randomized strategies, domination theorem, expected utility

Simon Fraser University Fall 2014

EconS 424- Strategy and Game Theory Reputation and Incomplete information in a public good project How to nd Semi-separating equilibria?

Game Theory: Introduction. Game Theory. Game Theory: Applications. Game Theory: Overview

Reading Robert Gibbons, A Primer in Game Theory, Harvester Wheatsheaf 1992.

Dynamic Games of Complete Information

Repeated Games. Economics Microeconomic Theory II: Strategic Behavior. Shih En Lu. Simon Fraser University (with thanks to Anke Kessler)

Introduction: What is Game Theory?

Chapter 13. Game Theory

GAME THEORY: ANALYSIS OF STRATEGIC THINKING Exercises on Multistage Games with Chance Moves, Randomized Strategies and Asymmetric Information

Game Theory and Randomized Algorithms

ECON 282 Final Practice Problems

2. The Extensive Form of a Game

G5212: Game Theory. Mark Dean. Spring 2017

ECO 199 B GAMES OF STRATEGY Spring Term 2004 B February 24 SEQUENTIAL AND SIMULTANEOUS GAMES. Representation Tree Matrix Equilibrium concept

Appendix A A Primer in Game Theory

The extensive form representation of a game

3 Game Theory II: Sequential-Move and Repeated Games

DYNAMIC GAMES with incomplete information. Lecture 11

Dynamic games: Backward induction and subgame perfection

Dynamic Games: Backward Induction and Subgame Perfection

Signaling Games

Lecture 9. General Dynamic Games of Complete Information

Resource Allocation and Decision Analysis (ECON 8010) Spring 2014 Foundations of Game Theory

State Trading Companies, Time Inconsistency, Imperfect Enforceability and Reputation

/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Algorithmic Game Theory Date: 12/6/18

Solution Concepts 4 Nash equilibrium in mixed strategies

Extensive Games with Perfect Information. Start by restricting attention to games without simultaneous moves and without nature (no randomness).

INSTRUCTIONS: all the calculations on the separate piece of paper which you do not hand in. GOOD LUCK!

Fictitious Play applied on a simplified poker game

Game theory Computational Models of Cognition

Your Name and ID. (a) ( 3 points) Breadth First Search is complete even if zero step-costs are allowed.

Introduction to Industrial Organization Professor: Caixia Shen Fall 2014 Lecture Note 6 Games and Strategy (ch.4)-continue

Game theory lecture 5. October 5, 2013

Introduction to Game Theory

Sequential games. We may play the dating game as a sequential game. In this case, one player, say Connie, makes a choice before the other.

1. Simultaneous games All players move at same time. Represent with a game table. We ll stick to 2 players, generally A and B or Row and Col.

(b) In the position given in the figure below, find a winning move, if any. (b) In the position given in Figure 4.2, find a winning move, if any.

Finite games: finite number of players, finite number of possible actions, finite number of moves. Canusegametreetodepicttheextensiveform.

Alternation in the repeated Battle of the Sexes

Computational Methods for Non-Cooperative Game Theory

Information and Decisions

International Economics B 2. Basics in noncooperative game theory

Mohammad Hossein Manshaei 1394

Math 152: Applicable Mathematics and Computing

Game Theory. Wolfgang Frimmel. Subgame Perfect Nash Equilibrium

DYNAMIC GAMES. Lecture 6

Backward induction is a widely accepted principle for predicting behavior in sequential games. In the classic

Extensive-Form Games with Perfect Information

ECON 2100 Principles of Microeconomics (Summer 2016) Game Theory and Oligopoly

THE GAME THEORY OF OPEN-SOURCE SOFTWARE

Lecture 11 Strategic Form Games

Dominance and Best Response. player 2

CS510 \ Lecture Ariel Stolerman

Advanced Microeconomics (Economics 104) Spring 2011 Strategic games I

Introduction to Game Theory

Extensive-Form Correlated Equilibrium: Definition and Computational Complexity

Copyright 2008, Yan Chen

Detailed description of a dynamic game. (i) Players Nature, M, and W. Extensive Form. (ii) Game Tree. (ii) Game Tree

Game Theory and Economics Prof. Dr. Debarshi Das Humanities and Social Sciences Indian Institute of Technology, Guwahati

Game Theory and Economics of Contracts Lecture 4 Basics in Game Theory (2)

Introduction to Auction Theory: Or How it Sometimes

The Future of Network Science: Guiding the Formation of Networks

Lecture 7: Dominance Concepts

Robert Aumann s Game and Economic Theory

Game Theory ( nd term) Dr. S. Farshad Fatemi. Graduate School of Management and Economics Sharif University of Technology.

Game Theory: The Basics. Theory of Games and Economics Behavior John Von Neumann and Oskar Morgenstern (1943)

Instructions [CT+PT Treatment]

Behavioral Strategies in Zero-Sum Games in Extensive Form

Arpita Biswas. Speaker. PhD Student (Google Fellow) Game Theory Lab, Dept. of CSA, Indian Institute of Science, Bangalore

THEORY: NASH EQUILIBRIUM

ECON 312: Games and Strategy 1. Industrial Organization Games and Strategy

SF2972: Game theory. Mark Voorneveld, February 2, 2015

Aboa Centre for Economics

Modeling Security Decisions as Games

RECITATION 8 INTRODUCTION

Extensive Form Games. Mihai Manea MIT

Advanced Microeconomics: Game Theory

GAME THEORY: STRATEGY AND EQUILIBRIUM

7. Suppose that at each turn a player may select one pile and remove c chips if c =1

CMU Lecture 22: Game Theory I. Teachers: Gianni A. Di Caro

DEPARTMENT OF ECONOMICS WORKING PAPER SERIES. Stable Networks and Convex Payoffs. Robert P. Gilles Virginia Tech University

Supplementary Appendix Commitment and (In)Efficiency: a Bargaining Experiment

Game playing. Outline

Introduction to Experiments on Game Theory

Leandro Chaves Rêgo. Unawareness in Extensive Form Games. Joint work with: Joseph Halpern (Cornell) Statistics Department, UFPE, Brazil.

Lecture Notes on Game Theory (QTM)

Transcription:

Beliefs and Sequential Equilibrium to solve a game of incomplete information, we should look at the beliefs of the uninformed player(s) suppose that player 2 is in an information set which contains two nodes (such as the information set leading from player 1 s choice of action a in game 6) his beliefs are the probabilities that he assigns to the nodes in the information set that is, in the example, his beliefs are the probabilities he assigns to the event nature chose its top action, given that he has just observed player 1 choose a so part of solving the game is calculating the probability P (top a) : the probability that nature chose top, given that player 1 just chose a Typeset by FoilTEX 1

Bayes s Rule person 2 s prior probability assigned to nature choosing top was 1/4, in game 6 but he has acquired some information since then : player 1 has chosen a we will require that player 2 s posterior beliefs (after he has observed an action by player 1) be consistent with Bayes s Rule P (top a) = P (a top)p (top) P (a top)p (top) + P (a bot)p (bot) (1) (where top and bot are nature s two moves) and P (top) and P (bot) are his prior beliefs : 1/4 and 3/4 in example 6 Typeset by FoilTEX 2

given a set of beliefs, player 2 can figure out his optimal strategy : if player 1 just played a, then, in example 6, player 2 s payoff from choosing the action B would be 2P (top a) + 12P (bot a) = 12 10P (top a) (2) and his payoff from choosing A would be 5P (top a) required (so far) i player 2 s beliefs are consistent with Bayes s Rule ii player 2 s choice of action (at each node) maximizes his expected payoffs given his beliefs Typeset by FoilTEX 3

so in example 6, he would choose the action A if and only if P (top a) 4 5 (3) now where did the probabilities such as P (a top) used in Bayes s Rule come from? P (a top) is the probability that player 1 chooses the action a, given that she just observed nature choose top of course the P (a top) was used by player 2 in his calculation, in updating his beliefs ; it s his guess as to the probability with which player 1 would choose this action, given her observation of nature s move in equilibrium, player 2 s guesses have to be correct that is Typeset by FoilTEX 4

iii the probabilities P (a top) (etcetera) that player 2 uses in his Bayesian updating must be the actual probabilities with which player 1 chooses this action (a) at this node (top) and what determines the probability with which player 1 chooses her actions? she chooses her actions to maximize her expected payoff given the actions that she expects player 2 to take in equilibrium, her guesses about player 2 s strategies must be correct, so that we require iv player 1 will choose action a with positive probability at the node top only if a maximizes her expected payoff, given player 2 s choices of actions at subsequent nodes Typeset by FoilTEX 5

Sequential Equilibrium a set of mixed strategies for player 1, of mixed strategies by player 2, and of beliefs for player 2 will constitute a sequential equilibrium to the game only if they obey requirements i iv actually, to be a sequential equilibrium, a set of strategies and beliefs must also satisfy an additional technical requirement, outlined in definition 7.20 in Jehle and Reny ; an equilibrium satisfying (only) i iv is a perfect Bayesian equilibrium, which is a (very slightly) weaker equilibrium concept Theorem 7.7: every finite game of incomplete information has at least one sequential equilibrium Typeset by FoilTEX 6

Extensive Form Game 6 a sequential equilibrium : player 1 s strategy : if nature s move was top, play b : if nature s move was bot, play a player 2 s beliefs : P (top a) = 0.00 P (top b) = 1.00 player 2 s strategy : always play B why is this a sequential equilibrium? Typeset by FoilTEX 7

Bayes s Rule : since 1 plays a (for certain) if and only if nature played bot, if player 2 sees a, he knows nature s move was bot, and if he sees b he knows nature s move was top player 2 s best response : given his beliefs if 1 played a, then his payoff from A is 0 and from B is 12 4 if 1 played b his payoff from A is 2 and from B is player 1 s best response : player 2 always plays B so if nature s move was top, a gives her 8 and b gives her 12 if nature s move was bot, a gives her 12 and b gives her 3 that s it Typeset by FoilTEX 8

Extensive Form Game 7 a sequential equilibrium : player 1 s strategy : if nature plays top, play a with probability 8/9, and b with probability 1/9 if nature plays bot, play a for sure player 2 s beliefs player 2 s strategy : P (top a) = 8 11 P (top b) = 1 if 1 plays a, play A with probability 1/3 and B with probability 2/3 if 1 plays b, play A for sure Typeset by FoilTEX 9

that s not the only sequential equilibrium here s another player 1 s strategy : play a no matter what is nature s move player 2 s beliefs : P (top a) = 3 4 P (top b) = 1 5 player 2 s strategy if 1 plays a, play A for sure if 1 plays b, play B for sure where did that P (top b) come from? Typeset by FoilTEX 10

any beliefs about P (top b) are consistent with Bayes s Rule since b never actually gets chosen by player 1 along the equilibrium path out of equilibrium beliefs Typeset by FoilTEX 11