Assoc. Prof. Yeşim Kuştepeli1 GAME THEORY AND APPLICATIONS DOMINANT STRATEGY.

Slides:



Advertisements
Similar presentations
Monte Hall Problem Let’s Draw a Game Tree… Problem 6, chapter 2.
Advertisements

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.
Game Theory Assignment For all of these games, P1 chooses between the columns, and P2 chooses between the rows.
G AME THEORY MILJAN KNEŽEVIĆ FACULTY OF MATHEMATICS UNIVERSITY IN BELGRADE.
Clicker Question-A Chicken Game 0, 0 0, 1 1, 0 -10, -10 Swerve Hang Tough Swerve Hang Tough Player 2 Pllayer 1 Does either player have a dominant strategy?
This Segment: Computational game theory Lecture 1: Game representations, solution concepts and complexity Tuomas Sandholm Computer Science Department Carnegie.
© 2009 Institute of Information Management National Chiao Tung University Game theory The study of multiperson decisions Four types of games Static games.
Bayesian Games Yasuhiro Kirihata University of Illinois at Chicago.
1 Game Theory. 2 Agenda Game Theory Matrix Form of a Game Dominant Strategy and Dominated Strategy Nash Equilibrium Game Trees Subgame Perfection.
Introduction to Microeconomics Game theory Chapter 9.
Game Theory 1. Game Theory and Mechanism Design Game theory to analyze strategic behavior: Given a strategic environment (a “game”), and an assumption.
9.2 Mixed Strategies Two players, Robert and Carol, play a game with payoff matrix (to Robert): Is the game strictly determined? Why? Robert has strategy:
Working Some Problems. Telephone Game How about xexed strategies? Let Winnie call with probability p and wait with probability 1-p. For what values of.
ECO290E: Game Theory Lecture 4 Applications in Industrial Organization.
Game Theory And Competition Strategies
An Introduction to Game Theory Part I: Strategic Games
Eponine Lupo.  Game Theory is a mathematical theory that deals with models of conflict and cooperation.  It is a precise and logical description of.
Check your (Mis)understanding? Number 3.5 page 79 Answer Key claims that: For player 1 a strictly dominates c For player 2, y strictly dominates w and.
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.
Review of Yale Lectures 1 and 2 What is a strictly dominated strategy? Why should you never play one? Why do rational choices sometimes lead to poor decisions?
Yale lectures 3 and 4 review Iterative deletion of dominated strategies. Ex: two players choose positions on political spectrum. Endpoints become repeatedly.
Harsanyi transformation Players have private information Each possibility is called a type. Nature chooses a type for each player. Probability distribution.
Lectures in Microeconomics-Charles W. Upton Game Theory.
© 2008 Pearson Addison Wesley. All rights reserved Chapter Fourteen Game Theory.
Dominant strategies Econ 171. Clicker Question 1, 3 5, 3 2, 4 7, 2 Player 2 Strategy A Strategy B Player 1 Strategy A Strategy B A ) Strategy A strictly.
Nash Equilibrium Econ 171. Suggested Viewing A Student’s Suggestion: Video game theory lecture Open Yale Economics Ben Pollack’s Game Theory Lectures.
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.
DANSS Colloquium By Prof. Danny Dolev Presented by Rica Gonen
Games in the normal form- An application: “An Economic Theory of Democracy” Carl Henrik Knutsen 5/
SUBGAME PERFECT EQUILIBRIUM Prof. Dr. Yeşim Kuştepeli ECO 4413 Game Theory 1.
Chapter 12 Choices Involving Strategy Copyright © 2014 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written.
Game Theory The Prisoner’s Dilemma Game. “Strategic thinking is the art of outdoing an adversary, knowing that the adversary is trying to do the same.
Assoc. Prof. Yeşim Kuştepeli1 GAME THEORY AND APPLICATIONS UNCERTAINTY AND EXPECTED UTILITY.
ECO290E: Game Theory Lecture 12 Static Games of Incomplete Information.
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.
Dominant strategies. Clicker Question 1, 3 5, 3 2, 4 7, 2 Player 2 Strategy A Strategy B Player 1 Strategy A Strategy B A ) Strategy A strictly dominates.
Nash equilibrium Nash equilibrium is defined in terms of strategies, not payoffs Every player is best responding simultaneously (everyone optimizes) This.
\ 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.
Chapters 29, 30 Game Theory A good time to talk about game theory since we have actually seen some types of equilibria last time. Game theory is concerned.
The Science of Networks 6.1 Today’s topics Game Theory Normal-form games Dominating strategies Nash equilibria Acknowledgements Vincent Conitzer, Michael.
UNCERTAINTY AND EXPECTED UTILITY Prof. Dr. Yeşim Kuştepeli ECO 4413 Game Theory 1.
Lecture 5 Introduction to Game theory. What is game theory? Game theory studies situations where players have strategic interactions; the payoff that.
Normal Form Games, Normal Form Games, Rationality and Iterated Rationality and Iterated Deletion of Dominated Strategies Deletion of Dominated Strategies.
Incomplete information: Perfect Bayesian equilibrium
M9302 Mathematical Models in Economics Instructor: Georgi Burlakov 0.Game Theory – Brief Introduction Lecture
5.1.Static Games of Incomplete Information
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.
ECO290E: Game Theory Lecture 3 Why and How is Nash Equilibrium Reached?
Game Theory.  The analysis of situations in which players are interdependent.  Or…from the book….  a method of modelling the strategic interaction.
KRUGMAN'S MICROECONOMICS for AP* Game Theory Margaret Ray and David Anderson 65 Module.
ECO290E: Game Theory Lecture 8 Games in Extensive-Form.
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 Georg Groh, WS 08/09 Verteiltes Problemlösen.
Advanced Subjects in GT Outline of the tutorials Static Games of Complete Information Introduction to games Normal-form (strategic-form) representation.
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.
Chapter 28 Game Theory.
Microeconomics Course E
TIME CONSISTENT MACROECONOMIC POLICY
Simultaneous Move Games: Discrete Strategies
Communication Complexity as a Lower Bound for Learning in Games
GAME THEORY AND APPLICATIONS
Game Theory in Wireless and Communication Networks: Theory, Models, and Applications Lecture 2 Bayesian Games Zhu Han, Dusit Niyato, Walid Saad, Tamer.
نسیم لحیم‌گرزاده استاد درس: دکتر فرزاد توحیدخواه
Chapter 29 Game Theory Key Concept: Nash equilibrium and Subgame Perfect Nash equilibrium (SPNE)
Lecture Game Theory.
Definition of Renegotiation-safe
Introduction to Game Theory
Normal Form (Matrix) Games
Introduction to Game Theory
Presentation transcript:

