Game Theory. Zero sum games

Size: px
Start display at page:

Download "Game Theory. Zero sum games"

Transcription

1 Game Theory Lecture 13 Zero sum games In zero sum games, payoffs in each cell sum up to zero Movement diagram 1

2 Zero sum games Minimax = maximin = value of the game The game may have mulfple saddle points Zero sum games Or it may have no saddle points To find the value of such game, consider mixed strategies 2

3 Zero sum games If there is more strategies, you don t know which one will be part of opfmal mixed strategy. Let Column mixed strategy be (x,1 x) Then Raw will try to maximize Zero sum games Column will try to choose x to minimize the upper envelope 3

4 Zero sum games Tranform into Linear Programming In the fivies, Davenport studied a village of 200 people on the south shore of Jamaica, whose inhabitants made their living by fishing. Fishing on Jamaica 4

5 Twenty six fishing crews in sailing, dugout canoes fish this area [fishing grounds extend outward from shore about 22 miles] by se9ng fish pots, which are drawn and reset, weather and sea permi9ng, on three regular fishing days each week The fishing grounds are divided into inside and outside banks. The inside banks lie from 5 15 miles offshore, while the outside banks all lie beyond Because of special underwater contours and the locaeon of one prominent headland, very strong currents set across the outside banks at frequent intervals These currents are not related in any apparent way to weather and sea condieons of the local region. The inside banks are almost fully protected from the currents. [Davenport 1960] Jamaica on a map 5

6 Strategies There were 26 wooden canoes. The captains of the canoes might adopt 3 fishing strategies: IN put all pots on the inside banks OUT put all pots on the outside banks IN OUT) put some pots on the inside banks, some pots on the outside Advantages and disadvantages It takes Fme to reach outside banks, so those who use OUT or IN OUT can set fewer pots When the current is running, it is harmful to outside pots: marks are dragged away, pots may be smashed while moving, changes in temeperature may kill fish inside the pots, etc. The outside banks produce higher quality fish, both in variafes and in size. If many outside fish are available, they may drive the inside fish off the market. The OUT and IN OUT strategies require befer canoes. Their captains dominate the sport of canoe racing, which is presfgious and offers large rewards. 6

7 CollecFng data Davenport collected the data concerning the fishermen average monthly profit depending on the fishing strategies they used to adopt. Fishermen\Current FLOW NO FLOW IN 17,3 11,5 OUT 4,4 20,6 IN OUT 5,2 17,0 Zero sum game??? The problem of vicious current ; p current s strategy Fishermen problem; q fishermen strategy 7

8 Graphical solufon of the current s problem SoluFon: p=0.31 IN OUT IN OUT Mixed strategy of the current Maximin and minimax Fishers' mixed strategy objective function q1 q2 q3 Maximize 13,31 0,67 0,00 0,33 Expected payoff of the current when FLOW 13,31 >= 13,31 NO FLOW 13,31 >= 13,31 probabilities 1,00 = 1,00 objective Mixed strategy of the current function p 1-p minimize 13,31 0,31 0,69 Expected payoff from strategy: IN 13,31 <= 13,31 OUT 12,79 <= 13,31 IN_OUT 13,31 <= 13,31 probabilities 1,00 = 1,00 8

9 Forecast and observafon Game theory predicts No fishermen risks fishing outside Strategy 67% IN, 33% IN OUT [Payoff: 13.31] OpFmal current s strategy 31% FLOW, 69% NO FLOW ObservaMon shows No fishermen risks fishing outside Strategy 69% IN, 31% IN OUT [Payoff: 13.38] Current s strategy : 25% FLOW, 75% NO FLOW The similarity is striking Davenport s finding went unchallenged for several years UnFl Current is not vicious Kozelka 1969 and Read, Read 1970 pointed out a serious flaw: The current is not a reasoning enfty and cannot adjust to fishermen changing their strategies. Hence fishermen should use Expected Value principle: Expected payoff of the fishermen: IN: 0.25 x x 11.5 = OUT: 0.25 x ( 4.4) x 20.6 = IN OUT: 0.25 x x 17.0 = Hence, all of the fishermen should fish OUTside. Maybe, they are not well adapted aver all 9

10 Current may be vicious aver all The current does not reason, but it is very risky to fish outside. Even if the current runs 25% of the Fme ON AVERAGE, it might run considerably more or less in the short run of a year. Suppose one year it ran 35% of the Fme. Expected payoffs: IN: 0.35 x x 11.5 = OUT: 0.35 x ( 4.4) x 11.5 = IN OUT: 0.35 x x 17.0 = By treafng the current as their opponent, fishermen GUARANTEE themselves payoff of at least Fishermen pay 1.05 pounds as insurance premium Actual (25%) Vicious (31%) 35% OpFmal Actual OUT Consider the following game Mr Raw Mrs Column A B A (2,6) (10,5) B (4,8) (0,0) 10

11 Security level Mr Raw s game is a zero sum game with Mr Raw s payoffs unchaged Mr Raw Mrs Column A B A (2,6) (10,5) B (4,8) (0,0) Mr Raw X A B A (2,-2) (10,-10) B (4,-4) (0,0) Mr Raw s security level is the value of Mr Raw s game: No saddle point, so mixed strategy x=5/6, expected payoff=10/3=value of Mr Raw s game. Security level Mrs Column s game is a zero sum game with Mrs Column s payoffs unchaged Mr Raw Mrs Column A B A (2,6) (10,5) B (4,8) (0,0) Mrs Column A B A (-6,6) (-5,5) B (-8,8) (0,0) Mrs Column s security level is the value of Mrs Column s game: There is a saddle point 6 So 6=value of Mrs Column s game. X 11

