THE “CLASSIC” 2 x 2 SIMULTANEOUS CHOICE GAMES Topic #4.

Slides:



Advertisements
Similar presentations
Concepts of Game Theory I
Advertisements

GAMES IN EEXTENSIVE AND STRATEGIC FORM Topic #7. Review: A Best Reply Given a strategy choice by the other player, your best reply to it is the strategy.
Game Theory S-1.
Chapter Twenty-Eight Game Theory. u Game theory models strategic behavior by agents who understand that their actions affect the actions of other agents.
VARIATIONS ON SIMPLE PAYOFF MATRICES Topic #6. The Payoff Matrix Given any payoff matrix, the standard assumption is – that the players choose their strategies.
Two-Player Zero-Sum Games
6-1 LECTURE 6: MULTIAGENT INTERACTIONS An Introduction to MultiAgent Systems
1 Chapter 14 – Game Theory 14.1 Nash Equilibrium 14.2 Repeated Prisoners’ Dilemma 14.3 Sequential-Move Games and Strategic Moves.
Chapter 6 Game Theory © 2006 Thomson Learning/South-Western.
Chapter 6 Game Theory © 2006 Thomson Learning/South-Western.
MIT and James Orlin © Game Theory 2-person 0-sum (or constant sum) game theory 2-person game theory (e.g., prisoner’s dilemma)
Game Theory Advertising Example 1. Game Theory What is the optimal strategy for Firm A if Firm B chooses to advertise? 2.
Chapter 15- Game Theory: The Mathematics of Competition
Multi-player, non-zero-sum games
Part 3: The Minimax Theorem
Game Theory Jacob Foley. PUfyk PUfyk
An Introduction to Game Theory Part I: Strategic Games
Game Theory Part 5: Nash’s Theorem.
2008/02/06Lecture 21 ECO290E: Game Theory Lecture 2 Static Games and Nash Equilibrium.
Chapter 6 © 2006 Thomson Learning/South-Western Game Theory.
Nash Equilibrium: Theory. Strategic or Simultaneous-move Games Definition: A simultaneous-move game consists of: A set of players For each player, a set.
Game Theory Analysis Sidney Gautrau. John von Neumann is looked at as the father of modern game theory. Many other theorists, such as John Nash and John.
Eponine Lupo.  Game Theory is a mathematical theory that deals with models of conflict and cooperation.  It is a precise and logical description of.
Decision Analysis April 11, Game Theory Frame Work Players ◦ Decision maker: optimizing agent ◦ Opponent  Nature: offers uncertain outcome  Competition:
1 Section 2d Game theory Game theory is a way of thinking about situations where there is interaction between individuals or institutions. The parties.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
QR 38, 2/22/07 Strategic form: dominant strategies I.Strategic form II.Finding Nash equilibria III.Strategic form games in IR.
Game Applications Chapter 29. Nash Equilibrium In any Nash equilibrium (NE) each player chooses a “best” response to the choices made by all of the other.
Game Theory Objectives:
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
Today: Some classic games in game theory
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.
PLAYING GAMES Topic #2. THE SOCIAL COORDINATION GAME You are in a group of six people, each of whom has an initial holding of $50 (just enough to guarantee.
GAMES AGAINST NATURE Topic #3. Games Against Nature In game theory, for reasons that will be explained later, the alternatives (e.g., LEFT and RIGHT)
CPS 170: Artificial Intelligence Game Theory Instructor: Vincent Conitzer.
Game Theory.
Chapter 12 & Module E Decision Theory & Game Theory.
A Game-Theoretic Approach to Strategic Behavior. Chapter Outline ©2015 McGraw-Hill Education. All Rights Reserved. 2 The Prisoner’s Dilemma: An Introduction.
Game Theory: introduction and applications to computer networks Game Theory: introduction and applications to computer networks Lecture 2: two-person non.
Game Theory: introduction and applications to computer networks Game Theory: introduction and applications to computer networks Introduction Giovanni Neglia.
The Science of Networks 6.1 Today’s topics Game Theory Normal-form games Dominating strategies Nash equilibria Acknowledgements Vincent Conitzer, Michael.
CPS 270: Artificial Intelligence Game Theory Instructor: Vincent Conitzer.
GAME THEORY MILOŠ FIŠAR course BPV_APEC Public Economics - 29/9/2015.
Lecture 5 Introduction to Game theory. What is game theory? Game theory studies situations where players have strategic interactions; the payoff that.
Frank Cowell: Microeconomics Game Theory: Basics MICROECONOMICS Principles and Analysis Frank Cowell March 2004.
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.
CPS 570: Artificial Intelligence Game Theory Instructor: Vincent Conitzer.
Mohsen Afsharchi Multiagent Interaction. What are Multiagent Systems?
Prisoners’ Dilemma Scenario: You and an accomplice are arrested on suspicion of committing some nasty crime The District Attorney and the police have been.
Statistics Overview of games 2 player games representations 2 player zero-sum games Render/Stair/Hanna text CD QM for Windows software Modeling.
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.
Oligopoly CHAPTER 13B. Oligopoly IRL In some markets there are only two firms. Computer chips are an example. The chips that drive most PCs are made by.
Games, Strategies, and Decision Making By Joseph Harrington, Jr. First Edition Chapter 4: Stable Play: Nash Equilibria in Discrete Games with Two or Three.
Advanced Subjects in GT Outline of the tutorials Static Games of Complete Information Introduction to games Normal-form (strategic-form) representation.
Creating Institutions to Address Externalities TMS.
Game theory Chapter 28 and 29
Q 2.1 Nash Equilibrium Ben
Chapter 15: Game Theory: The Mathematics Lesson Plan of Competition
Module 32 Game Theory.
Simultaneous Move Games: Discrete Strategies
CPS 570: Artificial Intelligence Game Theory
Game theory Chapter 28 and 29
©2011 John M. Abowd and Jennifer P. Wissink, all rights reserved.
Chapter 30 Game Applications.
Game Theory and Strategic Play
Chapter 15: Game Theory: The Mathematics Lesson Plan of Competition
Game Theory: The Nash Equilibrium
Instructor: Vincent Conitzer
Presentation transcript:

