Game Theory Day 4.

Slides:

Advertisements

Similar presentations

9.1 Strictly Determined Games Game theory is a relatively new branch of mathematics designed to help people who are in conflict situations determine the.

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.

15 THEORY OF GAMES CHAPTER.

Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.

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

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. “If you don’t think the math matters, then you don’t know the right math.” Chris Ferguson 2002 World Series of Poker Champion.

Part 4: Dominant Strategies

Linear System of Equations MGT 4850 Spring 2008 University of Lethbridge.

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 Statistics 802. Lecture Agenda Overview of games 2 player games representations 2 player zero-sum games Render/Stair/Hanna text CD QM for.

Arithmetic Operations on Matrices. 1. Definition of Matrix 2. Column, Row and Square Matrix 3. Addition and Subtraction of Matrices 4. Multiplying Row.

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.

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.

13.1 Matrices and Their Sums

The Design & Analysis of the Algorithms Lecture by me M. Sakalli Download two pdf files..

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.

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 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.

AUW Math Center. Magical Card!  Pick a card except Ace,10s, Jack, Queen and Joker  Multiply it by 2  Add 2 with it  Multiply by 5 with the total 

Game Theory [geym theer-ee] : a mathematical theory that deals with the general features of competitive situations in a formal abstract way.

Game theory basics A Game describes situations of strategic interaction, where the payoff for one agent depends on its own actions as well as on the actions.

Mixed Strategies Keep ‘em guessing.

Some more Decrease-and-conquer Algorithms

Introduction to Game Theory

Chapter 15: Game Theory: The Mathematics Lesson Plan of Competition

Nash Equilibrium: Theory

Planning of Barus & Holley Addition

The Duality Theorem Primal P: Maximize

Introduction to Game Theory

Game Theory Just last week:

Tools for Decision Analysis: Analysis of Risky Decisions

Input – Output Models P = # of items produced

Matrices - Addition and Subtraction

4 Rational Numbers: Positive and Negative Fractions.

DETERMINANTS A determinant is a number associated to a square matrix. Determinants are possible only for square matrices.

Simultaneous Move Games: Discrete Strategies

SCIT1003 Chapter 2: Sequential games - perfect information extensive form Prof. Tsang.

CPS 570: Artificial Intelligence Game Theory

Games of pure conflict two person constant sum

Chapter 6 Game Theory (Module 4) 1.

Algorithmic Applications of Game 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.

Game Theory Day 3.

Finding Best Responses by Underlining Payoffs

POSITIVE AND NEGATIVE + -

Lecture 20 Linear Program Duality

Adding and Subtracting Decimals

Adding and Subtracting Decimals

9.3 Linear programming and 2 x 2 games : A geometric approach

3.5 Perform Basic Matrix Operations

Chapter 15: Game Theory: The Mathematics Lesson Plan of Competition

Operations Research: Applications and Algorithms

Chapter 4 Matrices & Determinants

Section 2.3 Systems of Linear Equations:

Game Theory: Day 6 What is Free Will?.

Adding and Subtracting Decimals

MATRICES MATTER!.

Operations Research: Applications and Algorithms

Presentation transcript:

Game Theory Day 4

Dominant Strategy Definition: Strategy s’i strongly dominates all other strategies of player i if the payoff to s’i is strictly greater than the payoff to any other strategy, regardless of which strategy is chosen by the other player(s) Let us consider player 1 and player 2 with strategies a and b. π1(s1b,s2a) > π1(s1a,s2a) π1(s1b,s2b) > π1(s1a,s2b) This would be interpreted as strategy b is strongly dominate over strategy a for player 1. Thus strategy a is the dominated strategy.

(Weakly) Dominant Strategy Definition: Strategy s’i weakly dominates another strategy of player i if the payoff to s’I does at least as well as the payoff to any other strategy, regardless of which strategy is chosen by the other player(s) Let us consider player 1 and player 2 with strategies a and b. π1(s1b,s2a) > π1(s1a,s2a) π1(s1b,s2b) > π1(s1a,s2b) This would be interpreted as strategy b is weakly dominate over strategy a for player 1.

Which are dominant strategy games?

Zero-Sum Games Definition: In a two-player (ONLY) game, the payoffs of player 2 are just the negative of the payoffs of player 1. The incentives of the two players are diametrically opposed (i.e. one player wins if and only if the other loses) Player 1’s worst possibility is also player 2’s best Ex. Card games, chess, one-on-one basketball, etc…

Constant-sum Game Definition: the payoffs of the two players always add up to a constant, say b, no matter what strategy vector is player. π1(s1,s2) + π2(s1,s2) = b Example: Squash (next slide) We can consider a constant-sum game if you subtract the sum from the lowest payoff in each case.

Squash 1\2 Forward (F) Backward (B) Front (f) 20, 80 70, 30 Back (b) 90, 10 30, 70

Matrix Game Notice for a Zero-Sum game, only one set of payoffs need be listed. Domination Compare rows and columns Saddle Point If the entry at the outcome is both less than or equal to any entry in its row and greater than or equal to any entry in its column (matrix game with payoffs to row player) Rose\Colin A B C D 4 2 5 1 -1 -20 3 -16 16 Dominance Principle: A rational player should never play a dominated strategy Saddle Point Principle: If a matrix game has a saddle point, both players should play a strategy which contains it.