Game Theory I. Author: Neil Bendle Marketing Metrics Reference: Chapter Neil Bendle and Management by the Numbers, Inc.

Similar documents
Introduction to Margins

Economics 109 Practice Problems 1, Vincent Crawford, Spring 2002

Introduction to Multi-Agent Programming

Financial Metrics I: Measures of Profitability

Bayesian Nash Equilibrium

Thursday, March 3

Calculating Margins. Authors: Paul Farris Marketing Metrics Reference: Chapter Paul Farris, Stu James, and Management by the Numbers, Inc.

ECON 459 Game Theory. Lecture Notes Auctions. Luca Anderlini Spring 2017

Repeated, Stochastic and Bayesian Games

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

Name. Answers Discussion Final Exam, Econ 171, March, 2012

Introduction to Game Theory

Iterated Dominance and Nash Equilibrium

Using the Maximin Principle

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

Economic Management Strategy: Hwrk 1. 1 Simultaneous-Move Game Theory Questions.

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

Econ 172A, W2002: Final Examination, Solutions

University of Hong Kong

AS/ECON 2350 S2 N Answers to Mid term Exam July time : 1 hour. Do all 4 questions. All count equally.

Breakeven Analysis. Author: Paul Farris Marketing Metrics Reference: Chapter Paul Farris and Management by the Numbers, Inc.

Week 8: Basic concepts in game theory

Best counterstrategy for C

Notes on Auctions. Theorem 1 In a second price sealed bid auction bidding your valuation is always a weakly dominant strategy.

Microeconomics II. CIDE, MsC Economics. List of Problems

10 Errors to Avoid When Refinancing

Managerial Economics ECO404 OLIGOPOLY: GAME THEORETIC APPROACH

January 26,

Maximizing Winnings on Final Jeopardy!

STA Rev. F Learning Objectives. What is a Random Variable? Module 5 Discrete Random Variables

Yao s Minimax Principle

The Provision for Credit Losses & the Allowance for Loan Losses. How Much Do You Expect to Lose?

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

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

CS711 Game Theory and Mechanism Design

In the Name of God. Sharif University of Technology. Graduate School of Management and Economics

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

MS&E 246: Lecture 2 The basics. Ramesh Johari January 16, 2007

G5212: Game Theory. Mark Dean. Spring 2017

An introduction on game theory for wireless networking [1]

Economics 335 March 2, 1999 Notes 6: Game Theory

Other Regarding Preferences

Introduction to Industrial Organization Professor: Caixia Shen Fall 2014 Lecture Note 5 Games and Strategy (Ch. 4)

Jacob: The illustrative worksheet shows the values of the simulation parameters in the upper left section (Cells D5:F10). Is this for documentation?

Their opponent will play intelligently and wishes to maximize their own payoff.

Expectations & Randomization Normal Form Games Dominance Iterated Dominance. Normal Form Games & Dominance

ECE 586GT: Problem Set 1: Problems and Solutions Analysis of static games

STA Module 3B Discrete Random Variables

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

HE+ Economics Nash Equilibrium

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

Auctions. Episode 8. Baochun Li Professor Department of Electrical and Computer Engineering University of Toronto

Strategy Lines and Optimal Mixed Strategy for R

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

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

1. better to stick. 2. better to switch. 3. or does your second choice make no difference?

Session 6A Seven Popular Ways to Screw up your Reinsurance Program. Greg Solomon, FIA

15-451/651: Design & Analysis of Algorithms November 9 & 11, 2015 Lecture #19 & #20 last changed: November 10, 2015

Econ 711 Final Solutions

CUR 412: Game Theory and its Applications, Lecture 4

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

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

Exercises Solutions: Game Theory

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

Section Strictly Determined Games, Dominated Rows, Saddle Points

Overuse of a Common Resource: A Two-player Example

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

Solution to Tutorial 1

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

ECONS 424 STRATEGY AND GAME THEORY HANDOUT ON PERFECT BAYESIAN EQUILIBRIUM- III Semi-Separating equilibrium

Solution to Tutorial /2013 Semester I MA4264 Game Theory

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

Introduction to Game Theory

Pareto Concepts 1 / 46

Lecture 5 Leadership and Reputation

Math 135: Answers to Practice Problems

Microeconomics of Banking: Lecture 5

Pareto Concepts 1 / 46

In the Name of God. Sharif University of Technology. Microeconomics 2. Graduate School of Management and Economics. Dr. S.