THE “CLASSIC” 2 x 2 SIMULTANEOUS CHOICE GAMES Topic #4

Two-Player Games We now turn to two-player (proper) games, i.e., games between – two interested and rational players P1 vs. P2, rather than – one player P1 vs. an indifferent Nature. The second player P2, – unlike like Nature but like P1, gets payoffs from the outcome of the games, and – like P1, makes rational choices aim at maximizing these payoffs. In a 2 x 2 game, each player has just two strategies to choose from. We look first at 2x2 games in which P1 and P2 either – choose their strategies simultaneously by “secret ballot,” or – If P1 chooses first and P2 chooses second, P2 must choose his strategy without knowing what strategy P1 has already chosen. – That is to say, in the manner of ‘Playing Games’ in class.

Matching Pennies: Coordination Version We now need two payoff numbers in each cell, one for each player. – By convention: Row Player payoff, Column player payoff. The Coordination version of Matching Pennies is a zero-conflict game; that is, – the players have identical payoff from each outcome. But despite their identical interests, they face a coordination problem. The decision principles previously identified are of no help.

Other Zero-Conflict Games The top matrix show a non- problematic zero-conflict game. – Since there is a unique best outcome, the players face a coordination problem. The bottom matrix shows a problematic zero-conflict game that results from an “embarrassment of riches.” – Since there are two outcome that are best, the player face a coordination problem. – This is strategically equivalent to Matching Pennies.

