Game Theory. Zero sum games

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

MATH 121 GAME THEORY REVIEW

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

Applying Risk Theory to Game Theory Tristan Barnett. Abstract

MAT 4250: Lecture 1 Eric Chung

Using the Maximin Principle

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

Thursday, March 3

Best counterstrategy for C

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

Game Theory - Lecture #8

Game theory and applications: Lecture 1

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

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

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

Bargaining and Coalition Formation

Strategies and Nash Equilibrium. A Whirlwind Tour of Game Theory

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

Obtaining a fair arbitration outcome

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

Lecture 6 Introduction to Utility Theory under Certainty and Uncertainty

Anh Maciag. A Two-Person Bargaining Problem

CS 188: Artificial Intelligence. Maximum Expected Utility

Comparative Study between Linear and Graphical Methods in Solving Optimization Problems

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

TPPE24 Ekonomisk Analys:

LINEAR PROGRAMMING. Homework 7

IV. Cooperation & Competition

Bargaining Theory and Solutions

Introduction to Multi-Agent Programming

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

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

Strategy Lines and Optimal Mixed Strategy for R

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

Math 135: Answers to Practice Problems

Game Theory: Additional Exercises

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

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

Game Theory: introduction and applications to computer networks

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

CMPSCI 240: Reasoning about Uncertainty

Econ 101A Final exam May 14, 2013.

CMPSCI 240: Reasoning about Uncertainty

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

Econ 323 Microeconomic Theory. Practice Exam 2 with Solutions

Chapter 2 Strategic Dominance

Problem Set 2 - SOLUTIONS

BRIEF INTRODUCTION TO GAME THEORY

Econ 323 Microeconomic Theory. Chapter 10, Question 1

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

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

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

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

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

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

Lecture 8: Introduction to asset pricing

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

General Examination in Microeconomic Theory SPRING 2014

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

PAULI MURTO, ANDREY ZHUKOV

CS711 Game Theory and Mechanism Design

Strategy -1- Strategy

Introduction to game theory LECTURE 2

Section Strictly Determined Games, Dominated Rows, Saddle Points

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

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

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

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

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

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

CS711: Introduction to Game Theory and Mechanism Design

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

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

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

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

G5212: Game Theory. Mark Dean. Spring 2017

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

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

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

An Axiomatic Approach to Arbitration and Its Application in Bargaining Games

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

On Existence of Equilibria. Bayesian Allocation-Mechanisms

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

MATH 4321 Game Theory Solution to Homework Two

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

PhD Qualifier Examination

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

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.

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

Dissolving a Partnership Securely

CUR 412: Game Theory and its Applications, Lecture 9

CS 798: Homework Assignment 4 (Game Theory)

Efficient provision of a public good

Introduction to Game Theory

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

Chapter 11: Dynamic Games and First and Second Movers

3.2 No-arbitrage theory and risk neutral probability measure

10.1 Elimination of strictly dominated strategies

TUTORIAL KIT OMEGA SEMESTER PROGRAMME: BANKING AND FINANCE

University of Hong Kong

Transcription:

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

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

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

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

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

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

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

Graphical solufon of the current s problem 21 19 17 15 13 11 9 7 SoluFon: p=0.31 IN OUT IN OUT Mixed strategy of the current 5 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 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

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 17.3 + 0.75 x 11.5 = 12.95 OUT: 0.25 x ( 4.4) + 0.75 x 20.6 = 14.35 IN OUT: 0.25 x 5.2 + 0.75 x 17.0 = 14.05 Hence, all of the fishermen should fish OUTside. Maybe, they are not well adapted aver all 9

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 17.3 + 0.65 x 11.5 = 13.53 OUT: 0.35 x ( 4.4) + 0.65 x 11.5 = 11.85 IN OUT: 0.35 x 5.2 + 0.65 x 17.0 = 12.87. By treafng the current as their opponent, fishermen GUARANTEE themselves payoff of at least 13.31. Fishermen pay 1.05 pounds as insurance premium Actual (25%) Vicious (31%) 35% OpFmal 13.3125 13.3125 13.3125 Actual 13.291 13.31164 13.3254 OUT 14.35 12.85 11.85 Consider the following game Mr Raw Mrs Column A B A (2,6) (10,5) B (4,8) (0,0) 10

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

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

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

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

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

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