TPPE24 Ekonomisk Analys:

1. A is a decision support tool that uses a tree-like graph or model of decisions and their possible consequences, including chance event outcomes,

Maximizing Winnings on Final Jeopardy!

Strategies and Nash Equilibrium. A Whirlwind Tour of Game Theory

CMSC 474, Introduction to Game Theory 16. Behavioral vs. Mixed Strategies

G5212: Game Theory. Mark Dean. Spring 2017

Regret Minimization and Security Strategies

Game Theory Tutorial 3 Answers

The figures in the left (debit) column are all either ASSETS or EXPENSES.

Time Preferences. Mark Dean. Behavioral Economics Spring 2017

Evaluating Performance

Now we return to simultaneous-move games. We resolve the issue of non-existence of Nash equilibrium. in pure strategies through intentional mixing.

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

Week 8: Basic concepts in game theory

ECON Microeconomics II IRYNA DUDNYK. Auctions.

1 Intro to game theory

Scenic Video Transcript End-of-Period Accounting and Business Decisions Topics. Accounting decisions: o Accrual systems.

PSYCHOLOGY OF FOREX TRADING EBOOK 05. GFtrade Inc

Making Hard Decision. ENCE 627 Decision Analysis for Engineering. Identify the decision situation and understand objectives. Identify alternatives

Money Math for Teens. The Emergency Fund

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

Transcription:

Game Theory I This module provides an introduction to game theory for managers and includes the following topics: matrix basics, zero and non-zero sum games, and dominant strategies. Author: Neil Bendle Marketing Metrics Reference: Chapter 7 2014 Neil Bendle and Management by the Numbers, Inc.

What is Game Theory? Game Theory studies competitive and cooperative interactions. Despite often using terms such as players and games, the ideas apply to markets and managers. Core idea: Examining incentives allows us to predict what will happen in interactions if people and companies respond correctly. WHAT IS GAME THEORY? Insight To understand an industry, a manager must comprehend how each participant views the market and their strategic options. In order to do this, managers should consider their partners and competitors incentives. 2

Game Theory and Management Game theory applies to a wide range of managerial situations and choices. If I drop my price what will my competitor do? How will this impact my profits? Should I invest in proprietary technology or license it from a rival? Should I enter this new market? Game theory is also commonly applied to advertising planning, product launches and promotional spending. GAME THEORY AND MANAGEMENT Insight Game theory has wide managerial application especially in pricing. 3

Why Study Simple Games? In game theory, it is helpful to simplify a complex decision process by focusing on other people s incentives. We consider simple games: 2 players and 2 possible actions; called a 2x2 game, WHY STUDY SIMPLE GAMES? Single period, Simultaneous (all choose at the same time). Where the payoff covers everything important to a decision maker. Profits are just one example of an objective. Definitions Single Period Game = Choice with no impact on later choices. Payoff = What manager cares about expressed in numbers. 4

The Downside of Simplicity We simplify situations to help us clarify our thinking and options, however, the world is not simple and game theory doesn t capture some important dimensions to strategy. For example: Strategy is Dynamic. In simple game theory, my actions today don t change the future. Not necessarily the case: My actions affect my competitor s actions which in turn impact my next decision (pricing, product enhancements, etc.) Considering the future may promote cooperation (i.e. I don t want to annoy you today if I may need your help tomorrow) Simple game theory assumes no communication between parties. Communication is often incomplete or misleading, but it can impact outcomes. THE DOWNSIDE OF SIMPLICITY 5

Sell Oranges Alfred Sell Apples Example Game Theory Matrix The matrix below describes the managers (e.g. Alfred & Beth) & their possible actions (e.g. Sell Apples or Oranges). The cells represent choice combinations i.e. outcomes. Alfred chooses: Sell Apples Beth chooses: Sell Oranges Read across row for Alfred s action & down column for Beth s. Sell Apples Beth Sell Oranges EXAMPLE GAME THEORY MATRIX Outcome 6

Sell Oranges Alfred Sell Apples Example Game Theory Matrix Matrix shows each manager s payoff for choice combination. Payoffs for each manager in a cell are color coded. e.g. if Alfred chooses to sell apples while manager Beth chooses to sell oranges (highlighted cell in upper right) Alfred gets a payoff of +2. This is his best possible payoff. Beth gets -2 her worst possible payoff. Beth EXAMPLE GAME THEORY MATRIX Sell Apples Sell Oranges +2-2 -2 +2-1 +1 +1-1 7