The Battle of the Sexes A Coordination Game with Conflict of Interest. – Players have a common interest in coordinating, – but conflicting interest with respect to how to coordinate – Allowing pre-play communication may actually worsen the problem. – “Let’s both have fun doing what I want to do.” Neither player has a dominant strategy. Maximin does not help: – both strategies have the same security level. If both player use maximax, they both get their minimum payoffs.

Matching Pennies: Total Conflict Version Player 1 wants to “mix” while Player 2 wants to “match.” This is a zero-sum game, because the payoffs in each cell add up to zero and, more generally, – there is no common interest between the players. Once again our decision principles are of no help.

The D-Day Landings The Zero-Sum Game between the Allies and the Germans. – Allies want to “mix”; Germans want to “match.” – This obviously is hugely oversimplified (and we’ll refine this a bit in the next topic). Inspector vs. Evader (under an arms control regime).

Prisoner’s Dilemma Two prisoners are held in jail separately and cannot communicate. The District Attorney has evidence that they jointly committed a serious crime, for which the penalty is six years in prison. However, this evidence is insufficient to convict either prisoner, in the absence of a confession by one implicating the other. But the D. A. has other evidence sufficient to convict each prisoner (without any confession) on a less serious charge, for which the penalty is two years in prison. The D. A. goes to each prisoner and offers the following deal (telling each the same offer has been made to the other): if you confess (implicating the other), I will take two years off whatever your sentence otherwise would be. Will either prisoner accept the D. A.'s offer? Would they choose differently if they could communicate? In the following PD payoff matrix, the negative payoffs indicate the number of years in prison.

Prisoner’s Dilemma (cont.) The PD Game, like Battle of Sexes, is a variable-sum game, – that is, the players have a mixture of common and conflicting interests. The PD payoff matrix itself appears to be unproblematic, in that the problem of strategic choice is “solved” by the Dominance Principle. But the resulting outcome is worse for both players than if they both had chosen their dominated strategies.

Prisoner’s Dilemma (cont.) Since the Dominance Principle produces the “inefficient” or “tragic” outcome, we know other Decision Principles do also. – “Confess” is both maximax and minimax, and – “confess” maximizes average payoffs and expected payoffs, regardless of the perceived probability that the other player confesses. The Social Dilemma Game played in class was a multi-player generalization of the PD. The PD serves as a very simple model of a stage in an arms race.

Nash Equilibrium The PD outcome “both confess/defect” is a Nash Equilibrium, because – given the strategy of the other player, neither player has an incentive to change his strategy. – Put otherwise, each player’s strategy is a best reply to the other’s strategy. In a coordination game (even with conflict of interest, i.e., the Battle of the Sexes), each coordinated outcome is an Nash equilibrium. But in the total conflict version of Matching Pennies, there is no Nash equilibrium (in “pure” strategies).

The Game of Chicken Two juvenile delinquents position their cars at opposite ends of a deserted stretch of road. With their respective gang members and girl friends looking on, they drive towards each other at high speed, each straddling the center line. The first driver to lose his nerve and swerve into his own lane to avoid a crash is revealed to be “chicken” and loses the game, while the other wins. If both swerve, the outcome is a draw. If both drive straight, the outcome is mutual disaster. A payoff matrix for Chicken appears on the following slide. – These payoff numbers have no objective meaning (like years in prison in the PD matrix).

The Game of Chicken (cont.) Neither player has a dominant strategy; for each player, “swerve” is the best reply to “straight” and “straight” is the best reply to “swerve.” That is, the best choice for each player is to do the opposite of what the other player does, and each pair of opposite strategies is a (Nash) equilibrium. But one equilibrium is a victory for Player 1 and the other for Player 2, with the victory going to the more reckless player.

The Game of Chicken (cont.) The compromise outcome (both swerve) is the symmetric outcome best for both players, but – it is not an equilibrium, and – the apparent willingness of one player to swerve encourages the other player to drive straight. In short, Chicken is a particularly nasty game. The Game of Chicken underlies the theory of bargaining tactics presented in Topics #10-11.