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.
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.
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.
Part 3: The Minimax Theorem
Operations Research: Applications and Algorithms
5/16/20151 Game Theory Game theory was developed by John Von Neumann and Oscar Morgenstern in Economists! One of the fundamental principles of.
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
An Introduction to Game Theory Part III: Strictly Competitive Games Bernhard Nebel.
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.
f has a saddle point at (1,1) 2.f has a local minimum at.
Game Theory.
Game Theory.
Presentation by: H. Sarper
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.
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.
1 1 Slide © 2006 Thomson South-Western. All Rights Reserved. Slides prepared by JOHN LOUCKS St. Edward’s University.
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.
Copyright © 2006 Brooks/Cole, a division of Thomson Learning, Inc. Linear Programming: An Algebraic Approach 4 The Simplex Method with Standard Maximization.
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.
Chapter 4 The Simplex Algorithm and Goal Programming
Game Theory [geym theer-ee] : a mathematical theory that deals with the general features of competitive situations in a formal abstract way.
Game Theory By Ben Cutting & Rohit Venkat.
Microeconomics Course E
Chapter 15: Game Theory: The Mathematics Lesson Plan of Competition
The Duality Theorem Primal P: Maximize
Tools for Decision Analysis: Analysis of Risky Decisions
Input – Output Models P = # of items produced
Simultaneous-Move Games: Mixed Strategies
Simultaneous Move Games: Discrete Strategies
Communication Complexity as a Lower Bound for Learning in Games
Chapter 6 Game Theory (Module 4) 1.
Oligopoly & Game Theory Lecture 27
Game Theory.
Chapter 9 Integer Programming
Operations Research: Applications and Algorithms
Copyright © 2006 Brooks/Cole, a division of Thomson Learning, Inc.
Game Theory Day 4.
Game Theory and Strategic Play
Lecture 20 Linear Program Duality
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
Factor Game Sample Game.
GAMES AND STRATEGIES.
GAMES AND STRATEGIES.
MinMax Theorem John von Neumann
Systems of Linear Equations:
Operations Research: Applications and Algorithms
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.

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 if n strategies. If the row player chooses her ith strategy and the column player chooses 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

If a two-person zero-sum game has a saddle point The row player should choose any strategy (row) attaining the maximum on the right side of (1). The column player should choose any strategy (column) attaining the minimum on the right side of (1). 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.

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.