12 Nash arbitrafon Scheme Up to this point, no cooperafon btw. players Now different approach: what is a reasonable outcome to the game? Take again our previous game Mrs Column A B A (2,6) (10,5) Mr Raw B (4,8) (0,0) Egalitarian proposal: choose the outcome with the largest total payoff. Then split it equally. (15/2 for each) Two major flaws of this approach: Payoffs are uflifes. They cannot be meaningfully added or transferred across individuals. Neglects the asymmetries of strategic posifon in the game. (Mrs. Column posifon in the game above is strong) Nash arbitrafon scheme Challenge: to find a method of arbitrafng games which: Does not involve illegifmate manipulafon of uflifes Does take into account strategic ineqalifes Has a claim to fairness First good idea: von Neumann, Morgenstern (1944): any reasonable solufon to a non zero sum game should be: Pareto opmmal At or above the security level for both players The set of such outcomes (pure or mixed) is called the negomamon set of the game. 12

13 Payoff polygon and Pareto efficient points Mrs Column s payoff (4,8) (2,6) Pareto efficient fronmer (10,5) (0,0) Mr Raw s payoff Status Quo and negofafon set Mrs Column s payoff (4,8) NegoMaMon set 6 (2,6) SQ (10,5) (0,0) 10/3 Mr Raw s payoff 13

14 Nash 1950 arbitrafon scheme What point in the negofafon set do we choose? Nash arbitrafon scheme: Axioms: 1. RaMonality: The solufon lies in the negofafon set 2. Linear invariance: If we linearly transform all the uflifes, the solufons will also be linearly transformed 3. Symmetry: If the polygon happens to be symmetric about the line of slope +1 through SQ, then the solufon should be on this line as well 4. Independence of Irrelevant AlternaMves: Suppose N is the solufon point for a polygon P with status quo point SQ. Suppose Q is another polygon which contains both SQ and N, and is totally contained in P. Then N should also be the solufon point for Q with status quo point SQ. Independence of Irrelevant AlternaFves graphically N SQ Suppose N is the solufon point for a polygon P with status quo point SQ. Suppose Q is another polygon which contains both SQ and N, and is totally contained in P. Then N should also be the solufon point for Q with status quo point SQ. 14

15 Nash 1950 Theorem Theorem: There is one and only one arbitramon scheme which safsfies Axioms 1 4. It is this: if SQ=(x 0,y 0 ), then the arbitrated solufon point N is the point (x,y) in the polygon with x x 0, and y y 0, which maximizes the product (x x 0 )(y y 0 ). Nash solufon our example In our example Nash solufon is (5 2 / 3, 7 1 / 6 ) Mrs Column s payoff (4,8) 6 (2,6) SQ (5 2 / 3, 7 1 / 6 ) (10,5) (0,0) 10/3 Mr Raw s payoff 15

16 ApplicaFon The management of a factory is negofafng a new contract with the union represenfng its workers The union demands new benefits: One dollar per hour across the board raise (R) Increased pension benefits (P) Managements demands concessions: Eliminate the 10:00 a.m. coffee break (C) Automate one of the assembly checkpoints (reducfon necessary) (A) You have been called as an arbitrator. 16

15.053/8 February 28, person 0-sum (or constant sum) game theory

15.053/8 February 28, person 0-sum (or constant sum) game theory 15.053/8 February 28, 2013 2-person 0-sum (or constant sum) game theory 1 Quotes of the Day My work is a game, a very serious game. -- M. C. Escher (1898-1972) Conceal a flaw, and the world will imagine

More information

MATH 121 GAME THEORY REVIEW

MATH 121 GAME THEORY REVIEW MATH 121 GAME THEORY REVIEW ERIN PEARSE Contents 1. Definitions 2 1.1. Non-cooperative Games 2 1.2. Cooperative 2-person Games 4 1.3. Cooperative n-person Games (in coalitional form) 6 2. Theorems and

More information

Game Theory: Minimax, Maximin, and Iterated Removal Naima Hammoud

Game Theory: Minimax, Maximin, and Iterated Removal Naima Hammoud Game Theory: Minimax, Maximin, and Iterated Removal Naima Hammoud March 14, 17 Last Lecture: expected value principle Colin A B Rose A - - B - Suppose that Rose knows Colin will play ½ A + ½ B Rose s Expectations

More information

Applying Risk Theory to Game Theory Tristan Barnett. Abstract

Applying Risk Theory to Game Theory Tristan Barnett. Abstract Applying Risk Theory to Game Theory Tristan Barnett Abstract The Minimax Theorem is the most recognized theorem for determining strategies in a two person zerosum game. Other common strategies exist such

More information

MAT 4250: Lecture 1 Eric Chung

MAT 4250: Lecture 1 Eric Chung 1 MAT 4250: Lecture 1 Eric Chung 2Chapter 1: Impartial Combinatorial Games 3 Combinatorial games Combinatorial games are two-person games with perfect information and no chance moves, and with a win-or-lose

More information

Using the Maximin Principle

