Presentation is loading. Please wait.

Presentation is loading. Please wait.

Game Theory “ If it’s true that we are here to help others, “ If it’s true that we are here to help others, then what exactly are the others here for?

Similar presentations


Presentation on theme: "Game Theory “ If it’s true that we are here to help others, “ If it’s true that we are here to help others, then what exactly are the others here for?"— Presentation transcript:

1 Game Theory “ If it’s true that we are here to help others, “ If it’s true that we are here to help others, then what exactly are the others here for? ” - George Carlin

2 What is Game Theory? Game Theory: The study of situations involving competing interests, modeled in terms of the strategies, probabilities, actions, gains, and losses of opposing players in a game. A general theory of strategic behavior with a common feature of Interdependence. Game Theory: The study of situations involving competing interests, modeled in terms of the strategies, probabilities, actions, gains, and losses of opposing players in a game. A general theory of strategic behavior with a common feature of Interdependence. In other Words: The study of games to determine the probability of winning, given various strategies. In other Words: The study of games to determine the probability of winning, given various strategies. Example: Six people go to a restaurant. Example: Six people go to a restaurant. -Each person pays for their own meal – a simple decision problem -Before the meal, every person agrees to split the bill evenly among them – a game

3 A Little History on Game Theory John von Neumann and Oskar Morgenstern John von Neumann and Oskar Morgenstern - Theory of Games and Economic Behaviors  John Nash - "Equilibrium points in N-Person Games", 1950, Proceedings of NAS. "The Bargaining Problem", 1950, Econometrica. "The Bargaining Problem", 1950, Econometrica. "Non-Cooperative Games", 1951, Annals of Mathematics. "Non-Cooperative Games", 1951, Annals of Mathematics.  Howard W. Kuhn – Games with Imperfect information  Reinhard Selten (1965) -“Sub-game Perfect Equilibrium" (SPE) (i.e. elimination by backward induction)  John C. Harsanyi - "Bayesian Nash Equilibrium"

4 Some Definitions for Understanding Game theory Players-Participants of a given game or games. Players-Participants of a given game or games. Rules-Are the guidelines and restrictions of who can do what and when they can do it within a given game or games. Rules-Are the guidelines and restrictions of who can do what and when they can do it within a given game or games. Payoff-is the amount of utility (usually money) a player wins or loses at a specific stage of a game. Payoff-is the amount of utility (usually money) a player wins or loses at a specific stage of a game. Strategy- A strategy defines a set of moves or actions a player will follow in a given game. A strategy must be complete, defining an action in every contingency, including those that may not be attainable in equilibrium Strategy- A strategy defines a set of moves or actions a player will follow in a given game. A strategy must be complete, defining an action in every contingency, including those that may not be attainable in equilibrium Dominant Strategy -A strategy is dominant if, regardless of what any other players do, the strategy earns a player a larger payoff than any other. Hence, a strategy is dominant if it is always better than any other strategy, regardless of what opponents may do. Dominant Strategy -A strategy is dominant if, regardless of what any other players do, the strategy earns a player a larger payoff than any other. Hence, a strategy is dominant if it is always better than any other strategy, regardless of what opponents may do.

5 Important Review Questions for Game Theory  Strategy Who are the players?Who are the players? What strategies are available?What strategies are available? What are the payoffs?What are the payoffs? What are the Rules of the game What are the Rules of the game What is the time-frame for decisions?What is the time-frame for decisions? What is the nature of the conflict?What is the nature of the conflict? What is the nature of interaction?What is the nature of interaction? What information is available?What information is available?

6 Five Assumptions Made to Understand Game Theory 1. Each decision maker ("PLAYER“) has available to him two or more well-specified choices or sequences of choices (called "PLAYS"). 2. Every possible combination of plays available to the players leads to a well-defined end-state (win, loss, or draw) that terminates the game. 3. A specified payoff for each player is associated with each end- state (a ZERO-SUM game means that the sum of payoffs to all players is zero in each end-state). 4. Each decision maker has perfect knowledge of the game and of his opposition; that is, he knows in full detail the rules of the game as well as the payoffs of all other players. 5. All decision makers are rational; that is, each player, given two alternatives, will select the one that yields him the greater payoff.

7 Cooperative Vs. Non-Cooperative Cooperative Game theory has perfect communication and perfect contract enforcement. Cooperative Game theory has perfect communication and perfect contract enforcement.  A non-cooperative game is one in which players are unable to make enforceable contracts outside of those specifically modeled in the game. Hence, it is not defined as games in which players do not cooperate, but as games in which any cooperation must be self-enforcing.

8 Interdependence of Player Strategies 1) Sequential – Here the players move in sequence, knowing the other players’ previous moves. - To look ahead and reason Back - To look ahead and reason Back 2) Simultaneous – Here the players act at the same time, not knowing the other players’ moves. - Use Nash Equilibrium to solve - Use Nash Equilibrium to solve