Sell Oranges Alfred Sell Apples Making The Best Choice What is Alfred s best choice to get the highest payoff? If Beth chooses to sell apples Alfred might get -2 or +1 If Beth chooses to sell oranges Alfred might get +2 or -1 Beth MAKING THE BEST CHOICE Sell Apples Sell Oranges +2-2 -2 +2-1 +1 +1-1 Insight A person s best choice often depends on the other player s choice. 8

Sell Oranges Alfred Sell Apples What If Alfred Had a Spy? The game is easy if Alfred has a spy who says: Beth will sell apples. Alfred can ignore Beth s sell oranges column and so Alfred will sell oranges as +1>-2 Beth will sell oranges. Alfred can ignore Beth s sell apples column and so Alfred will sell apples as -1<+2 Sell Apples Beth Sell Oranges WHAT IF MANAGER A HAD A SPY? +2-2 -2 +2-1 +1 +1-1 9

Sell Oranges Alfred Sell Apples What If Beth Had a Spy? The game is easy if Beth has a spy who says: Alfred will sell apples. Beth can ignore Alfred s sell oranges row and so Beth will sell apples as +2>-2 Alfred will sell oranges. Beth can ignore Alfred s sell apples row and so Beth will sell oranges as -1<+1 WHAT IF BETH HAD A SPY? Beth Sell Apples Sell Oranges +2-2 -2 +2-1 +1 +1-1 10

The first question to ask is: Zero Sum Game or Not? Are you competing for a fixed pie? The answer to this question falls into two broad categories: Is what I gain offset by an equivalent loss by the other party? (e.g. the size of pie does not change based on my choice because someone else loses the same amount I gain) Fixed Pie = Zero Sum Games Or, is what I gain from my choice different than what the other party loses (e.g. the size of the pie varies based on the choices made by the players) Variable Pie = Non-Zero Sum Games ZERO SUM GAME OR NOT? 11

Zero-Sum Games Zero-sum games are common in sport (e.g. darts, football) They are less common in business but do exist (e.g. the award of a big contract) In zero-sum games if one person wins, the other must lose the same amount the players payoffs in any cell total zero (i.e. if manager A gets +1 manager B must get -1) ZERO-SUM GAMES Definition Zero Sum Game = Payoffs in every cell total to zero Insight All fixed pie games can easily be recast as zero sum games by subtracting or adding a constant from all payoffs. 12

Action Y Manager A Action X Example of a Zero-Sum Game The game below is a zero-sum game stacked against B Manager B Action X Action Y +1-1000 -1 +1000-1000 +1 EXAMPLE OF A ZERO-SUM GAME +1000-1 If manager A chooses X and B chooses X: -1 +1 =0 If manager A chooses X and B chooses Y: +1000-1000 =0 If manager A chooses Y and B chooses X: +1000-1000 =0 If manager A chooses Y and B chooses Y : -1 +1 =0 Insight Many zero sum games aren t fair. Payoffs in this example add up to zero in any cell, however Manager A clearly prefers this game. 13

Winning a Zero-Sum Game There is a best way to play zero-sum games. Assume the other manager makes their best move and move to minimize the harm they cause you. Your opponent making their best move is a major assumption but this allows you to predict them. WINNING A ZERO-SUM GAME Insight In a zero-sum game, assume your competitor will make the best move they can and minimize how much they can harm you. 14

Non Zero-Sum Games Non zero-sum games are when the payoffs to a given outcome don t always total zero. The gain by one manager may not be equally offset by the loss by the other manager. In fact, both managers might do better or worse together. NON ZERO-SUM GAMES Non zero-sum games dominate business. The classic example is a price war. Fighting a price war often destroys the profits of all the firms involved. Definition Non Zero-Sum Game = Payoffs for one or more cells do not total zero. 15

Action Y Manager A Action X Example of A Non Zero-Sum Game Manager B Action X Action Y -3 +1 +2 0 0 +1 +1 +1 EXAMPLE OF A NON-ZERO SUM GAME Total payoffs do not equal zero for all the given outcomes If manager A chooses X and B chooses X = +2-3 = -1 If manager A chooses X and B chooses Y = 0 +1 = +1 If manager A chooses Y and B chooses X = +1 +0 = +1 If manager A chooses Y and B chooses Y = +1 +1 = +2 16