Using the Maximin Principle Using the Maximin Principle Under the maximin principle, it is easy to see that Rose should choose a, making her worst-case payoff 0. Colin s similar rationality as a player induces him to play (under

More information

GAME THEORY. Game theory. The odds and evens game. Two person, zero sum game. Prototype example

GAME THEORY. Game theory. The odds and evens game. Two person, zero sum game. Prototype example Game theory GAME THEORY (Hillier & Lieberman Introduction to Operations Research, 8 th edition) Mathematical theory that deals, in an formal, abstract way, with the general features of competitive situations

More information

Thursday, March 3

Thursday, March 3 5.53 Thursday, March 3 -person -sum (or constant sum) game theory -dimensional multi-dimensional Comments on first midterm: practice test will be on line coverage: every lecture prior to game theory quiz

More information

Best counterstrategy for C

Best counterstrategy for C Best counterstrategy for C In the previous lecture we saw that if R plays a particular mixed strategy and shows no intention of changing it, the expected payoff for R (and hence C) varies as C varies her

More information

Chapter 10: Mixed strategies Nash equilibria, reaction curves and the equality of payoffs theorem

Chapter 10: Mixed strategies Nash equilibria, reaction curves and the equality of payoffs theorem Chapter 10: Mixed strategies Nash equilibria reaction curves and the equality of payoffs theorem Nash equilibrium: The concept of Nash equilibrium can be extended in a natural manner to the mixed strategies

More information

Game Theory - Lecture #8

Game Theory - Lecture #8 Game Theory - Lecture #8 Outline: Randomized actions vnm & Bernoulli payoff functions Mixed strategies & Nash equilibrium Hawk/Dove & Mixed strategies Random models Goal: Would like a formulation in which

More information

Game theory and applications: Lecture 1

Game theory and applications: Lecture 1 Game theory and applications: Lecture 1 Adam Szeidl September 20, 2018 Outline for today 1 Some applications of game theory 2 Games in strategic form 3 Dominance 4 Nash equilibrium 1 / 8 1. Some applications

More information

MS&E 246: Lecture 5 Efficiency and fairness. Ramesh Johari

MS&E 246: Lecture 5 Efficiency and fairness. Ramesh Johari MS&E 246: Lecture 5 Efficiency and fairness Ramesh Johari A digression In this lecture: We will use some of the insights of static game analysis to understand efficiency and fairness. Basic setup N players

More information

Outline for today. Stat155 Game Theory Lecture 13: General-Sum Games. General-sum games. General-sum games. Dominated pure strategies

Outline for today. Stat155 Game Theory Lecture 13: General-Sum Games. General-sum games. General-sum games. Dominated pure strategies Outline for today Stat155 Game Theory Lecture 13: General-Sum Games Peter Bartlett October 11, 2016 Two-player general-sum games Definitions: payoff matrices, dominant strategies, safety strategies, Nash

More information

GAME THEORY. (Hillier & Lieberman Introduction to Operations Research, 8 th edition)

GAME THEORY. (Hillier & Lieberman Introduction to Operations Research, 8 th edition) GAME THEORY (Hillier & Lieberman Introduction to Operations Research, 8 th edition) Game theory Mathematical theory that deals, in an formal, abstract way, with the general features of competitive situations

More information

Bargaining and Coalition Formation

Bargaining and Coalition Formation 1 These slides are based largely on chapter 2 of Osborne and Rubenstein (1990), Bargaining and Markets Bargaining and Coalition Formation Dr James Tremewan (james.tremewan@univie.ac.at) 1 The Bargaining

More information

Strategies and Nash Equilibrium. A Whirlwind Tour of Game Theory

Strategies and Nash Equilibrium. A Whirlwind Tour of Game Theory Strategies and Nash Equilibrium A Whirlwind Tour of Game Theory (Mostly from Fudenberg & Tirole) Players choose actions, receive rewards based on their own actions and those of the other players. Example,

More information

Can we have no Nash Equilibria? Can you have more than one Nash Equilibrium? CS 430: Artificial Intelligence Game Theory II (Nash Equilibria)

Can we have no Nash Equilibria? Can you have more than one Nash Equilibrium? CS 430: Artificial Intelligence Game Theory II (Nash Equilibria) CS 0: Artificial Intelligence Game Theory II (Nash Equilibria) ACME, a video game hardware manufacturer, has to decide whether its next game machine will use DVDs or CDs Best, a video game software producer,

More information

Obtaining a fair arbitration outcome

Obtaining a fair arbitration outcome Law, Probability and Risk Advance Access published March 16, 2011 Law, Probability and Risk Page 1 of 9 doi:10.1093/lpr/mgr003 Obtaining a fair arbitration outcome TRISTAN BARNETT School of Mathematics

More information

Math 167: Mathematical Game Theory Instructor: Alpár R. Mészáros

Math 167: Mathematical Game Theory Instructor: Alpár R. Mészáros Math 167: Mathematical Game Theory Instructor: Alpár R. Mészáros Midterm #1, February 3, 2017 Name (use a pen): Student ID (use a pen): Signature (use a pen): Rules: Duration of the exam: 50 minutes. By

More information

Lecture 6 Introduction to Utility Theory under Certainty and Uncertainty

Lecture 6 Introduction to Utility Theory under Certainty and Uncertainty Lecture 6 Introduction to Utility Theory under Certainty and Uncertainty Prof. Massimo Guidolin Prep Course in Quant Methods for Finance August-September 2017 Outline and objectives Axioms of choice under

More information

Anh Maciag. A Two-Person Bargaining Problem

Anh Maciag. A Two-Person Bargaining Problem Anh Maciag Saint Mary s College of California Department of Mathematics May 16, 2016 A Two-Person Bargaining Problem Supervisors: Professor Kathryn Porter Professor Michael Nathanson Professor Chris Jones

More information

CS 188: Artificial Intelligence. Maximum Expected Utility

CS 188: Artificial Intelligence. Maximum Expected Utility CS 188: Artificial Intelligence Lecture 7: Utility Theory Pieter Abbeel UC Berkeley Many slides adapted from Dan Klein 1 Maximum Expected Utility Why should we average utilities? Why not minimax? Principle

More information

Comparative Study between Linear and Graphical Methods in Solving Optimization Problems

Comparative Study between Linear and Graphical Methods in Solving Optimization Problems Comparative Study between Linear and Graphical Methods in Solving Optimization Problems Mona M Abd El-Kareem Abstract The main target of this paper is to establish a comparative study between the performance

More information

Microeconomics II Lecture 8: Bargaining + Theory of the Firm 1 Karl Wärneryd Stockholm School of Economics December 2016

Microeconomics II Lecture 8: Bargaining + Theory of the Firm 1 Karl Wärneryd Stockholm School of Economics December 2016 Microeconomics II Lecture 8: Bargaining + Theory of the Firm 1 Karl Wärneryd Stockholm School of Economics December 2016 1 Axiomatic bargaining theory Before noncooperative bargaining theory, there was

More information

TPPE24 Ekonomisk Analys:

TPPE24 Ekonomisk Analys: TPPE24 Ekonomisk Analys: Besluts- och Finansiell i Metodik Lecture 5 Game theory (Spelteori) - description of games and two-person zero-sum games 1 Contents 1. A description of the game 2. Two-person zero-sum

More information

LINEAR PROGRAMMING. Homework 7

LINEAR PROGRAMMING. Homework 7 LINEAR PROGRAMMING Homework 7 Fall 2014 Csci 628 Megan Rose Bryant 1. Your friend is taking a Linear Programming course at another university and for homework she is asked to solve the following LP: Primal:

More information

IV. Cooperation & Competition

IV. Cooperation & Competition IV. Cooperation & Competition Game Theory and the Iterated Prisoner s Dilemma 10/15/03 1 The Rudiments of Game Theory 10/15/03 2 Leibniz on Game Theory Games combining chance and skill give the best representation

More information

Bargaining Theory and Solutions

Bargaining Theory and Solutions Bargaining Theory and Solutions Lin Gao IERG 3280 Networks: Technology, Economics, and Social Interactions Spring, 2014 Outline Bargaining Problem Bargaining Theory Axiomatic Approach Strategic Approach

More information

Introduction to Multi-Agent Programming

Introduction to Multi-Agent Programming Introduction to Multi-Agent Programming 10. Game Theory Strategic Reasoning and Acting Alexander Kleiner and Bernhard Nebel Strategic Game A strategic game G consists of a finite set N (the set of players)

More information

Elements of Economic Analysis II Lecture XI: Oligopoly: Cournot and Bertrand Competition

Elements of Economic Analysis II Lecture XI: Oligopoly: Cournot and Bertrand Competition Elements of Economic Analysis II Lecture XI: Oligopoly: Cournot and Bertrand Competition Kai Hao Yang /2/207 In this lecture, we will apply the concepts in game theory to study oligopoly. In short, unlike

More information

Game Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India October 2012

Game Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India October 2012 Game Theory Lecture Notes By Y. Narahari Department of Computer Science and Automation Indian Institute of Science Bangalore, India October 2012 COOPERATIVE GAME THEORY The Core Note: This is a only a

More information

Strategy Lines and Optimal Mixed Strategy for R

Strategy Lines and Optimal Mixed Strategy for R Strategy Lines and Optimal Mixed Strategy for R Best counterstrategy for C for given mixed strategy by R In the previous lecture we saw that if R plays a particular mixed strategy, [p, p, and shows no

More information

We examine the impact of risk aversion on bidding behavior in first-price auctions.

We examine the impact of risk aversion on bidding behavior in first-price auctions. Risk Aversion We examine the impact of risk aversion on bidding behavior in first-price auctions. Assume there is no entry fee or reserve. Note: Risk aversion does not affect bidding in SPA because there,

More information

Math 135: Answers to Practice Problems

Math 135: Answers to Practice Problems Math 35: Answers to Practice Problems Answers to problems from the textbook: Many of the problems from the textbook have answers in the back of the book. Here are the answers to the problems that don t

More information

Game Theory: Additional Exercises

Game Theory: Additional Exercises Game Theory: Additional Exercises Problem 1. Consider the following scenario. Players 1 and 2 compete in an auction for a valuable object, for example a painting. Each player writes a bid in a sealed envelope,

More information

Symmetric Game. In animal behaviour a typical realization involves two parents balancing their individual investment in the common

Symmetric Game. In animal behaviour a typical realization involves two parents balancing their individual investment in the common Symmetric Game Consider the following -person game. Each player has a strategy which is a number x (0 x 1), thought of as the player s contribution to the common good. The net payoff to a player playing

More information

M.Phil. Game theory: Problem set II. These problems are designed for discussions in the classes of Week 8 of Michaelmas term. 1

M.Phil. Game theory: Problem set II. These problems are designed for discussions in the classes of Week 8 of Michaelmas term. 1 M.Phil. Game theory: Problem set II These problems are designed for discussions in the classes of Week 8 of Michaelmas term.. Private Provision of Public Good. Consider the following public good game:

More information

Game Theory: introduction and applications to computer networks

Game Theory: introduction and applications to computer networks Game Theory: introduction and applications to computer networks Zero-Sum Games (follow-up) Giovanni Neglia INRIA EPI Maestro 20 January 2014 Part of the slides are based on a previous course with D. Figueiredo

More information

COS 511: Theoretical Machine Learning. Lecturer: Rob Schapire Lecture #24 Scribe: Jordan Ash May 1, 2014

COS 511: Theoretical Machine Learning. Lecturer: Rob Schapire Lecture #24 Scribe: Jordan Ash May 1, 2014 COS 5: heoretical Machine Learning Lecturer: Rob Schapire Lecture #24 Scribe: Jordan Ash May, 204 Review of Game heory: Let M be a matrix with all elements in [0, ]. Mindy (called the row player) chooses

More information

CMPSCI 240: Reasoning about Uncertainty

CMPSCI 240: Reasoning about Uncertainty CMPSCI 240: Reasoning about Uncertainty Lecture 21: Game Theory Andrew McGregor University of Massachusetts Last Compiled: April 29, 2017 Outline 1 Game Theory 2 Example: Two-finger Morra Alice and Bob

More information

Econ 101A Final exam May 14, 2013.

Econ 101A Final exam May 14, 2013. Econ 101A Final exam May 14, 2013. Do not turn the page until instructed to. Do not forget to write Problems 1 in the first Blue Book and Problems 2, 3 and 4 in the second Blue Book. 1 Econ 101A Final

More information

CMPSCI 240: Reasoning about Uncertainty

CMPSCI 240: Reasoning about Uncertainty CMPSCI 240: Reasoning about Uncertainty Lecture 23: More Game Theory Andrew McGregor University of Massachusetts Last Compiled: April 20, 2017 Outline 1 Game Theory 2 Non Zero-Sum Games and Nash Equilibrium

More information

6.207/14.15: Networks Lecture 10: Introduction to Game Theory 2

6.207/14.15: Networks Lecture 10: Introduction to Game Theory 2 6.207/14.15: Networks Lecture 10: Introduction to Game Theory 2 Daron Acemoglu and Asu Ozdaglar MIT October 14, 2009 1 Introduction Outline Review Examples of Pure Strategy Nash Equilibria Mixed Strategies

More information

Econ 323 Microeconomic Theory. Practice Exam 2 with Solutions

Econ 323 Microeconomic Theory. Practice Exam 2 with Solutions Econ 323 Microeconomic Theory Practice Exam 2 with Solutions Chapter 10, Question 1 Which of the following is not a condition for perfect competition? Firms a. take prices as given b. sell a standardized

More information

Chapter 2 Strategic Dominance

Chapter 2 Strategic Dominance Chapter 2 Strategic Dominance 2.1 Prisoner s Dilemma Let us start with perhaps the most famous example in Game Theory, the Prisoner s Dilemma. 1 This is a two-player normal-form (simultaneous move) game.

More information

Problem Set 2 - SOLUTIONS

Problem Set 2 - SOLUTIONS Problem Set - SOLUTONS 1. Consider the following two-player game: L R T 4, 4 1, 1 B, 3, 3 (a) What is the maxmin strategy profile? What is the value of this game? Note, the question could be solved like

More information

BRIEF INTRODUCTION TO GAME THEORY

BRIEF INTRODUCTION TO GAME THEORY BRIEF INTRODUCTION TO GAME THEORY Game Theory Mathematical theory that deals with the general features of competitive situations. Examples: parlor games, military battles, political campaigns, advertising

More information

Econ 323 Microeconomic Theory. Chapter 10, Question 1

Econ 323 Microeconomic Theory. Chapter 10, Question 1 Econ 323 Microeconomic Theory Practice Exam 2 with Solutions Chapter 10, Question 1 Which of the following is not a condition for perfect competition? Firms a. take prices as given b. sell a standardized

More information

preferences of the individual players over these possible outcomes, typically measured by a utility or payoff function.

preferences of the individual players over these possible outcomes, typically measured by a utility or payoff function. Leigh Tesfatsion 26 January 2009 Game Theory: Basic Concepts and Terminology A GAME consists of: a collection of decision-makers, called players; the possible information states of each player at each

More information

Outline Introduction Game Representations Reductions Solution Concepts. Game Theory. Enrico Franchi. May 19, 2010

Outline Introduction Game Representations Reductions Solution Concepts. Game Theory. Enrico Franchi. May 19, 2010 May 19, 2010 1 Introduction Scope of Agent preferences Utility Functions 2 Game Representations Example: Game-1 Extended Form Strategic Form Equivalences 3 Reductions Best Response Domination 4 Solution

More information

S 2,2-1, x c C x r, 1 0,0

S 2,2-1, x c C x r, 1 0,0 Problem Set 5 1. There are two players facing each other in the following random prisoners dilemma: S C S, -1, x c C x r, 1 0,0 With probability p, x c = y, and with probability 1 p, x c = 0. With probability

More information

Assignment 1: Preference Relations. Decision Theory. Pareto Optimality. Game Types.

Assignment 1: Preference Relations. Decision Theory. Pareto Optimality. Game Types. Simon Fraser University Spring 2010 CMPT 882 Instructor: Oliver Schulte Assignment 1: Preference Relations. Decision Theory. Pareto Optimality. Game Types. The due date for this assignment is Wednesday,

More information

CS 331: Artificial Intelligence Game Theory I. Prisoner s Dilemma

CS 331: Artificial Intelligence Game Theory I. Prisoner s Dilemma CS 331: Artificial Intelligence Game Theory I 1 Prisoner s Dilemma You and your partner have both been caught red handed near the scene of a burglary. Both of you have been brought to the police station,

More information

MATH 210, PROBLEM SET 1 DUE IN LECTURE ON WEDNESDAY, JAN. 28

MATH 210, PROBLEM SET 1 DUE IN LECTURE ON WEDNESDAY, JAN. 28 MATH 210, PROBLEM SET 1 DUE IN LECTURE ON WEDNESDAY, JAN. 28 1. Frankfurt s theory of lying and bullshit. Read Frankfurt s book On Bullshit. In particular, see the description of the distinction he makes

More information

Lecture 8: Introduction to asset pricing

Lecture 8: Introduction to asset pricing THE UNIVERSITY OF SOUTHAMPTON Paul Klein Office: Murray Building, 3005 Email: p.klein@soton.ac.uk URL: http://paulklein.se Economics 3010 Topics in Macroeconomics 3 Autumn 2010 Lecture 8: Introduction

More information

SI 563 Homework 3 Oct 5, Determine the set of rationalizable strategies for each of the following games. a) X Y X Y Z

SI 563 Homework 3 Oct 5, Determine the set of rationalizable strategies for each of the following games. a) X Y X Y Z SI 563 Homework 3 Oct 5, 06 Chapter 7 Exercise : ( points) Determine the set of rationalizable strategies for each of the following games. a) U (0,4) (4,0) M (3,3) (3,3) D (4,0) (0,4) X Y U (0,4) (4,0)

