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.

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.

Clicker Question-A Chicken Game 0, 0 0, 1 1, 0 -10, -10 Swerve Hang Tough Swerve Hang Tough Player 2 Pllayer 1 Does either player have a dominant strategy?

Mixed Strategies CMPT 882 Computational Game Theory Simon Fraser University Spring 2010 Instructor: Oliver Schulte.

Stackelberg -leader/follower game 2 firms choose quantities sequentially (1) chooses its output; then (2) chooses it output; then the market clears This.

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 “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.

Working Some Problems. Telephone Game How about xexed strategies? Let Winnie call with probability p and wait with probability 1-p. For what values of.

An Introduction to Game Theory Part I: Strategic Games

Game Theory Part 5: Nash’s Theorem.

Chapter 6 © 2006 Thomson Learning/South-Western Game Theory.

1 Business System Analysis & Decision Making - Lecture 5 Zhangxi Lin ISQS 5340 July 2006.

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.

Social Networks 101 P ROF. J ASON H ARTLINE AND P ROF. N ICOLE I MMORLICA.

Playing in the Dark Problems from Ch 8. The OS2 story Introduced by IBM in 1987 to compete with MS Windows. Faster and more reliable than Windows but.

Intro to Game Theory Revisiting the territory we have covered.

Todd and Steven Divide the Estate Problem Bargaining over 100 pounds of gold Round 1: Todd makes offer of Division. Steven accepts or rejects. Round.

Game Theory Lecture Jan 18. In Bertrand’s model of oligopoly A)Each firm chooses its quantity as the best response to the quantity chosen by the other(s).

Games of pure conflict two person constant sum. Two-person constant sum game Sometimes called zero-sum game. The sum of the players’ payoffs is the same,

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.

Lectures in Microeconomics-Charles W. Upton Game Theory.

Lectures in Microeconomics-Charles W. Upton Simple Business Games.

Simple Business Games. How much to Produce Dominant Strategy Nash Equilibrium.

Outline  In-Class Experiment on a Coordination Game  Test of Equilibrium Selection I :Van Huyck, Battalio, and Beil (1990)  Test of Equilibrium Selection.

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.

Game Theory Here we study a method for thinking about oligopoly situations. As we consider some terminology, we will see the simultaneous move, one shot.

Lecture Slides Dixit and Skeath Chapter 4

UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.

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 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 Theoretic Analysis of Oligopoly lr L R 0000 L R 1 22 The Lane Selection Game Rational Play is indicated by the black arrows.

Today: Some classic games in game theory

EC941 - Game Theory Prof. Francesco Squintani Lecture 2 1.

1. problem set 6 from Osborne’s Introd. To G.T. p.210 Ex p.234 Ex p.337 Ex. 26,27 from Binmore’s Fun and Games.

Assoc. Prof. Yeşim Kuştepeli1 GAME THEORY AND APPLICATIONS UNCERTAINTY AND EXPECTED UTILITY.

Standard and Extended Form Games A Lesson in Multiagent System Based on Jose Vidal’s book Fundamentals of Multiagent Systems Henry Hexmoor, SIUC.

Introduction to Game Theory application to networks Joy Ghosh CSE 716, 25 th April, 2003.

\ 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.

Game Theory: introduction and applications to computer networks Game Theory: introduction and applications to computer networks Lecture 2: two-person non.

The Science of Networks 6.1 Today’s topics Game Theory Normal-form games Dominating strategies Nash equilibria Acknowledgements Vincent Conitzer, Michael.

Lecture 5A Mixed Strategies and Multiplicity Not every game has a pure strategy Nash equilibrium, and some games have more than one. This lecture shows.

Mixed Strategies and Repeated Games

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.

Strategic Behavior in Business and Econ Static Games of complete information: Dominant Strategies and Nash Equilibrium in pure and mixed strategies.

Algorithms for solving two-player normal form games

Zero-sum Games The Essentials of a Game Extensive Game Matrix Game Dominant Strategies Prudent Strategies Solving the Zero-sum Game The Minimax Theorem.

Games of pure conflict two-person constant sum games.

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.

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.

Midterm Scores Total of 200 points, 40 per question. A B— C— D—50-79 F

By: Donté Howell Game Theory in Sports. What is Game Theory? It is a tool used to analyze strategic behavior and trying to maximize his/her payoff of.

Midterm Scores Total of 200 points, 40 per question. A B— C— D—50-79 F

Games of pure conflict two-person constant sum games.

Working Some Problems.

Mixed Strategies Keep ‘em guessing.

Microeconomics Course E

Chapter 15: Game Theory: The Mathematics Lesson Plan of Competition

Somebody’s got to do it. Somebody’s got to do it.

Introduction to Game Theory

Games of pure conflict two person constant sum

Chapter 30 Game Applications.

Molly W. Dahl Georgetown University Econ 101 – Spring 2009

Chapter 15: Game Theory: The Mathematics Lesson Plan of Competition

Lecture Game Theory.

Presentation transcript:

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 Nash equilibrium and no pure strategy Nash equilibria D) Two mixed strategy Nash equilibria and no pure strategy Nash equilibria E)One mixed strategy Nash equilibrium and two pure strategy Nash equilibria.

If a game has at least one pure strategy Nash equilibrium A) It must also have at least one mixed strategy Nash equilibrium that is not a pure strategy Nash equilibrium B) It will not have a mixed strategy Nash equilibrium C) It might or might not have a mixed strategy Nash equilibrium that is not a pure strategy equilibrium D) It must have a dominant strategy for each player.

Field Goal or Touchdown? Field goal is worth 3 points. Touchdown is worth 7 points. Which is better? Sure field goal or probability ½ of touchdown?

Finding the coach’s von Neumann Morgenstern utilities Set utility of touchdown u(T)=1 Set utility no score u(0)=0 The utility of a gamble in which you get a touchdown with probability p and no score with probability 1-p is pu(T)+(1-p)u(0). What utility u(F) to assign to a sure field goal? Let p* be the probability such that the coach is indifferent between scoring a touchdown with probability p* (with no score with prob 1-p*) and having a sure field goal. Then u(F)=p*u(T)+(1-p*)u(0)=p*x1+(1-p*)x0=p*.

Advanced Hide and Seek -1,1 1,-1 3,-3 -1,1 Plains Forest Hider’s Choice Seeker’s Choice Plains 1-p Forest q p 1-q

Guard and shoot game D, -D A, -A B, -B C, -C Left Right Left Right Shooter uses Guard protects q 1-q P 1-p Probabilities of scoring: A>C, B>D, B>C

Nash Demand Game There are N dollars to be divided among 2 players. Each player gets to make a demand. The demand must be a positive integer. If sum of demands is not greater than N, each gets what she demanded. If sum of demands exceeds N, both get nothing.

Nash demand game, N=3

A Game of Chicken Two teenagers have their fathers’ Buicks and decide to play Chicken. There are two strategies, Swerve and Don’t Swerve. If neither swerves, disastrous consequence for both. Like the hawk-dove game. Alternative story. Two countries have mobilized their armies with threats and counterthreats. Will one of them yield? If not, there is a disastrous war.

A Chicken payoff matrix