Winning a Non Zero-Sum Game Winning is hard to define in non zero-sum games. The correct way to play sometimes entails managers doing worse than if both were to play incorrectly. Non zero-sum games fall into categories with very different outcomes and recommendations for action. We outline these in Game Theory for Managers Part 2. WINNING A NON ZERO-SUM GAME Insight Non zero-sum games are not simple win/lose situations. In this they mirror most business situations where competing firms often rise or fall at the same time. 17

Solving Games That all play the best way they can (optimally) is a major, but useful, assumption. This allows us to determine what should happen in a game. This is sometimes called a "no regrets solution, i.e. where the person can t do any better given what the other person does. The solution of a game will be as follows: Look for dominant options, assume dominant options are chosen and ignore dominated options Try to find a solution when ignoring dominated options Use a mixed strategy if the game cannot be solved using dominant options SOLVING GAMES 18

A Dominant Action Dominance is when one action is best for a manager regardless of what the other manager does. This makes the game simple: No prediction of the other manager s action is needed when a dominant action exists. Strong dominance is when one action is always best. Weak dominance is when one action is sometimes better and never worse than the other action. In the case of weak dominance, you should take that action as you will never be worse off and may be better off. A DOMINANT ACTION 19

Action Y Manager A Action X Example of a Dominant Action Manager B Action X Action Y -3-2 3 2-2 -1 EXAMPLE OF A DOMINANT ACTION 2 1 Action X is strongly dominant for A as 3>2 and 2>1 Q: Is there a dominant action for Manager B? Action Y is strongly dominant for B as -2>-3 and -1>-2 Insight In a situation where one action is dominant, the other actions are referred to as dominated actions. 20

Solution If Manager Has A Dominant Action Assume any manager with a dominant action chooses it. Ignore the dominated option It is tempting to hope a competitor will take a dominated action if you d get a big payoff if they did: e.g. maybe they will do something foolish In game theory we assume others act correctly, don t change this assumption however tempting. When an option becomes best only after removing an other player s option this is called iterated dominance. (This does not count as dominance in the initial matrix). SOLUTION IF MANAGER HAS A DOMINANT ACTION 21

Action Y Manager A Action X Solving Games With Two Dominant Solutions Action X Manager B Action Y -3-2 3 2-2 -1 2 1 Solution Action X is strongly dominant for A as 3>2 and 2>1 Action Y is strongly dominant for B as -2>-3 and -1>-2 So ignore action Y for A and action X for B A will choose X and B Y. Manager A will win 2 and B will lose 2 each time they play this game. (B hates this game) SOLVING GAMES WITH TWO DOMINANT SOLUTIONS 22

Action Y Manager A Action X Solving Games With One Dominant Solution What should manager A do? A s best choice isn t clear But manager A knows B won t choose Y as it is weakly dominated by X +2>1 & 0=0 Ignore manager B choosing Y Given manager B will choose X manager A should choose action X, +2>-1 The solution is that both choose X. Action X Solution Manager B Action Y +2-1 +2 0 0 0-1 +10 Note although both choosing Y gives A a tempting payoff of 10 it simply won t happen and should be ignored. SOLVING GAMES WITH ONE DOMINANT SOLUTION 23

Mixed Strategies Mixed strategies involve a manager being deliberately unpredictable, using a random strategy. Sometimes tax authorities audit, sometimes they don t. Mixed strategies are useful when predictability can be taken advantage of, or if everyone using same strategy is ruinous, e.g. think advertising wars when no one backs down. Mixed strategies are when no dominant strategies exist: MIXED STRATEGIES You find no (strongly or weakly) dominant solutions. Calculating correct mixed strategies is tricky. In this tutorial just identify when a mixed strategy is appropriate. 24

Action Y Manager A Action X Identifying Mixed Strategy Games What is A s best choice? X is better than Y if B chooses X But Y is better than X if B Chooses Y Action X Manager B What will manager B choose? It isn t clear either. Action Y 1 0 3 0 0 3 0 1 IDENTIFYING MIXED STRATEGY GAMES X is better than Y if A chooses X But Y is better than X if A Chooses Y Assuming the managers cannot discuss their problem the answer is to use a mixed strategy. Both managers do X & Y randomly at calculated probability. 25

Marketing Metrics by Farris, Bendle, Pfeifer and Reibstein, 2 nd edition - And - Game Theory - Further Reference Game Theory for Managers Part 2 Playing the Right Game (advanced MBTN module Available 2014). This module provides insight into types of games, such as pricing games, that exist and how best to play them. GAME THEORY FURTHER REFERENCE 26