More information

General Examination in Microeconomic Theory SPRING 2014

General Examination in Microeconomic Theory SPRING 2014 HARVARD UNIVERSITY DEPARTMENT OF ECONOMICS General Examination in Microeconomic Theory SPRING 2014 You have FOUR hours. Answer all questions Those taking the FINAL have THREE hours Part A (Glaeser): 55

More information

COS 445 Final. Due online Monday, May 21st at 11:59 pm. Please upload each problem as a separate file via MTA.

COS 445 Final. Due online Monday, May 21st at 11:59 pm. Please upload each problem as a separate file via MTA. COS 445 Final Due online Monday, May 21st at 11:59 pm All problems on this final are no collaboration problems. You may not discuss any aspect of any problems with anyone except for the course staff. You

More information

PAULI MURTO, ANDREY ZHUKOV

PAULI MURTO, ANDREY ZHUKOV GAME THEORY SOLUTION SET 1 WINTER 018 PAULI MURTO, ANDREY ZHUKOV Introduction For suggested solution to problem 4, last year s suggested solutions by Tsz-Ning Wong were used who I think used suggested

More information

CS711 Game Theory and Mechanism Design

CS711 Game Theory and Mechanism Design CS711 Game Theory and Mechanism Design Problem Set 1 August 13, 2018 Que 1. [Easy] William and Henry are participants in a televised game show, seated in separate booths with no possibility of communicating