9 Simultaneous-move Games of Complete Information Payoffs received by each player for the combinations of the strategies, or for each player, preferences over the combinations of the strategies Payoffs received by each player for the combinations of the strategies, or for each player, preferences over the combinations of the strategies u i (s 1, s 2,...s n ), for all s 1  S 1, s 2  S 2,... s n  S n  A set of players (at least two players) S1 S2... Sn S1 S2... Sn For each player, a set of strategies/actions For each player, a set of strategies/actions {Player 1, S1, Player 2,S2... Player Sn}

10 Nash’s Equilibrium This equilibrium occurs when each player’s strategy is optimal, knowing the strategy's of the other players. This equilibrium occurs when each player’s strategy is optimal, knowing the strategy's of the other players. A player’s best strategy is that strategy that maximizes that player’s payoff (utility), knowing the strategy's of the other players. A player’s best strategy is that strategy that maximizes that player’s payoff (utility), knowing the strategy's of the other players. So when each player within a game follows their best strategy, a Nash equilibrium will occur. So when each player within a game follows their best strategy, a Nash equilibrium will occur. Logic

11 Definition: Nash Equilibrium Given others’ choices, player i cannot be better-off if she deviates from s i *

12 Nash’s Equilibrium cont.: Bayesian Nash Equilibrium Bayesian Nash Equilibrium The Nash Equilibrium of the imperfect- information game The Nash Equilibrium of the imperfect- information game A Bayesian Equilibrium is a set of strategies such that each player is playing a best response, given a particular set of beliefs about the move by nature.A Bayesian Equilibrium is a set of strategies such that each player is playing a best response, given a particular set of beliefs about the move by nature. All players have the same prior beliefs about the probability distribution on nature’s moves.All players have the same prior beliefs about the probability distribution on nature’s moves. – So for example, all players think the odds of player 1 being of a particular type is p, and the probability of her being the other type is 1-p

13 A mathematical rule of logic explaining how you should change your beliefs in light of new information.A mathematical rule of logic explaining how you should change your beliefs in light of new information. Bayes’ Rule:Bayes’ Rule: P(A|B) = P(B|A)*P(A)/P(B) To use Bayes’ Rule, you need to know a few things:To use Bayes’ Rule, you need to know a few things: –You need to know P(B|A) –You also need to know the probabilities of A and B Bayes’ Rule

14 Examples of Where Game Theory Can Be Applied Zero-Sum Games Zero-Sum Games Prisoner’s Dilemma Prisoner’s Dilemma Non-Dominant Strategy moves Non-Dominant Strategy moves Mixing Moves Mixing Moves Strategic Moves Strategic Moves Bargaining Bargaining Concealing and Revealing Information Concealing and Revealing Information

15 Zero-Sum Games Penny Matching: Penny Matching: Each of the two players has a penny. Each of the two players has a penny. Two players must simultaneously choose whether to show the Head or the Tail. Two players must simultaneously choose whether to show the Head or the Tail. Both players know the following rules: Both players know the following rules: -If two pennies match (both heads or both tails) then player 2 wins player 1’s penny. -Otherwise, player 1 wins player 2’s penny. Player 1 Player 2 Tail Head Tail Head -1, 1 1, -1 1, -1 -1, 1

16 Prisoner’s Dilemma No communication: No communication: - Strategies must be undertaken without the full knowledge of what the other players (prisoners) will do.  Players (prisoners) develop dominant strategies but are not necessarily the best one.

17 Payoff Matrix for Prisoner’s Dilemma Confess ConfessBill Not Confess Not Confess Ted Confess Not Confess Both get 5 years 1 year for Bill 10 years for Ted 10 years for Bill 1 year for Ted Both get 3 years

18 Solving Prisoners’ Dilemma Confess is the dominant strategy for both Bill and Ted. Confess is the dominant strategy for both Bill and Ted. Dominated strategy Dominated strategy -There exists another strategy which always does better regardless of other players’ choices -(Confess, Confess) is a Nash equilibrium but is not always the best option -5, -5 -1, ,-1 -3,-3 Bill Ted Not Confess Confess Not Confess Confess Players Strategies Payoffs

19 Non-Dominant strategy games There are many games when players do not have dominant strategies There are many games when players do not have dominant strategies - A player’s strategy will sometimes depend on the other player's strategy - According to the definition of Dominant strategy, if a player depends on the other player’s strategy, he has no dominant strategy.

