By: Donté Howell Game Theory in Sports. What is Game Theory? It is a tool used to analyze strategic behavior and trying to maximize his/her payoff of.

Slides:



Advertisements
Similar presentations
The Basics of Game Theory
Advertisements

Chapter 17: Making Complex Decisions April 1, 2004.
Mixed Strategies.
Introduction to Game Theory
GAME THEORY.
Nash’s Theorem Theorem (Nash, 1951): Every finite game (finite number of players, finite number of pure strategies) has at least one mixed-strategy Nash.
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.
3. Basic Topics in Game Theory. Strategic Behavior in Business and Econ Outline 3.1 What is a Game ? The elements of a Game The Rules of the.
Introduction to Game theory Presented by: George Fortetsanakis.
Chapter Twenty-Eight Game Theory. u Game theory models strategic behavior by agents who understand that their actions affect the actions of other agents.
Two-Player Zero-Sum Games
ECO290E: Game Theory Lecture 5 Mixed Strategy Equilibrium.
Chapter 6 Game Theory © 2006 Thomson Learning/South-Western.
1 Chapter 4: Minimax Equilibrium in Zero Sum Game SCIT1003 Chapter 4: Minimax Equilibrium in Zero Sum Game Prof. Tsang.
Chapter 6 Game Theory © 2006 Thomson Learning/South-Western.
An Introduction to... Evolutionary Game Theory
MIT and James Orlin © Game Theory 2-person 0-sum (or constant sum) game theory 2-person game theory (e.g., prisoner’s dilemma)
EC3224 Autumn Lecture #04 Mixed-Strategy Equilibrium
Game theory.
Game Theory 1. Game Theory and Mechanism Design Game theory to analyze strategic behavior: Given a strategic environment (a “game”), and an assumption.
OLIGOPOLY A market structure in which there are few firms, each of which is large relative to the total industry. Key idea: Decision of firms are interdependent.
Part 3: The Minimax Theorem
Chapter 11 Game Theory and the Tools of Strategic Business Analysis.
Game Theory.
An Introduction to Game Theory Part I: Strategic Games
GAME THEORY.
Chapter 6 © 2006 Thomson Learning/South-Western Game Theory.
5/16/20151 Game Theory Game theory was developed by John Von Neumann and Oscar Morgenstern in Economists! One of the fundamental principles of.
GAME THEORY By Ben Cutting & Rohit Venkat. Game Theory: General Definition  Mathematical decision making tool  Used to analyze a competitive situation.
A camper awakens to the growl of a hungry bear and sees his friend putting on a pair of running shoes, “You can’t outrun a bear,” scoffs the camper. His.
Todd and Steven Divide the Estate Problem Bargaining over 100 pounds of gold Round 1: Todd makes offer of Division. Steven accepts or rejects. Round.
An Introduction to Game Theory Part II: Mixed and Correlated Strategies Bernhard Nebel.
Lecture 1 - Introduction 1.  Introduction to Game Theory  Basic Game Theory Examples  Strategic Games  More Game Theory Examples  Equilibrium  Mixed.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
Introduction to Game Theory Yale Braunstein Spring 2007.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
Game Theory.
Starbucks, Beating The Prisoners Dillema Brooke Hatcher Econ 202 April 28 th, 2012.
Game Theory, Strategic Decision Making, and Behavioral Economics 11 Game Theory, Strategic Decision Making, and Behavioral Economics All men can see the.
Chapter 12 Choices Involving Strategy Copyright © 2014 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written.
A Game-Theoretic Approach to Strategic Behavior. Chapter Outline ©2015 McGraw-Hill Education. All Rights Reserved. 2 The Prisoner’s Dilemma: An Introduction.
ECO290E: Game Theory Lecture 12 Static Games of Incomplete Information.
Games of Strategy (Game Theory) Topic 1 – Part IV.
Dynamic Games of complete information: Backward Induction and Subgame perfection - Repeated Games -
Standard and Extended Form Games A Lesson in Multiagent System Based on Jose Vidal’s book Fundamentals of Multiagent Systems Henry Hexmoor, SIUC.
The Design & Analysis of the Algorithms Lecture by me M. Sakalli Download two pdf files..
Dynamic Games & The Extensive Form
Game theory & Linear Programming Steve Gu Mar 28, 2008.
Game Theory: introduction and applications to computer networks Game Theory: introduction and applications to computer networks Lecture 2: two-person non.
QR 38, 3/1/07 and 3/8/07 Mixed strategies I.Keeping the opponent indifferent II.Finding a mixed strategy equilibrium III.Odds ratios IV.Mixing in practice.
2008/01/30Lecture 11 Game Theory. 2008/01/30Lecture 12 What is Game Theory? Game theory is a field of Mathematics, analyzing strategically inter-dependent.
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.
Strategic Behavior in Business and Econ Static Games of complete information: Dominant Strategies and Nash Equilibrium in pure and mixed strategies.
Zero-sum Games The Essentials of a Game Extensive Game Matrix Game Dominant Strategies Prudent Strategies Solving the Zero-sum Game The Minimax Theorem.
Statistics Overview of games 2 player games representations 2 player zero-sum games Render/Stair/Hanna text CD QM for Windows software Modeling.
Games of pure conflict two-person constant sum games.
Lec 23 Chapter 28 Game Theory.
Games, Strategies, and Decision Making By Joseph Harrington, Jr. First Edition Chapter 4: Stable Play: Nash Equilibria in Discrete Games with Two or Three.
Game Theory By Ben Cutting & Rohit Venkat.
Q 2.1 Nash Equilibrium Ben
Mixed Strategies Keep ‘em guessing.
Game Theory M.Pajhouh Niya M.Ghotbi
Introduction to Game Theory
Games of pure conflict two person constant sum
Game Theory Fall Mike Shor Topic 3.
Chapter 6 Game Theory (Module 4) 1.
EASTERN MEDITERRANEAN UNIVERSITY DEPARTMENT OF INDUSTRIAL ENGINEERING IENG314 OPERATIONS RESEARCH II SAMIR SAMEER ABUYOUSSEF
MinMax Theorem John von Neumann
Presentation transcript:

By: Donté Howell Game Theory in Sports

What is Game Theory? It is a tool used to analyze strategic behavior and trying to maximize his/her payoff of the game by anticipating the actions of the other players and responding to them correctly

History Of Game Theory Was invented by was invented by John von Neumann and Oskar Morgenstern in 1944 Back then Game Theory was only limited to certain circumstances, but as the years go by the are more and situations where Game Theory can be applied

Where Game Theory can be applied Game theory can be applied in any situation that calls for strategic thinking, such as: Getting a person involved in a crime to confess Businesses competing in a market War Sports Etc.

Elements of Game Theory 1) The agent: Also known as the player, which refers to a person, company, or nation who have their own goals and preferences 2) The utility: The amount of satisfaction, or payoff that an agent receives from the situation or an event 3) The game: The situation or event that all the agents/players involved will be participating in 4) The information: What a player knows about what has already happened in the game, and what can be used to come up with a good strategy 5) The representation: Describes the order of play employed in the game 6) The equilibrium: An outcome of or a solution to the game.

Type Of Games Used In Game Theory For Sports Simultaneous game: This is the type of game where all players come up with a strategy without knowing the strategy that that the other player/players are choosing. The game is simultaneous because each player has no information about the decisions of the other player/players; therefore the decisions were made simultaneously. Simultaneous games are solved using the concept of a Nash Equilibrium. Zero Sum Game: When one player’s loss is equal to anther player’s gain. There the sum of the winnings and losses equal to zero

What is Nash Equilibrium? When a player can receive no positive benefit from changing actions, assuming other players remain constant in their strategies. A game may have multiple Nash equilibria or none at all. There are two different types strategies used to try to achieve a Nash Equilibrium: Pure Strategy Mixed Strategy