More information

Strategy -1- Strategy

Strategy -1- Strategy Strategy -- Strategy A Duopoly, Cournot equilibrium 2 B Mixed strategies: Rock, Scissors, Paper, Nash equilibrium 5 C Games with private information 8 D Additional exercises 24 25 pages Strategy -2- A

More information

Introduction to game theory LECTURE 2

Introduction to game theory LECTURE 2 Introduction to game theory LECTURE 2 Jörgen Weibull February 4, 2010 Two topics today: 1. Existence of Nash equilibria (Lecture notes Chapter 10 and Appendix A) 2. Relations between equilibrium and rationality

More information

Section Strictly Determined Games, Dominated Rows, Saddle Points

Section Strictly Determined Games, Dominated Rows, Saddle Points Finite Math B Chapter 11 Practice Questions Game Theory Section 11.1 - Strictly Determined Games, Dominated Rows, Saddle Points MULTIPLE CHOICE. Choose the one alternative that best completes the statement

More information

Game Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India October 2012

Game Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India October 2012 Game Theory Lecture Notes By Y. Narahari Department of Computer Science and Automation Indian Institute of Science Bangalore, India October 22 COOPERATIVE GAME THEORY Correlated Strategies and Correlated

More information

University at Albany, State University of New York Department of Economics Ph.D. Preliminary Examination in Microeconomics, June 20, 2017

