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.

Slides:

Advertisements

Similar presentations

Introduction to Game Theory

Advertisements

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

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.

APPENDIX An Alternative View of the Payoff Matrix n Assume total maximum profits of all oligopolists is constant at 200 units. n Alternative policies.

A very little Game Theory Math 20 Linear Algebra and Multivariable Calculus October 13, 2004.

1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.

Simultaneous- Move Games with Mixed Strategies Zero-sum Games.

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.

An Introduction to... Evolutionary Game Theory

Copyright (c) 2003 Brooks/Cole, a division of Thomson Learning, Inc

Study Group Randomized Algorithms 21 st June 03. Topics Covered Game Tree Evaluation –its expected run time is better than the worst- case complexity.

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.

Game Theory 1. Game Theory and Mechanism Design Game theory to analyze strategic behavior: Given a strategic environment (a “game”), and an assumption.

© 2015 McGraw-Hill Education. All rights reserved. Chapter 15 Game Theory.

Game Theory. “If you don’t think the math matters, then you don’t know the right math.” Chris Ferguson 2002 World Series of Poker Champion.

Game Theory: introduction and applications to computer networks Game Theory: introduction and applications to computer networks Zero-Sum Games (follow-up)

Chapter 15- Game Theory: The Mathematics of Competition

Part 3: The Minimax Theorem

5/16/20151 Game Theory Game theory was developed by John Von Neumann and Oscar Morgenstern in Economists! One of the fundamental principles of.

Part 4: Dominant Strategies

Duality Lecture 10: Feb 9. Min-Max theorems In bipartite graph, Maximum matching = Minimum Vertex Cover In every graph, Maximum Flow = Minimum Cut Both.

An Introduction to Game Theory Part III: Strictly Competitive Games Bernhard Nebel.

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.

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.

Some Definitions –Maxi-min (mini-max) strategy: The maxi-min strategy is the path with the highest possible (maximum) worst (minimum) outcome. –Dominant.

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.

f has a saddle point at (1,1) 2.f has a local minimum at.

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.

4 Game Theory To accompany Quantitative Analysis for Management, Twelfth Edition, by Render, Stair, Hanna and Hale Power Point slides created by Jeff Heyl.

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.

Q 5-2 a. E = Efficiency score wi = Weight applied to i ’s input and output resources by the composite hospital.

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.

1 CRP 834: Decision Analysis Week Four Notes. 2 Review Game Theory –Classification and Description –Two Person Zero-Sum Game Game w/ Dominating Strategy.

Chapter 12 & Module E Decision Analysis & Game Theory.

Game Playing. Introduction One of the earliest areas in artificial intelligence is game playing. Two-person zero-sum game. Games for which the state space.

1 1 Slide © 2006 Thomson South-Western. All Rights Reserved. Slides prepared by JOHN LOUCKS St. Edward’s University.

1 CRP 834: Decision Analysis Week Three Notes. 2 Review Decision-Flow Diagram –A road map of all possible strategies and outcomes –At a decision fork,

Part 3 Linear Programming

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.

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.

INDEX Introduction of game theory Introduction of game theory Significance of game theory Significance of game theory Essential features of game theory.

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.

Input – Output Models P = # of items produced

Chapter 6 Game Theory (Module 4) 1.

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.

Finding Best Responses by Underlining Payoffs

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.

Presentation transcript:

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 study of how optimal strategies are formulated in conflict. Game theory is one way to consider the impact of the strategies of others on our strategies and outcomes.

What type of Games we focus? Two-person, zero-sum games

EXAMPLE StrategyY1 (Use Radio) Y2(Use newspaper) X1 (Use Radio) 35 X2 (Use Newspaper) 1-2 Game Player Y’s Strategies Game Player X’s Strategies

Minimax The Minimax Criterion A player using the minimax criterion will select the strategy that minimizes the maximum possible loss. A player using the minimax criterion will select the strategy that minimizes the maximum possible loss. The upper value of the game is equal to the minimum of the maximum values in the columns. The lower value of the game is equal to the maximum of the minimum values in the rows. saddle point Pure Strategy An equilibrium or saddle point condition exists if the upper value of the game is equal to the lower value of the game. This is called the value of the game. Hence, Pure Strategy is present.

Pure Pure Strategy Games A pure strategy exists whenever a saddle point is present. a pure strategy will always be the same regardless of the other player’s strategy. When it is a pure strategy, the strategy each player should follow will always be the same regardless of the other player’s strategy.

Mixed Mixed Strategy Games When there is no saddle point, a mixed strategy game exists. For mixed strategies, players will play each strategy for a certain percentage of the time. no matter what the other player’s strategy happens to be. Each player desires a strategy that will result n the most winnings no matter what the other player’s strategy happens to be.

EXAMPLE StrategyY1 (Q) Y2 (1-Q) X1 (P)42 X2 (1-P)110 Game Player Y’s Strategies Game Player X’s Strategies

Mixed Strategies Let  P, 1-P = fraction of the time X plays strategies X1 and X2 respectively  Q, 1-Q = fraction of the time Y plays strategies Y1 and Y2 respectively Game Value = X1,Y1Payoff(P)(Q)+X1,Y2Payoff(P)(1- Q)+X2Y1Payoff(1-P)(Q)+X2Y2Payoff(1-P)(1-Q)

Dominance reduce the size Dominance can be used to reduce the size of games by eliminating strategies that would never be played A strategy for a player is said to be dominated if the player can always do as well or better playing another strategy. A strategy for a player is said to be dominated if the player can always do as well or better playing another strategy.

Examples StrategyY1Y2 X143 X2520 X32

Examples(2) StrategyY1Y2Y3Y4 X X

Examples (3) StrategyY1Y2Y3 X14-35 X X313 X4052