Game Theory Assignment For all of these games, P1 chooses between the columns, and P2 chooses between the rows.

Slides:

Advertisements

Similar presentations

Social Networks 101 P ROF. J ASON H ARTLINE AND P ROF. N ICOLE I MMORLICA.

Advertisements

Chapter 17: Making Complex Decisions April 1, 2004.

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.

Two Player Zero-Sum Games

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

This Segment: Computational game theory Lecture 1: Game representations, solution concepts and complexity Tuomas Sandholm Computer Science Department Carnegie.

Two-Player Zero-Sum Games

1 Chapter 4: Minimax Equilibrium in Zero Sum Game SCIT1003 Chapter 4: Minimax Equilibrium in Zero Sum Game Prof. Tsang.

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.

MIT and James Orlin © Game Theory 2-person 0-sum (or constant sum) game theory 2-person game theory (e.g., prisoner’s dilemma)

Game Theory Advertising Example 1. Game Theory What is the optimal strategy for Firm A if Firm B chooses to advertise? 2.

Non-cooperative Games Elon Kohlberg February 2, 2015.

Network Theory and Dynamic Systems Game Theory: Mixed Strategies

Game Theory And Competition Strategies

EC102: Class 9 Christina Ammon.

Non-cooperative Game Theory Notes by Alberto Bressan.

Chapter 9: Economics of Strategy: Game theory

Differential Game Theory Notes by Alberto Bressan.

Yale lectures 3 and 4 review Iterative deletion of dominated strategies. Ex: two players choose positions on political spectrum. Endpoints become repeatedly.

Game Theory and Applications following H. Varian Chapters 28 & 29.

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.

Lectures in Microeconomics-Charles W. Upton Game Theory.

Outline  In-Class Experiment on a Coordination Game  Test of Equilibrium Selection I :Van Huyck, Battalio, and Beil (1990)  Test of Equilibrium Selection.

Game - Speak Noncooperative games Players Rules of the game –Order (who chooses when) –Chance (moves by nature) –Information set (who knows what … and.

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.

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

Lecture Slides Dixit and Skeath Chapter 4

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.

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.

Strategic Decisions in Noncooperative Games Introduction to Game Theory.

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

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

Mixed Strategies and Repeated Games

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.

Incomplete information: Perfect Bayesian equilibrium

Games of pure conflict two-person constant sum games.

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.

Microeconomics Course E John Hey. Examinations Go to Read.

KRUGMAN'S MICROECONOMICS for AP* Game Theory Margaret Ray and David Anderson 65 Module.

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.

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.

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.

Competitive Safety Analysis: Robust Decision-Making in Multi- Agent Systems Moshe Tennenholtz Kyle Rokos.

Working Some Problems.

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.

Q 2.1 Nash Equilibrium Ben

Chapter 28 Game Theory.

Yuan Deng Vincent Conitzer Duke University

Mixed Strategies Keep ‘em guessing.

Microeconomics Course E

Intermediate Microeconomics

Game Theory M.Pajhouh Niya M.Ghotbi

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

Planning of Barus & Holley Addition

A useful reduction (SAT -> game)

Chapter 6 Game Theory (Module 4) 1.

Oligopoly & Game Theory Lecture 27

Multiagent Systems Game Theory © Manfred Huber 2018.

Managerial Economics Kyle Anderson

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.

Molly W. Dahl Georgetown University Econ 101 – Spring 2009

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

Operations Research: Applications and Algorithms

Lecture Game Theory.

Normal Form (Matrix) Games

Presentation transcript:

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