Operations Research: Applications and Algorithms

Slides:



Advertisements
Similar presentations
Introduction to Game Theory
Advertisements

GAME THEORY.
Module 4 Game Theory To accompany Quantitative Analysis for Management, Tenth Edition, by Render, Stair, and Hanna Power Point slides created by Jeff Heyl.
Name: Trương Hoài Anh Facebook: Quasar Hoaianh
Two-Person, Zero-Sum Game: Advertising TV N TVN 0 TV N TVN Column Player: Row Player: Matrix of Payoffs to Row.
Game Theory Assignment For all of these games, P1 chooses between the columns, and P2 chooses between the rows.
Game Theory S-1.
A very little Game Theory Math 20 Linear Algebra and Multivariable Calculus October 13, 2004.
Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.
MIT and James Orlin © Game Theory 2-person 0-sum (or constant sum) game theory 2-person game theory (e.g., prisoner’s dilemma)
Copyright (c) 2003 Brooks/Cole, a division of Thomson Learning, Inc
© 2015 McGraw-Hill Education. All rights reserved. Chapter 15 Game Theory.
Operations Research: Applications and Algorithms
Chapter 14 Game Theory to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004 Brooks/Cole, a.
Operations Research: Applications and Algorithms
Copyright © 2003 Brooks/Cole, a division of Thomson Learning, Inc. 1 CHAPTER 11: GAME THEORY to accompany Introduction to Mathematical Programming: Operations.
Chapter 2 Basic Linear Algebra
Finite Mathematics & Its Applications, 10/e by Goldstein/Schneider/SiegelCopyright © 2010 Pearson Education, Inc. 1 of 68 Chapter 9 The Theory of Games.
Game Theory Objectives:
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna S-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Supplement 1.
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.
Game Theory.
Game Theory.
Chapter 12 & Module E Decision Theory & Game Theory.
To accompany Quantitative Analysis for Management,9e by Render/Stair/Hanna M4-1 © 2006 by Prentice Hall, Inc. Upper Saddle River, NJ Module 4 Game.
Chapter 7 Transportation, Assignment & Transshipment Problems
Game Theory Part 2: Zero Sum Games. Zero Sum Games The following matrix defines a zero-sum game. Notice the sum of the payoffs to each player, at every.
The Design & Analysis of the Algorithms Lecture by me M. Sakalli Download two pdf files..
Chapter 14 Game Theory to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004 Brooks/Cole, a.
Chapter 11 Game Theory Math Game Theory What is it? – a way to model conflict and competition – one or more "players" make simultaneous decisions.
Chapter 12 & Module E Decision Analysis & Game Theory.
1 1 Slide © 2006 Thomson South-Western. All Rights Reserved. Slides prepared by JOHN LOUCKS St. Edward’s University.
Game Theory Optimal Strategies Formulated in Conflict MGMT E-5070.
1. 2 Some details on the Simplex Method approach 2x2 games 2xn and mx2 games Recall: First try pure strategies. If there are no saddle points use mixed.
1. 2 You should know by now… u The security level of a strategy for a player is the minimum payoff regardless of what strategy his opponent uses. u A.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
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.
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.
Game Theory [geym theer-ee] : a mathematical theory that deals with the general features of competitive situations in a formal abstract way.
Chapter 12 Game Theory Presented by Nahakpam PhD Student 1Game Theory.
Microeconomics Course E
Chapter 15: Game Theory: The Mathematics Lesson Plan of Competition
Lecture 13.
Tools for Decision Analysis: Analysis of Risky Decisions
Input – Output Models P = # of items produced
Simultaneous Move Games: Discrete Strategies
Chapter 6 Game Theory (Module 4) 1.
Oligopoly & Game Theory Lecture 27
Game Theory.
Solutions Sample Games 1
Chapter 9 Integer Programming
Game Theory Solutions 1 Find the saddle point for the game having the following payoff table. Use the minimax criterion to find the best strategy for.
Operations Research: Applications and Algorithms
Chapter 7 Transportation, Assignment & Transshipment Problems
Lial/Hungerford/Holcomb/Mullins: Mathematics with Applications 11e Finite Mathematics with Applications 11e Copyright ©2015 Pearson Education, Inc. All.
Game Theory II Solutions 1
Copyright © 2006 Brooks/Cole, a division of Thomson Learning, Inc.
Game Theory Day 4.
Game Theory and Strategic Play
Counting Methods and Probability Theory
Game Theory Solutions 1 Find the saddle point for the game having the following payoff table. Use the minimax criterion to find the best strategy for.
Chapter 4 The Simplex Algorithm
Chapter 15: Game Theory: The Mathematics Lesson Plan of Competition
Operations Research: Applications and Algorithms
GAMES AND STRATEGIES.
GAMES AND STRATEGIES.
The dilemma overview paired into groups of two; one is Row, the other Column each simultaneously chooses either C or D a player choosing D increases own.
Counting Methods and Probability Theory
Presentation transcript:

Operations Research: Applications and Algorithms Chapter 14 Game Theory to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004 Brooks/Cole, a division of Thomson Learning, Inc.

Why Game Theory? In many situation, two or more decision makers simultaneously choose an action, and the action chosen by each player affects the rewards earned by the other player. Game theory is useful for making decision in cases where two or more decision makers have conflicting interests.

14.1 Two-Person Zero-Sum and Constant-Sum Games: saddle Points Characteristics of Two-Person Zero-Sum games There are two players (called the row player and column player) The row player must choose 1 of m strategies. Simultaneously, the column player must choose 1 of n strategies. If the row player chooses his/her ith strategy and the column player chooses his/her jth strategy, then the row player receives a reward for aij and the column player loses an amount aij. Thus, we may think of the row player’s reward of aij as coming from the column player. Such a game is called a two-person zero-sum game, which can be represented by a reward matrix.

A zero-sum game is a game in which the payoffs for the players always adds up to zero is called a zero-sum game. Two-person zero-sum is played according to the following basic assumption: Each player chooses a strategy that enables him/her to do the best he/she can, given that his/her opponent knows the strategy he/she is following. A two-person zero-sum game has a saddle point if and only if Max (row minimum) = min (column maximum) all all rows columns

An easy way to spot a saddle point is to observe that the reward for a saddle point must be the smallest number in its row and the largest number in its column. A saddle point can also be thought of as a equilibrium point in that neither player can benefit from a unilateral change in strategy.

Example Row Players’ Stregegy Column Player’s Stretegy Row Minimum 4 10 Row 2 2 3 1 Row 3 6 5 7 Column Maximum

A two-person constant-sum game is a two-player game in which, for any choice of both player’s strategies, the row player’s reward and the column player’s reward add up to a constant value c.

Example During the 8 to 9pm time slot, two networks are vying for an audience of 100 million viewers. Then networks must simultaneously announce the type of show they will air in that time slot. The possible choices for each network and the number of network 1 viewers (in millions) for each choice are shown in following table. For example, if both networks choose a western, the matrix indicates that 35 million people will watch network 1 and 100-35 = 65 million people will watch network 2. Thus, we have a two-person constant-sum game with c = 100 (million). Does this game have a saddle point? What is the value of the same to network 1?

Network 1’ Stregegy Network 2’s Stretegy Row Minimum Western Soap Opera Comedy 35 15 60 45 58 50 38 14 70 Column Maximum

Solution Network 1’ Stregegy Network 2’s Stretegy Row Minimum Western Soap Opera Comedy 35 15 60 45 58 50 38 14 70 Column Maximum