Chapter 28 Game Theory.

Slides:



Advertisements
Similar presentations
Game Theory Assignment For all of these games, P1 chooses between the columns, and P2 chooses between the rows.
Advertisements

This Segment: Computational game theory Lecture 1: Game representations, solution concepts and complexity Tuomas Sandholm Computer Science Department Carnegie.
Chapter Twenty-Eight Game Theory. u Game theory models strategic behavior by agents who understand that their actions affect the actions of other agents.
Bayesian Games Yasuhiro Kirihata University of Illinois at Chicago.
1 Chapter 14 – Game Theory 14.1 Nash Equilibrium 14.2 Repeated Prisoners’ Dilemma 14.3 Sequential-Move Games and Strategic Moves.
1 Game Theory. By the end of this section, you should be able to…. ► In a simultaneous game played only once, find and define:  the Nash equilibrium.
Chapter 6 Game Theory © 2006 Thomson Learning/South-Western.
Chapter 6 Game Theory © 2006 Thomson Learning/South-Western.
Multi-player, non-zero-sum games
Game-theoretic analysis tools Necessary for building nonmanipulable automated negotiation systems.
Chapter 11 Game Theory and the Tools of Strategic Business Analysis.
Game Theory.
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 And Competition Strategies
An Introduction to Game Theory Part I: Strategic Games
2008/02/06Lecture 21 ECO290E: Game Theory Lecture 2 Static Games and Nash Equilibrium.
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.
Algoritmi per Sistemi Distribuiti Strategici
1 1 Lesson overview BA 592 Lesson I.10 Sequential and Simultaneous Move Theory Chapter 6 Combining Simultaneous and Sequential Moves Lesson I.10 Sequential.
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.
Static Games of Complete Information: Equilibrium Concepts
Lectures in Microeconomics-Charles W. Upton Game Theory.
An introduction to game theory Today: The fundamentals of game theory, including Nash equilibrium.
An introduction to game theory Today: The fundamentals of game theory, including 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.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
An introduction to game theory Today: The fundamentals of game theory, including Nash equilibrium.
© 2005 Pearson Education Canada Inc Chapter 15 Introduction to Game Theory.
Strategic Decisions in Noncooperative Games Introduction to Game Theory.
Game-theoretic analysis tools Tuomas Sandholm Professor Computer Science Department Carnegie Mellon University.
\ 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.
P2 P1 Confess No (-1,-1) Confess (-5,0)No (0,-5)(-3,-3) TABLE 1 Battle of Sexes and Prisoner’s Dilemma Prisoner’s Dilemma Husband Wife Basket- ball Opera.
Lecture 5 Introduction to Game theory. What is game theory? Game theory studies situations where players have strategic interactions; the payoff that.
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.
Intermediate Microeconomics Game Theory. So far we have only studied situations that were not “strategic”. The optimal behavior of any given individual.
5.1.Static Games of Incomplete Information
Lec 23 Chapter 28 Game Theory.
Entry Deterrence Players Two firms, entrant and incumbent Order of play Entrant decides to enter or stay out. If entrant enters, incumbent decides to fight.
Day 9 GAME THEORY. 3 Solution Methods for Non-Zero Sum Games Dominant Strategy Iterated Dominant Strategy Nash Equilibrium NON- ZERO SUM GAMES HOW TO.
Advanced Subjects in GT Outline of the tutorials Static Games of Complete Information Introduction to games Normal-form (strategic-form) representation.
Lecture III: Normal Form Games Recommended Reading: Dixit & Skeath: Chapters 4, 5, 7, 8 Gibbons: Chapter 1 Osborne: Chapters 2-4.
Chapter 12 Game Theory Presented by Nahakpam PhD Student 1Game Theory.
Game theory Chapter 28 and 29
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.
Microeconomics Course E
Intermediate Microeconomics
Nash Equilibrium A strategy combination (a,b) is a Nash equilibrium for two players if neither player would unilaterally deviate if he expected the other.
Simultaneous Move Games: Discrete Strategies
Game theory Chapter 28 and 29
GAME THEORY AND APPLICATIONS
Strategic Decision Making in Oligopoly Markets
Choices Involving Strategy
Multiagent Systems Game Theory © Manfred Huber 2018.
Game Theory Chapter 12.
Learning 6.2 Game Theory.
Managerial Economics Kyle Anderson
Chapter 30 Game Applications.
GAME THEORY AND APPLICATIONS
Multiagent Systems Repeated Games © Manfred Huber 2018.
Finding Best Responses by Underlining Payoffs
Game Theory and Strategic Play
Molly W. Dahl Georgetown University Econ 101 – Spring 2009
UNIT II: The Basic Theory
Lecture Game Theory.
Introduction to Game Theory
Introduction to Game Theory
Presentation transcript:

Chapter 28 Game Theory

Three fundamental elements to describe a game: Players, (pure) strategies or actions, payoffs.

Color Matching B b r 1, -1 -1, 1 b A r -1, 1 1, -1

Payoff matrices for Two-person games. Simultaneous(-move) games. Finite games: Both the numbers of players and of alternative pure strategies are finite

The Prisoner’s Dilemma B Confess Deny Confess A Deny -3*, -3* 0, -5 -5, 0 -1, -1

Method of iterated elimination of strictly dominated strategies. Dominant strategies, and dominated strategies. Method of iterated elimination of strictly dominated strategies.

The Prisoner’s Dilemma shows also that a Nash equilibrium does not necessarily lead to a Pareto efficient outcome. Two-win games.

A pair of strategies is a Nash equilibrium if A’s choice is optimal given B’s choice, and vice versa. Nash is a situation, or a strategy combination of no incentive to deviate unilaterally.

Battle of Sexes Girl Soccer Ballet 2*, 1* 0, 0 Soccer Boy Ballet 2*, 1* 0, 0 Soccer Boy Ballet -1, -1 1*, 2*

Method of underlining relatively advantageous strategies. Double underlining gives Nash. There can be no, one, and multiple (pure) Nash equilibria.

Price Struggle Pepsi L H L Coke H 3*, 3* 6, 1 1, 6 5, 5

How if there is no Nash of pure strategies? Mixed strategies (by probability). Method of response functions.

Color Matching again B b r q 1-q 1, -1 -1, 1 b p A r 1-p -1, 1 1, -1

With EUA = 1 pq + (-1)p (1-q) + (-1) (1-p) q + 1 (1-p) (1-q) = pq - p + pq - q + pq + 1 - p - q + pq = 4 pq - 2 p - 2 q + 1 = 2 p (2 q - 1) + (1 - 2 q ) , we have 1 if q > 1/2 , p = [0, 1] if q = 1/2 , 0 if q < 1/2 .

Similarly, 0 if p > 1/2 , q = [0, 1] if p = 1/2 , 1 if p < 1/2 . q 1 N 1 p

Method of response functions: The intersections of response functions give Nash equilibria ((p*, q*) = (1/2, 1/2) in example) Nash Theorem: There is always a ( maybe “mixed”) Nash equilibrium for any finite game

Sequential games. Games in extensive form versus in normal form.

Battle of Sexes again Ballet ( 1, 2) Girl ( -1, -1) Ballet Soccer Boy ( 0, 0) Soccer ( 2, 1) Soccer

Strategies as Plans of Actions. Boy’s strategies: Ballet, and Soccer. Girl’s Strategies: Ballet strategy; Soccer strategy; Strategy to follow; and Strategy to oppose.