Name: Trương Hoài Anh Facebook: Quasar Hoaianh

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.
Game Theory Assignment For all of these games, P1 chooses between the columns, and P2 chooses between the rows.
Game Theory S-1.
15 THEORY OF GAMES CHAPTER.
Decision Theory.
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
Two-Player Zero-Sum Games
Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.
1 Chapter 4: Minimax Equilibrium in Zero Sum Game SCIT1003 Chapter 4: Minimax Equilibrium in Zero Sum Game Prof. Tsang.
Copyright (c) 2003 Brooks/Cole, a division of Thomson Learning, Inc
Managerial Decision Modeling with Spreadsheets
Game theory.
Game Theory, Part 1 Game theory applies to more than just games. Corporations use it to influence business decisions, and militaries use it to guide their.
© 2015 McGraw-Hill Education. All rights reserved. Chapter 15 Game Theory.
Game Theory: introduction and applications to computer networks Game Theory: introduction and applications to computer networks Zero-Sum Games (follow-up)
Chapter 14 Game Theory to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004 Brooks/Cole, a.
Homework Solutions MGMT E-5070 Game Theory Computer-Based Manual.
Matrix Games Mahesh Arumugam Borzoo Bonakdarpour Ali Ebnenasir CSE 960: Selected Topics in Algorithms and Complexity Instructor: Dr. Torng.
Lectures in Microeconomics-Charles W. Upton Minimax Strategies.
Finite Mathematics & Its Applications, 10/e by Goldstein/Schneider/SiegelCopyright © 2010 Pearson Education, Inc. 1 of 68 Chapter 9 The Theory of Games.
Decision Analysis Chapter 3
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 2 Computer solutions.
Minimax Strategies. Everyone who has studied a game like poker knows the importance of mixing strategies. –With a bad hand, you often fold –But you must.
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.
Chapter 12 & Module E Decision Theory & Game Theory.
Chapter 3 Decision Analysis.
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 Warin Chotekorakul MD 1/2004. Introduction A game is a contest involving to or more players, each of whom wants to win. Game theory is the.
Q 5-2 a. E = Efficiency score wi = Weight applied to i ’s input and output resources by the composite hospital.
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.
Dominance Since Player I is maximizing her security level, she prefers “large” payoffs. If one row is smaller (element- wise) than another,
Game Theory Presented By: - Mrityunjay Sanwalot SMU II Sem.
1 1 Slide © 2006 Thomson South-Western. All Rights Reserved. Slides prepared by JOHN LOUCKS St. Edward’s University.
When dealing with a model, we use the letter  for the mean. We write or, more often, replacing p by, Instead of , we can also write E(X ). ( Think of.
Part 3 Linear Programming
MBF1413 | Quantitative Methods Prepared by Dr Khairul Anuar
1 What is Game Theory About? r Analysis of situations where conflict of interests is present r Goal is to prescribe how conflicts can be resolved 2 2 r.
Game Theory Optimal Strategies Formulated in Conflict MGMT E-5070.
Lecture 12. Game theory So far we discussed: roulette and blackjack Roulette: – Outcomes completely independent and random – Very little strategy (even.
A Closer Look at Game Theory: The Hat Puzzle By Julia Greenberger.
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.
1 a1a1 A1A1 a2a2 a3a3 A2A Mixed Strategies When there is no saddle point: We’ll think of playing the game repeatedly. We continue to assume that.
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.
Introduction to probability (3) Definition: - The probability of an event A is the sum of the weights of all sample point in A therefore If A1,A2,…..,An.
Game Theory [geym theer-ee] : a mathematical theory that deals with the general features of competitive situations in a formal abstract way.
Chapter 15: Game Theory: The Mathematics Lesson Plan of Competition
Lecture 13.
Tools for Decision Analysis: Analysis of Risky Decisions
Lecture 12.
Chapter 6 Game Theory (Module 4) 1.
Game Theory.
Solutions Sample Games 1
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.
Game Theory II Solutions 1
Game Theory Day 4.
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 15: Game Theory: The Mathematics Lesson Plan of Competition
Operations Research: Applications and Algorithms
Presentation transcript:

Name: Trương Hoài Anh Email: hoaianh.quasar@gmail.com Facebook: Quasar Hoaianh Website: qm-for-business-class-of-mr-Huy8.webnode.vn Class email: Qmforbusiness.baiu@gmail.com Pass: qmiu12345678

Chapter 1: Introduction to Quantitative Analysis Describe the quantitative analysis approach Understand the application of quantitative analysis in a real situation Describe the use of modeling in quantitative analysis Use computers and spreadsheet models to perform quantitative analysis Discuss possible problems in using quantitative analysis Perform a break-even analysis

Chapter 2: Probability Basic Definitions: Events, Sample Space, and Probabilities Basic Rules for Probability Conditional Probability Independence of Events Combinatorial Concepts The Law of Total Probability and Bayes’ Theorem Random variables

Module 1: Game theory Two-person means there are two competing players in the game. Zero-sum means the gain (or loss) for one player is equal to the corresponding loss (or gain) for the other player. The gain and loss balance out so that there is a zero-sum for the game. What one player wins, the other player loses.

Module 1: Game theory Payoff table 4 steps Row minimum Maximin Column maximum Minimax Pure vs Mixed vs Dominated strategies Expected value (EV)/saddle point

Example 1 Player II Player I b1 b2 a1 19 20 a2 5 -4 Row minimum 19 -4 Best Strategy For Player II Player II Player I b1 b2 a1 19 20 a2 5 -4 Row minimum 19 -4 Column maximum 19 20 Maximin Payoff Best Strategy For Player I Minimax Payoff

Example 2 Player I holds a black Ace and a red 8. Player II holds a red 2 and a black 7. The players simultaneously choose a card to play. If the chosen cards are of the same color, Player I wins. Player II wins if the cards are of different colors. The amount won is a number of dollars equal to the number on the winner’s card (Ace counts as 1.) Establish the payoff table Find the value of the game and the optimal mixed strategies of the players

Player II Player I Red 2 Black 7 Row minimum b1 b2 Black Ace a1 Red 8 Column maximum -2 -2 1 -7 8 -7 8 1

Expected value Player I EV for q: -2q+8(1-q)=q-7(1-q) => q=15/18 Red 2 Black 7 EV Player I b1 (p) b2 (1-p) Black Ace a1 (q) Red 8 a2 (1-q) -2 1 8 -7 -2p + (1-p) 8p -7(1-p) -2q + 8(1-q) q -7(1-q) EV for q: -2q+8(1-q)=q-7(1-q) => q=15/18 EV for p: -2p+(1-p)=8p-7(1-p) => p=4/9 EV: -2(4/9)+(1-4/9)= -1/3

Dominated strategy 2 players, zero-sum At least one player has more than 2 options Solution Payoff 4 steps Pure strategy or mixed strategy Pure => EV Mixed => elimination => EV

Example 3 Row minimum Y1 Y2 X1 13 X2 6 8 X3 12 14 6 12 Column maximum X2 6 8 X3 12 14 6 12 Column maximum 13 14

Example 3 Row minimum Y1 Y2 X1 13 X2 6 8 X3 12 14 12 Column maximum 13 X2 6 8 X3 12 14 12 Column maximum 13 14

M4.15 ST Co. and FF Co. are both vying for more share of the market. If ST does no advertising, it will not lose any share of market if FF does nothing. It will lose 2% of market if FF invests $10,000, and it will lose 5% if FF invests $20,000 in advertising. On the other hand, if ST invests $15,000 it will gain 3% if FF does nothing; gain 1% if FF invests $10,000; and lose 1% if FF invests $20,000 in advertising. Develop a payoff table Find the value of the game

M4.15 (sol.) ST Co. Do nothing $10,000 $20,000 Row minimum b1 b2 b3 a1 -2 -5 $15,000 a2 3 1 -1 Column maximum -1