20 Non-Dominant strategy games Confess ConfessBill Not Confess Not Confess Ted Confess Not Confess 7 years for Bill 2 years for Ted 2 years for Ted 6 years for Bill 4 years for Ted 9 years for Bill 0 years for Ted 0 years for Ted 5 years for Bill 3 years for Ted

21 Solution to Non-Dominant strategy games Ted ConfessesTed doesn’t confess BillBill BillBill Confesses Not confessConfessesNot confess 7 years 9 years 6 years 5 years Best Strategies Best Strategies There is not always a dominant strategy and sometimes your best strategy will depend on the other players move. There is not always a dominant strategy and sometimes your best strategy will depend on the other players move.

22 Examples of Where Game Theory Can Be Applied  Mixing Moves  Examples in Sports (Football & Tennis)  Strategic Moves  War –Cortes Burning His Own Ships  Bargaining  Splitting a Pie  Concealing and Revealing Information  Bluffing in Poker

23 Applying Game Theory to NFL Solving a problem within the Salary Cap. Solving a problem within the Salary Cap. How should each team allocate their Salary cap. (Which position should get more money than the other) How should each team allocate their Salary cap. (Which position should get more money than the other) The Best strategy is the most effective allocation of the team’s money to obtain the most wins. The Best strategy is the most effective allocation of the team’s money to obtain the most wins. Correlation can be used to find the best way to allocate the team’s money. Correlation can be used to find the best way to allocate the team’s money.

24 What is a correlation? A correlation examines the relationship between two measured variables. A correlation examines the relationship between two measured variables. - No manipulation by the experimenter/just observed. - E.g., Look at relationship between height and weight. You can correlate any two variables as long as they are numerical (no nominal variables) You can correlate any two variables as long as they are numerical (no nominal variables) Is there a relationship between the height and weight of the students in this room? Is there a relationship between the height and weight of the students in this room? - Of course! Taller students tend to weigh more.

25 Salaries vs. Points scored/Allowed PositionCorrelationT-test RB k TE OL QB WR PositionCorrelationT-testDE CB S LB DT P00 Running Backs edge out Kickers for best correlation of position spending to team points scored. Tight Ends also show some modest relationship between spending and points. The Defensive Linemen are the top salary correlators, with cornerbacks in the second spot

26 Total Position spending vs. Wins PositionWinsPoints ScoredPoints AllowedTotal Position Correlation Spending K CB TE OL RB QB DE P LB S DT WR Note: Kicker has highest correlation also OL is ranked high also.

27 What this means NFL teams are not very successful at delivering results for the big money spent on individual players. NFL teams are not very successful at delivering results for the big money spent on individual players. There's high risk in general, but more so at some positions over others in spending large chunks of your salary cap space. There's high risk in general, but more so at some positions over others in spending large chunks of your salary cap space.

28 Future Study Increase the Sample size. Increase the Sample size. Cluster Analysis Cluster Analysis Correspondence analysis Correspondence analysis Exploratory Factor Analysis Exploratory Factor Analysis

29 Conclusion  There are many advances to this theory to help describe and prescribe the right strategies in many different situations.  Although the theory is not complete, it has helped and will continue to help many people, in solving strategic games.

30 References Nasar, Sylvia (1998), A Beautiful Mind: A Biography of John Forbes Nash, Jr., Winner of the Nobel Prize in Economics, Simon and Schuster, New York. Rasmusen, Eric (2001), Games and Information: An Introduction to Game Theory, 3 rd ed. Blackwell, Oxford. Gibbons, Robert (1992), Game Theory for Applied Economists. Princeton University Press, Princeton, NJ. Mehlmann, Alexander. The Games Afoot! Game Theory in Myth and Paradox. AMS, Mehlmann, Alexander. The Games Afoot! Game Theory in Myth and Paradox. AMS, Wiens, Elmer G. Reduction of Games Using Dominant Strategies. Vancouver: UBC M.Sc. Thesis, Wiens, Elmer G. Reduction of Games Using Dominant Strategies. Vancouver: UBC M.Sc. Thesis, H. Scott Bierman and Luis Fernandez (1993) Game Theory with Economic Applications, 2nd ed. (1998), Addison-Wesley Publishing Co. D. Blackwell and M. A. Girshick (1954) Theory of Games and Statistical Decisions, John Wiley & Sons, New York. NFL Official, 2004 NFL Record and Fact Book; Time Inc. Home Entertainment, New York, New York.

31 Questions? Comments?


Download ppt "Game Theory “ If it’s true that we are here to help others, “ If it’s true that we are here to help others, then what exactly are the others here for?"

Similar presentations


Ads by Google