University at Albany, State University of New York Department of Economics Ph.D. Preliminary Examination in Microeconomics, June 20, 2017 University at Albany, State University of New York Department of Economics Ph.D. Preliminary Examination in Microeconomics, June 0, 017 Instructions: Answer any three of the four numbered problems. Justify

More information

(a) Describe the game in plain english and find its equivalent strategic form.

(a) Describe the game in plain english and find its equivalent strategic form. Risk and Decision Making (Part II - Game Theory) Mock Exam MIT/Portugal pages Professor João Soares 2007/08 1 Consider the game defined by the Kuhn tree of Figure 1 (a) Describe the game in plain english

More information

When one firm considers changing its price or output level, it must make assumptions about the reactions of its rivals.

When one firm considers changing its price or output level, it must make assumptions about the reactions of its rivals. Chapter 3 Oligopoly Oligopoly is an industry where there are relatively few sellers. The product may be standardized (steel) or differentiated (automobiles). The firms have a high degree of interdependence.

More information

6.254 : Game Theory with Engineering Applications Lecture 3: Strategic Form Games - Solution Concepts

6.254 : Game Theory with Engineering Applications Lecture 3: Strategic Form Games - Solution Concepts 6.254 : Game Theory with Engineering Applications Lecture 3: Strategic Form Games - Solution Concepts Asu Ozdaglar MIT February 9, 2010 1 Introduction Outline Review Examples of Pure Strategy Nash Equilibria

More information

TUFTS UNIVERSITY DEPARTMENT OF CIVIL AND ENVIRONMENTAL ENGINEERING ES 152 ENGINEERING SYSTEMS Spring Lesson 16 Introduction to Game Theory