Assoc. Prof. Yeşim Kuştepeli1 GAME THEORY AND APPLICATIONS DOMINANT STRATEGY

Assoc. Prof. Yeşim Kuştepeli2 Static Game with Pure strategies strictly dominates strictly higher payoffDominant strategy: Strategy S1 strictly dominates S2 for a player if given any collection of strategies that could be played by the other players, playing S1 results in a strictly higher payoff for that player than playing S2. strictly dominatedS2 is said to be strictly dominated by S1. strictly dominant strategyequilibriumThe strategy profile {S1, S2, ….} is a strictly dominant strategy equilibrium if for every player i, Si is a strictly dominant strategy.

Assoc. Prof. Yeşim Kuştepeli3 weakly dominates lower payoff strictly higher payoffWeakly Dominant strategy: Strategy S1 weakly dominates S2 for a player if given any collection of strategies that could be played by the other players, playing S1 never results in a lower payoff for that player than playing S2 and in at least one instance S1 gives the player a strictly higher payoff than does S2. weakly dominatedS2 is said to be weakly dominated by S1. weakly dominant strategyequilibriumThe strategy profile {S1, S2, ….} is a weakly dominant strategy equilibrium if for every player i, Si is a weakly dominant strategy.

Assoc. Prof. Yeşim Kuştepeli4 iterated strictly dominant strategyIterated Dominant strategy: Strategy S1 is an iterated strictly dominant strategy for a player if and only if it is the only strategy in the intersection of the following sequence of rested sets of strategies: 1) Si,1 consists of all of player i’s strategies that are not strictly dominated 2) for n>1 Si,n consists of strategies in Si,n-1 that are not strictly dominated when we restrict the other players to the strategies in Sj,n-1. iterated strictly dominant strategyequilibriumThe strategy profile {S1, S2, ….Sn} is an iterated strictly dominant strategy equilibrium if for every player i, Si is a iterated strictly dominant strategy.

Assoc. Prof. Yeşim Kuştepeli5 A Nash equilibrium is a strategy profile {S1*, S2*, ….Sn*} such that each strategy Si* is an element of set of possible strategies and maximixes the function fi(x)= vi(Si*, …..Si-1*, x, Si+1*, …..Sn*) among the elements of the possible strategy set. At a Nash equilibirum, each player’s equilibrium strategy is a best-response to the belief that the other players will adopt their Nash equilibirum strategies.

Assoc. Prof. Yeşim Kuştepeli6 Russia USA disarmrearm disarm(10,10)(-10,50) rearm(50,-10)(0,0)

Assoc. Prof. Yeşim Kuştepeli7 Pl.2 Pl.1 narrowwide narrow(14,14)(0,16) wide(16,0)(0,0)

Assoc. Prof. Yeşim Kuştepeli8 Pl.2 Pl.1 Don’t drill narrowwide Don’t drill (0,0)(0,44)(0,31) narrow(44,0)(14,14)(-1,16) wide(31,0)(16,-1)(1,1)