We think you have liked this presentation. If you wish to download it, please recommend it to your friends in any social system. Share buttons are a little bit lower. Thank you!
Presentation is loading. Please wait.
Published byDaphne Whittlesey
Modified about 1 year ago
Game Theory Assignment For all of these games, P1 chooses between the columns, and P2 chooses between the rows.
Find all the dominant strategies For each game, find as many dominant strategies (for both players) as you can. P1: 10, P2: 10P1: -10, P2: -10 P1: 10, P2: 10 Action 1Action 2 Action 1 Action 2 6, 09, 2 -3, 2-5, 9 Action 1Action 2 P1: 10, P2: -10P1: -10, P2: 10 P1: 10, P2: -10P1: -10, P2: 10 1, 3-1, 9 8, -15, 4 Action 1 Action 2 Action 1 Action 2 Action 1 Action 2 Action 1Action 2 Action 1Action 2
Zero-sum, constant-sum, or general-sum? For each game, determine whether it is zero- sum, constant-sum, or general-sum. 2, -2-11, 11 -4, 49, -9 Action 1Action 2 Action 1 Action 2 6, 09, 2 -3, 9-5, 16 Action 1Action 2 2, 46, 0 1, 53, 3 Action 1 Action 2 Action 1 Action 2 Action 1Action 2
Pareto optima? For each game, find all outcomes that are pareto optimal. 2, -2-11, 11 -4, 49, -9 Action 1Action 2 Action 1 Action 2 1, 10, 1 1, 00, 0 Action 1Action 2 0, 11, 2 1, 32, 2 Action 1 Action 2 Action 1 Action 2 Action 1Action 2 1, 3-1, 9 8, -15, 4 Action 1 Action 2 Action 1Action 2
Pure Strategy Nash equilibria? For each game, find all pure-strategy Nash equilibria. (Note that a strategy is still a “best response” if the other option is tied in terms of payoff for the player.) 2, -2-11, 11 -4, 49, -9 Action 1Action 2 Action 1 Action 2 1, 10, 1 1, 00, 0 Action 1Action 2 0, 11, 2 1, 32, 2 Action 1 Action 2 Action 1 Action 2 Action 1Action 2 1, 3-1, 9 8, -15, 4 Action 1 Action 2 Action 1Action 2
Mixed Strategy Nash equilibria? Find a mixed strategy Nash equilibrium that is not also a pure strategy Nash equilibrium. 5, -5-1, 1 -5, 59, -9 Action 1Action 2 Action 1 Action 2
Non-cooperative Game Theory Notes by Alberto Bressan.
6.1 Consider a simultaneous game in which player A chooses one of two actions (Up or Down), and B chooses one of two actions (Left or Right). The game.
\ B A \ Draw a graph to show the expected pay-off for A. What is the value of the game. How often should A choose strategy 1? If A adopts a mixed.
KRUGMAN'S MICROECONOMICS for AP* Game Theory Margaret Ray and David Anderson 65 Module.
Game Theory and Applications following H. Varian Chapters 28 & 29.
Day 9 GAME THEORY. 3 Solution Methods for Non-Zero Sum Games Dominant Strategy Iterated Dominant Strategy Nash Equilibrium NON- ZERO SUM GAMES HOW TO.
Game Theory And Competition Strategies. Chapter Preview: Analyze simple game in order to understand the concept of a Nash Equilibrium. Learn about dominant.
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna S-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Supplement 1.
Lecture Slides Dixit and Skeath Chapter 4. Simultaneous-Move Games with Discrete Strategies Pure Strategies vs. Mixed Strategies Game Matrix or Payoff.
Chapter 17: Making Complex Decisions April 1, 2004.
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.
Strategic Decisions in Noncooperative Games Introduction to Game Theory.
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.
Game Theory: Key Concepts Zero Sum Games Zero Sum Games Non – Zero Sum Games Non – Zero Sum Games Strategic Form Games Lay out strategies Strategic Form.
Two Player Zero-Sum Games Calculating Saddlepoints an algebraic approach.
Game - Speak Noncooperative games Players Rules of the game –Order (who chooses when) –Chance (moves by nature) –Information set (who knows what … and.
An Introduction to Game Theory Part III: Strictly Competitive Games Bernhard Nebel.
Social Networks 101 P ROF. J ASON H ARTLINE AND P ROF. N ICOLE I MMORLICA.
Game Theory and Strategy. Content Two-persons Zero-Sum Games Two-Persons Non-Zero-Sum Games N-Persons Games.
For any player i, a strategy weakly dominates another strategy if (With at least one S -i that gives a strict inequality) strictly dominates if where.
Microeconomics Course E John Hey. Examinations Go to Read.
This Segment: Computational game theory Lecture 1: Game representations, solution concepts and complexity Tuomas Sandholm Computer Science Department Carnegie.
Daniel Spiro, ECON Incomplete information: Perfect Bayesian equilibrium Lectures in Game Theory Fall 2015, Lecture 6.
Non-cooperative Games Elon Kohlberg February 2, 2015.
1 Chapter 4: Minimax Equilibrium in Zero Sum Game SCIT1003 Chapter 4: Minimax Equilibrium in Zero Sum Game Prof. Tsang.
Steffen Staab 1WeST Web Science & Technologies University of Koblenz ▪ Landau, Germany Network Theory and Dynamic Systems Game Theory:
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 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.
Pondering more Problems. Enriching the Alice-Bob story Go to AGo to B Go to A Alice Go to B Go to A Go to B Go shoot pool Alice.
Mixed Strategies and Repeated Games Game Theory 2.
Competitive Safety Analysis: Robust Decision-Making in Multi- Agent Systems Moshe Tennenholtz Kyle Rokos.
Two-Player Zero-Sum Games Finding the saddle-point – Example #2.
Yale lectures 3 and 4 review Iterative deletion of dominated strategies. Ex: two players choose positions on political spectrum. Endpoints become repeatedly.
MIT and James Orlin © Game Theory 2-person 0-sum (or constant sum) game theory 2-person game theory (e.g., prisoner’s dilemma)
1 1 Slide © 2006 Thomson South-Western. All Rights Reserved. Slides prepared by JOHN LOUCKS St. Edward’s University.
Differential Game Theory Notes by Alberto Bressan.
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.
Some Definitions –Maxi-min (mini-max) strategy: The maxi-min strategy is the path with the highest possible (maximum) worst (minimum) outcome. –Dominant.
Lectures in Microeconomics-Charles W. Upton Game Theory.
Chapter 9: Economics of Strategy: Game theory Brickley, Smith, and Zimmerman, Managerial Economics and Organizational Architecture, 4th ed.
© 2008 Prentice-Hall, Inc. Module 4 To accompany Quantitative Analysis for Management, Tenth Edition, by Render, Stair, and Hanna Power Point slides created.
EC102: CLASS 9 Christina Ammon. Game Theory - Concepts Players Actions Strategies Pay-offs Nodes What do we assume about the information set?
Outline In-Class Experiment on a Coordination Game Test of Equilibrium Selection I :Van Huyck, Battalio, and Beil (1990) Test of Equilibrium Selection.
Working Some Problems.
The Science of Networks 6.1 Today’s topics Game Theory Normal-form games Dominating strategies Nash equilibria Acknowledgements Vincent Conitzer, Michael.
Strategic Behavior in Business and Econ Static Games of complete information: Dominant Strategies and Nash Equilibrium in pure and mixed strategies.
Lecture 1 - Introduction 1. Introduction to Game Theory Basic Game Theory Examples Strategic Games More Game Theory Examples Equilibrium Mixed.
Games of pure conflict two-person constant sum games.
Game Theory Advertising Example 1. Game Theory What is the optimal strategy for Firm A if Firm B chooses to advertise? 2.
Intermediate Microeconomics Game Theory. So far we have only studied situations that were not “strategic”. The optimal behavior of any given individual.
© 2017 SlidePlayer.com Inc. All rights reserved.