TUFTS UNIVERSITY DEPARTMENT OF CIVIL AND ENVIRONMENTAL ENGINEERING ES 152 ENGINEERING SYSTEMS Spring Lesson 16 Introduction to Game Theory TUFTS UNIVERSITY DEPARTMENT OF CIVIL AND ENVIRONMENTAL ENGINEERING ES 52 ENGINEERING SYSTEMS Spring 20 Introduction: Lesson 6 Introduction to Game Theory We will look at the basic ideas of game theory.

More information

CS711: Introduction to Game Theory and Mechanism Design

CS711: Introduction to Game Theory and Mechanism Design CS711: Introduction to Game Theory and Mechanism Design Teacher: Swaprava Nath Domination, Elimination of Dominated Strategies, Nash Equilibrium Domination Normal form game N, (S i ) i N, (u i ) i N Definition

More information

Game Theory. Analyzing Games: From Optimality to Equilibrium. Manar Mohaisen Department of EEC Engineering

Game Theory. Analyzing Games: From Optimality to Equilibrium. Manar Mohaisen Department of EEC Engineering Game Theory Analyzing Games: From Optimality to Equilibrium Manar Mohaisen Department of EEC Engineering Korea University of Technology and Education (KUT) Content Optimality Best Response Domination Nash

More information

Game Theory Notes: Examples of Games with Dominant Strategy Equilibrium or Nash Equilibrium

Game Theory Notes: Examples of Games with Dominant Strategy Equilibrium or Nash Equilibrium Game Theory Notes: Examples of Games with Dominant Strategy Equilibrium or Nash Equilibrium Below are two different games. The first game has a dominant strategy equilibrium. The second game has two Nash

More information

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

Game Theory and Economics Prof. Dr. Debarshi Das Department of Humanities and Social Sciences Indian Institute of Technology, Guwahati. Game Theory and Economics Prof. Dr. Debarshi Das Department of Humanities and Social Sciences Indian Institute of Technology, Guwahati. Module No. # 06 Illustrations of Extensive Games and Nash Equilibrium

More information

m 11 m 12 Non-Zero Sum Games Matrix Form of Zero-Sum Games R&N Section 17.6

m 11 m 12 Non-Zero Sum Games Matrix Form of Zero-Sum Games R&N Section 17.6 Non-Zero Sum Games R&N Section 17.6 Matrix Form of Zero-Sum Games m 11 m 12 m 21 m 22 m ij = Player A s payoff if Player A follows pure strategy i and Player B follows pure strategy j 1 Results so far

More information

G5212: Game Theory. Mark Dean. Spring 2017

G5212: Game Theory. Mark Dean. Spring 2017 G5212: Game Theory Mark Dean Spring 2017 More on Nash Equilibrium So now we know That (almost) all games have a Nash Equilibrium in mixed strategies How to find these equilibria by calculating best responses

More information

Games with incomplete information about players. be symmetric or asymmetric.

Games with incomplete information about players. be symmetric or asymmetric. Econ 221 Fall, 2018 Li, Hao UBC CHAPTER 8. UNCERTAINTY AND INFORMATION Games with incomplete information about players. Incomplete information about players preferences can be symmetric or asymmetric.

More information

ANASH EQUILIBRIUM of a strategic game is an action profile in which every. Strategy Equilibrium

ANASH EQUILIBRIUM of a strategic game is an action profile in which every. Strategy Equilibrium Draft chapter from An introduction to game theory by Martin J. Osborne. Version: 2002/7/23. Martin.Osborne@utoronto.ca http://www.economics.utoronto.ca/osborne Copyright 1995 2002 by Martin J. Osborne.

More information

Lecture 12: Introduction to reasoning under uncertainty. Actions and Consequences

Lecture 12: Introduction to reasoning under uncertainty. Actions and Consequences Lecture 12: Introduction to reasoning under uncertainty Preferences Utility functions Maximizing expected utility Value of information Bandit problems and the exploration-exploitation trade-off COMP-424,

More information

An Axiomatic Approach to Arbitration and Its Application in Bargaining Games

An Axiomatic Approach to Arbitration and Its Application in Bargaining Games An Axiomatic Approach to Arbitration and Its Application in Bargaining Games Kang Rong School of Economics, Shanghai University of Finance and Economics Aug 30, 2012 Abstract We define an arbitration problem

More information

October 9. The problem of ties (i.e., = ) will not matter here because it will occur with probability