The Strategies Pure strategy Having the complete knowledge of how a player will play a game. It determines the move a player will make for any situation he or she could face. Mixed strategy The probability of which a pure strategy will be used. This allows a player to keep an opponent guessing by randomly choosing a pure strategy. Since probabilities are continuous, there are infinitely many mixed strategies available to a player, even if the amount of pure strategies is finite.

The Formula For Calculating the Mixed Strategies Player 2 Player 1 AB Aa,bc,d Be,fg,h Equation used => Let q, be the probability q × a + (1-q) × c = probability of player 2 doing A q × e + (1-q) x g = probability of player 2 doing B q × a + (1-q) × c = q × e + (1-q) x g ->To find probability of maximizing player 2’s payoff p × a + (1-p) × e = probability of player 1 doing A p × c + (1-p) x g = probability of player 1 doing B p × a + (1-p) × e = p × c + (1-p) x g -> To find probability of maximizing of player 1’s payoff

Game Theory In Tennis Server Receiver ForehandBackhand Forehand90,1020,80 Backhand30,7060,40 In this example the payoff for the Receiver is the probability of saving, and the payoff for the Server is the probability of scoring, Let’s consider the potential strategies for the Server: If the Server always aims Forehands then the Receiver (anticipating the Forehand serve) will always move Forehands, and the payo ff s will be (90,10) to Receiver and Server respectively. If the Server always aims Backhands then the Receiver (anticipating the Backhand serve) will always move Backhands and the payo ff s will be (60,40).

Game Theory In Tennis Obviously the server wants the probability to be more in his favor. So the next step would be to find the best mixed strategy for the server to have his best possible performance. Suppose the Server aims Forehands with q probability and Backhands with 1-q probability. Then the Receiver’s payo ff is: q x 90 + (1-q) x 20 = q if she moves Forehands q x 30 + (1-q) x 60 = q if she moves Backhands.

Game Theory In Tennis From these solutions the server sees that the receiver is going to want to maximize their chance of a payoff. Therefore the receiver would move: Forehands if q > q Backhands if q < q Either one if q = q. The Receiver’s payo ff is the larger of 20+70q and 60-30q

Game Theory In Tennis In order for the server to maximize his payoff, he has to minimize the payoff of the receiver. He can do that by setting the two probabilities equal to each other q = 60 − 30q => 100q = 40 => q = 0.4 = 40% This solution tells the server that in order to maximize his payo ff the Server should aim Forehands 40% of the time and Backhands 60% of the time. In this case the Receiver’s payo ff will be: × 0.4 = 60 – 30 × 0.4 = 48%

Game Theory In Tennis The result of Server mixing his serves then the Receiver’s payo ff will be 48%chance of saving it whether he/she moves Forehands or Backhands, or mixes between them. Therefore the Server’s payo ff will be: = 52% of successfully scoring

Game Theory In Tennis NOW, lets do the same thing but for the receiver Lets say the receiver doesn’t mix up their strategy, then the server will move its strategy to the side more favorable to them. Suppose the Receiver moves for Forehands with p probability. Then their payo ff is: p × 90 + (1-p) × 30 = p if the Server aims Forehands p × 20 + (1-p) × 60 = p if the Server aims Backhands.

Game Theory In Tennis The server will look to minimize the receiver's payoff so, they will aim for the smaller side: Forehands if p < p Backhands if p > p Either one if p = p To maximize the receiver’s payoff they have to set them equal to each other: p = 60 − 40p => 100p = 30 => p = 0.3 = 30%

Game Theory In Tennis For the receiver to maximize their payoff they should move for a forehand 30% of the time and backhand 70% of the time. In this case the Receiver’s her payo ff will be 30 + (60 × 0.3) = 60 – (40 × 0.3) = 48. Therefore the Server’s payo ff will be = 52% Mixed Strategy Result Receiver: 0.3F + 0.7B Server: 0.4F + 0.6B At this point both players have found their best possible strategy to maximize their chance of getting their payoff, and don’t have anything to gain by changing their strategies now, therefore this is mixed strategy Nash Equilibrium

Work Cited sum+game sum+game xedStrategy.pdf xedStrategy.pdf