October 9. The problem of ties (i.e., = ) will not matter here because it will occur with probability October 9 Example 30 (1.1, p.331: A bargaining breakdown) There are two people, J and K. J has an asset that he would like to sell to K. J s reservation value is 2 (i.e., he profits only if he sells it

More information

On Existence of Equilibria. Bayesian Allocation-Mechanisms

On Existence of Equilibria. Bayesian Allocation-Mechanisms On Existence of Equilibria in Bayesian Allocation Mechanisms Northwestern University April 23, 2014 Bayesian Allocation Mechanisms In allocation mechanisms, agents choose messages. The messages determine

More information

d. Find a competitive equilibrium for this economy. Is the allocation Pareto efficient? Are there any other competitive equilibrium allocations?

d. Find a competitive equilibrium for this economy. Is the allocation Pareto efficient? Are there any other competitive equilibrium allocations? Answers to Microeconomics Prelim of August 7, 0. Consider an individual faced with two job choices: she can either accept a position with a fixed annual salary of x > 0 which requires L x units of labor

More information

MATH 4321 Game Theory Solution to Homework Two

MATH 4321 Game Theory Solution to Homework Two MATH 321 Game Theory Solution to Homework Two Course Instructor: Prof. Y.K. Kwok 1. (a) Suppose that an iterated dominance equilibrium s is not a Nash equilibrium, then there exists s i of some player

More information

Expectimax Search Trees. CS 188: Artificial Intelligence Fall Expectimax Quantities. Expectimax Pseudocode. Expectimax Pruning?

Expectimax Search Trees. CS 188: Artificial Intelligence Fall Expectimax Quantities. Expectimax Pseudocode. Expectimax Pruning? CS 188: Artificial Intelligence Fall 2010 Expectimax Search Trees What if we don t know what the result of an action will be? E.g., In solitaire, next card is unknown In minesweeper, mine locations In

More information

PhD Qualifier Examination

PhD Qualifier Examination PhD Qualifier Examination Department of Agricultural Economics May 29, 2014 Instructions This exam consists of six questions. You must answer all questions. If you need an assumption to complete a question,

More information

ECE 586BH: Problem Set 5: Problems and Solutions Multistage games, including repeated games, with observed moves

ECE 586BH: Problem Set 5: Problems and Solutions Multistage games, including repeated games, with observed moves University of Illinois Spring 01 ECE 586BH: Problem Set 5: Problems and Solutions Multistage games, including repeated games, with observed moves Due: Reading: Thursday, April 11 at beginning of class

More information

FDPE Microeconomics 3 Spring 2017 Pauli Murto TA: Tsz-Ning Wong (These solution hints are based on Julia Salmi s solution hints for Spring 2015.

FDPE Microeconomics 3 Spring 2017 Pauli Murto TA: Tsz-Ning Wong (These solution hints are based on Julia Salmi s solution hints for Spring 2015. FDPE Microeconomics 3 Spring 2017 Pauli Murto TA: Tsz-Ning Wong (These solution hints are based on Julia Salmi s solution hints for Spring 2015.) Hints for Problem Set 3 1. Consider the following strategic

More information

6.207/14.15: Networks Lecture 9: Introduction to Game Theory 1

6.207/14.15: Networks Lecture 9: Introduction to Game Theory 1 6.207/14.15: Networks Lecture 9: Introduction to Game Theory 1 Daron Acemoglu and Asu Ozdaglar MIT October 13, 2009 1 Introduction Outline Decisions, Utility Maximization Games and Strategies Best Responses

More information

Dissolving a Partnership Securely

Dissolving a Partnership Securely Dissolving a Partnership Securely Matt Van Essen John Wooders February 27, 2017 Abstract We characterize security strategies and payoffs for three mechanisms for dissolving partnerships: the Texas Shoot-Out,

More information

CUR 412: Game Theory and its Applications, Lecture 9

CUR 412: Game Theory and its Applications, Lecture 9 CUR 412: Game Theory and its Applications, Lecture 9 Prof. Ronaldo CARPIO May 22, 2015 Announcements HW #3 is due next week. Ch. 6.1: Ultimatum Game This is a simple game that can model a very simplified

More information

CS 798: Homework Assignment 4 (Game Theory)

CS 798: Homework Assignment 4 (Game Theory) 0 5 CS 798: Homework Assignment 4 (Game Theory) 1.0 Preferences Assigned: October 28, 2009 Suppose that you equally like a banana and a lottery that gives you an apple 30% of the time and a carrot 70%

More information

Efficient provision of a public good

Efficient provision of a public good Public Goods Once a pure public good is provided, the additional resource cost of another person consuming the good is zero. The public good is nonrival in consumption. Examples: lighthouse national defense

More information

Introduction to Game Theory

Introduction to Game Theory Introduction to Game Theory 3a. More on Normal-Form Games Dana Nau University of Maryland Nau: Game Theory 1 More Solution Concepts Last time, we talked about several solution concepts Pareto optimality

More information

Version 01 as of May 12, 2014 Author: Steven Sagona To be submitted to PRL (not really)

Version 01 as of May 12, 2014 Author: Steven Sagona To be submitted to PRL (not really) Version 01 as of May 12, 2014 Author: Steven Sagona To be submitted to PRL (not really) The Game Theory of Pokemon: AI implementing Nash Equilibrium (Dated: May 12, 2014) This paper is written to propose

More information

Chapter 11: Dynamic Games and First and Second Movers

Chapter 11: Dynamic Games and First and Second Movers Chapter : Dynamic Games and First and Second Movers Learning Objectives Students should learn to:. Extend the reaction function ideas developed in the Cournot duopoly model to a model of sequential behavior

More information

3.2 No-arbitrage theory and risk neutral probability measure

3.2 No-arbitrage theory and risk neutral probability measure Mathematical Models in Economics and Finance Topic 3 Fundamental theorem of asset pricing 3.1 Law of one price and Arrow securities 3.2 No-arbitrage theory and risk neutral probability measure 3.3 Valuation

More information

10.1 Elimination of strictly dominated strategies

10.1 Elimination of strictly dominated strategies Chapter 10 Elimination by Mixed Strategies The notions of dominance apply in particular to mixed extensions of finite strategic games. But we can also consider dominance of a pure strategy by a mixed strategy.

More information

TUTORIAL KIT OMEGA SEMESTER PROGRAMME: BANKING AND FINANCE

TUTORIAL KIT OMEGA SEMESTER PROGRAMME: BANKING AND FINANCE TUTORIAL KIT OMEGA SEMESTER PROGRAMME: BANKING AND FINANCE COURSE: BFN 425 QUANTITATIVE TECHNIQUE FOR FINANCIAL DECISIONS i DISCLAIMER The contents of this document are intended for practice and leaning

More information

University of Hong Kong

University of Hong Kong University of Hong Kong ECON6036 Game Theory and Applications Problem Set I 1 Nash equilibrium, pure and mixed equilibrium 1. This exercise asks you to work through the characterization of all the Nash

More information