Lecture 7: Dominance Concepts

Size: px
Start display at page:

Download "Lecture 7: Dominance Concepts"

Transcription

1 Microeconomics I: Game Theory Lecture 7: Dominance Concepts (see Osborne, 2009, Sect 2.7.8,2.9,4.4) Dr. Michael Trost Department of Applied Microeconomics December 6, 2013 Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 1 / 44

2 Strict Nash equilibrium In this lecture, we introduce alternatives to the Nash equilibrium concept. The first one is a refinement of the Nash equilibrium concept and is called strict Nash equilibrium. Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 2 / 44

3 Dominance concepts After that, we present two solution concepts which are referred to as strict dominance and weak dominance. Both concepts are discussed in context with (ordinary) strategic games and with strategic games with von Neumann- Morgenstern preferences. Moreover, relationships between these dominance concepts and the (mixed action) Nash equilibrium concept are explored. Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 3 / 44

4 Let s play! But before we dip into theory, let us play a game which is known as the PUBLIC GOODS GAME. Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 4 / 44

5 Example: Public Goods Game Each of the n subjects (n > 2) receive an amount of e 10. Every subject secretly chooses how many of this amount to put into a public pot. It is required that the player s contribution to the pot is a nonnegative integer number. The total amount in this pot is doubled and then evenly divided among all subjects. The final income of each subject is the amount of money the subject kept plus the amount of money obtained from the public pot. Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 5 / 44

6 Example: Public Goods Game EXERCISE : Specify the components of the PUBLIC GOODS GAME. ANSWER: Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 6 / 44

7 Example: Public Goods Game EXERCISE : Find the Nash equilibrium of the PUBLIC GOODS GAME by the two-step method! ANSWER: 1 Best response correspondence of player i {1,..., n} B i (a i ) = 2 Nash equilibrium of the PUBLIC GOODS GAME IS a := (a i ) i {1,...,n} = Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 7 / 44

8 Example: Public Goods Game The Nash equilibrium of the PUBLIC GOODS GAME has the property that every player is worse off if she deviates from her Nash equilibrium action given that the other players stick to their Nash equilibrium actions. In general, a Nash equilibrium having such property is called strict. Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 8 / 44

9 Strict Nash equilibrium Definition 7.1 (Strict Nash equilibrium) Consider a strategic game Γ := (I, (A i ) i I, ( i ) i I ). An action profile a := (ai ) i I A is a strict Nash equilibrium of Γ if, for every player i I, U i (ai, a i) > U i (a i, a i) holds for every action a i A i \ {ai }. Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 9 / 44

10 Strict Nash equilibrium The strict Nash equilibrium is a Nash equilibrium in which every player is worse off if she deviates from her equilibrium action given that the other players follow their equilibrium actions. It is a refinement of the (ordinary) Nash equilibrium concept. Indeed, the Nash equilibrium concept only demands that every player is not better off (but maybe equally well) if she deviates from her equilibrium action but if the other players stick to their equilibrium actions. Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 10 / 44

11 Exercise: Secrecy Game Player B Player A don t talk talk don t talk 1,1 0,0 talk 0,0 0,0 EXERCISE: Figure out all Nash equilibria of the SECRECY GAME. Which of them are strict? Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 11 / 44

12 Exercise: Public Goods Game EXERCISE: Show that the Nash equilibrium of the PUBLIC GOODS GAME is strict! EXPLANATION: Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 12 / 44

13 Dominance concepts In the following, we introduce the solution concepts of strict dominance and weak dominance. These concepts are defined in context with (ordinary) strategic games and in context with strategic games with von Neumann-Morgenstern preferences. As we already know, in the latter form of a strategic game the preferences of the players are extended to the set of all lotteries over the action profiles. Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 13 / 44

14 Strict dominance Definition 7.2 Consider a strategic game Γ := (I, (A i ) i I, ( i ) i I ). An action a i a i A i if A i of player i I strictly dominates her action U i (a i, a i ) > U i (a i, a i ) holds for every list a i A i of the other players action. Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 14 / 44

15 Strictly dominant action Consider a strategic game Γ := (I, (A i ) i I, ( i ) i I ). An action a i A i of player i I is termed strictly dominant if it strictly dominates every other action a i A i \ {a i } of player i. Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 15 / 44

16 Exercise: Prisoner s Dilemma Suspect B Suspect A quiet fink quiet 2,2 0,3 fink 3,0 1,1 EXERCISE: Do the suspects have strictly dominant actions in the PRISONER S DILEMMA? Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 16 / 44

17 Exercise: Public Goods Game EXERCISE: Do the subjects of the PUBLIC GOODS GAME have a strictly dominant action? If yes, which one? EXPLANATION: Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 17 / 44

18 Strict dominance and Nash equilibrium Theorem 7.3 Consider a strategic game Γ := (I, (A i ) i I, ( i ) i I ). If action a j A j of some player j I is strictly dominant, then every Nash equilibrium a := (a i ) i I of Γ has the property a j = a j. Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 18 / 44

19 Strict dominance and strict Nash equilibrium Corollary 7.4 Consider a strategic game Γ := (I, (A i ) i I, ( i ) i I ) and suppose each player i I has a strictly dominant action a i A i. Then action profile a := (a i ) i I is the unique Nash equilibrium of Γ and it is even a strict Nash equilibrium. Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 19 / 44

20 Application of Theorem 7.4 Consider the PUBLIC GOODS GAME. It has been shown that the action a i :=... of every player i {1,..., n} is strictly dominant. By Corollary 7.4, we conclude that action profile a := (a i ) i {1,...,n} is the unique Nash equilibrium of the PUBLIC GOODS GAME and, moreover, it is even a strict Nash equilibrium. Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 20 / 44

21 Strictly dominated action Consider a strategic game Γ := (I, (A i ) i I, ( i ) i I ). An action a i A i of player i I is termed strictly dominated if there is some other action a i dominates her action a i. A i \ {a i } of player i that strictly Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 21 / 44

22 Exercise: Game Γ 1 Strategic Game Γ 1 Player B Player A left middle right up 1,3 1,0 2,1 middle 1,1 3,1 1,2 down 0,2 0,2 1,3 EXERCISE: Do the players of game Γ 1 have actions that are strictly dominated. If yes, which ones? Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 22 / 44

23 Strictly dominated action Theorem 7.5 Consider a strategic game Γ := (I, (A i ) i I, ( i ) i I ). If a := (a i ) i I is a Nash equilibrium of Γ, then action a i of every player i I is not strictly dominated. This theorem says that a strictly dominated action is not used in any Nash equilibrium. Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 23 / 44

24 Exercise: Game Γ 1 Strategic game Γ 1 Player B Player A left middle right up 1,3 1,0 2,1 middle 1,1 3,1 1,2 down 0,2 0,2 1,3 EXERCISE: Find the Nash equilibria of game Γ 1! Compare your result with that of the previous exercise. Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 24 / 44

25 Weak dominance Definition 7.6 Consider a strategic game Γ := (I, (A i ) i I, ( i ) i I ). An action a i A i of player i I weakly dominates her action a i A i if the two conditions 1 U i (a i, a i) U i (a i, a i) holds for every list a i A i of the other players actions 2 U i (a i, a i) > U i (a i, a i) holds for some list a i A i of the other players actions are satisfied. Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 25 / 44

26 Weakly dominant action Consider a strategic game Γ := (I, (A i ) i I, ( i ) i I ). An action a i A i of player i I is termed weakly dominant if it weakly dominates every other action a i A i \ {a i } of player i I. Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 26 / 44

27 Exercise: Secrecy Game Player B Player A don t talk talk don t talk 1,1 0,0 talk 0,0 0,0 EXERCISE: Do the players of the SECRECY GAME have a weakly dominant strategy? If yes, which one? Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 27 / 44

28 Weak dominance and Nash equilibrium Theorem 7.7 Consider a strategic game Γ := (I, (A i ) i I, ( i ) i I ). If each action of action profile a := (a i ) i I is weakly dominant, then action profile a is a Nash equilibrium of Γ. Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 28 / 44

29 Weak dominance and Nash equilibrium Consider a strategic game in which each player has a weakly dominant action. Then, by Theorem 7.7, the action profile consisting of these actions constitutes a Nash equilibrium. However, it has not be the only one as be demonstrated by the SECRECY GAME. Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 29 / 44

30 Example: Secrecy Game Player B Player A don t talk talk don t talk 1,1 0,0 talk 0,0 0,0 The SECRECY GAME has two Nash equilibria, namely (don t talk, don t talk) and (talk, talk). However, for both players, talking is not a weakly dominant action. Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 30 / 44

31 Weakly dominated action Consider a strategic game Γ := (I, (A i ) i I, ( i ) i I ). An action a i A i of player i I is termed weakly dominated if there is some other action a i dominates action a i. A i \ {a i } of player i that weakly Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 31 / 44

32 Weakly dominated action Theorem 7.8 Consider a strategic game Γ := (I, (A i ) i I, ( i ) i I ). If action profile a := (a i ) i I of Γ is a strict Nash equilibrium, then every action a i of this profile is not weakly dominated. Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 32 / 44

33 Example: Secrecy Game Consider the SECRECY GAME. Player B Player A don t talk talk don t talk 1,1 0,0 talk 0,0 0,0 As we already know, the action profile (don t talk, don t talk) is a strict Nash equilibrium of the SECRECY GAME. Theorem 7.8 implies that the actions of this Nash equilibrium are not weakly dominated. Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 33 / 44

34 Dominance in vnm strategic games Now, we extend the ideas of strict and weak dominance to cases in which the players have von Neumann- Morgenstern preferences (so called vnm strategic games). In such games the players preferences are defined on the lotteries over the possible action profiles. Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 34 / 44

35 Mixed action profiles containing pure actions Consider vnm strategic game Γ := (I, (A i ) i I, ( i ) i I ) and let a i A i be a list of definite actions of players different to player i I. The mixed action profile (α i, a i ) j I (A j ) means that player i chooses the mixed action α i, every player j different to i chooses the definite a j. Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 35 / 44

36 Mixed action profiles containing pure actions The expected utility U i of player i obtained by profile (α i, a i ) is ( ) U i (α i, a i ) = a A α j (a j) u i (a i, a i) j I = a i A i α i (a i) u i (a i, a i ) where the second row follows from the fact that, for each player j I \ {i}, mixed action α j is the degenerated lottery that ascribes probability of 1 to action a j. Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 36 / 44

37 Strict dominance in vnm strategic games Definition 7.9 Consider a vnm strategic game Γ := (I, (A i ) i I, ( i ) i I ). Player s i mixed action α i (A i ) strictly dominates her definite action a i A i if U i (α i, a i ) > u i (a i, a i ) holds for every list a i A i of the other players action. Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 37 / 44

38 Strictly dominated in vnm strategic game Consider a vnm strategic game Γ := (I, (A i ) i I, ( i ) i I ). An action a i A i of player i I is termed strictly dominated in vnm strategic game Γ if there is some mixed action α i (A i ) of player i that strictly dominates action a i in Γ. Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 38 / 44

39 Exercise: VNM strategic game Γ 2 VNM strategic game Γ 2 Player B Player A left right up 4,0 1,1 middle 2,2 2,2 down 1,1 4,0 EXERCISE: Is there an action that is strictly dominated in vnm strategic game Γ 2? If yes, which one? Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 39 / 44

40 Strictly dominated in vnm strategic games Theorem 7.10 Consider the vnm strategic game Γ := (I, (A i ) i I, ( i ) i I ). If α := (α i ) i I is a mixed Nash equilibrium of Γ, then every action a i A i with α i (a i) > 0 is not strictly dominated in Γ. This theorem says that a strictly dominated action of a vnm strategic game is not used with positive probability in any mixed Nash equilibrium. Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 40 / 44

41 Exercise: VNM strategic game Γ 2 VNM strategic game Γ 2 Player B Player A left right up 4,0 1,1 middle 2,2 2,2 down 1,1 4,0 EXERCISE: Does vnm strategic game Γ 2 has a Nash equilibrium in pure actions? Determine all its Nash equilibria in mixed actions. Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 41 / 44

42 Weak dominance in vnm strategic games Definition 7.11 Consider a vnm strategic game Γ := (I, (A i ) i I, ( i ) i I ). Player i s mixed action α i (A i ) is said to weakly dominate action a i A i if the two conditions 1 U i (α i, a i ) u i (a i, a i) holds for every list a i A i of the other players actions, 2 U i (α i, a i ) > u i (a i, a i) holds for some list a i A i of the other players actions are satisfied. Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 42 / 44

43 Weakly dominated in vnm strategic games Consider a vnm strategic game Γ := (I, (A i ) i I, ( i ) i I ). An action a i A i of player i I is termed weakly dominated in vnm strategic game Γ if there is some mixed action α i (A i ) of player i that weakly dominates a i in Γ. Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 43 / 44

44 Weakly dominated in vnm strategic games Theorem 7.12 Every finite vnm strategic game Γ := (I, (A i ) i I, ( i ) i I ) has a mixed action Nash equilibrium in which no weakly dominated action is used with positive probability. Dr. Michael Trost Microeconomics I: Game Theory Lecture 7 44 / 44

Lecture 3: Nash Equilibrium

Lecture 3: Nash Equilibrium Microeconomics I: Game Theory Lecture 3: Nash Equilibrium (see Osborne, 2009, Sect 2.1-2.7) Dr. Michael Trost Department of Applied Microeconomics November 8, 2013 Dr. Michael Trost Microeconomics I: Game

More information

Advanced Microeconomics (Economics 104) Spring 2011 Strategic games I

Advanced Microeconomics (Economics 104) Spring 2011 Strategic games I Advanced Microeconomics (Economics 104) Spring 2011 Strategic games I Topics The required readings for this part is O chapter 2 and further readings are OR 2.1-2.3. The prerequisites are the Introduction

More information

Normal Form Games: A Brief Introduction

Normal Form Games: A Brief Introduction Normal Form Games: A Brief Introduction Arup Daripa TOF1: Market Microstructure Birkbeck College Autumn 2005 1. Games in strategic form. 2. Dominance and iterated dominance. 3. Weak dominance. 4. Nash

More information

Minmax and Dominance

Minmax and Dominance Minmax and Dominance CPSC 532A Lecture 6 September 28, 2006 Minmax and Dominance CPSC 532A Lecture 6, Slide 1 Lecture Overview Recap Maxmin and Minmax Linear Programming Computing Fun Game Domination Minmax

More information

ECON 282 Final Practice Problems

ECON 282 Final Practice Problems ECON 282 Final Practice Problems S. Lu Multiple Choice Questions Note: The presence of these practice questions does not imply that there will be any multiple choice questions on the final exam. 1. How

More information

EC3224 Autumn Lecture #02 Nash Equilibrium

EC3224 Autumn Lecture #02 Nash Equilibrium Reading EC3224 Autumn Lecture #02 Nash Equilibrium Osborne Chapters 2.6-2.10, (12) By the end of this week you should be able to: define Nash equilibrium and explain several different motivations for it.

More information

Game Theory Refresher. Muriel Niederle. February 3, A set of players (here for simplicity only 2 players, all generalized to N players).

Game Theory Refresher. Muriel Niederle. February 3, A set of players (here for simplicity only 2 players, all generalized to N players). Game Theory Refresher Muriel Niederle February 3, 2009 1. Definition of a Game We start by rst de ning what a game is. A game consists of: A set of players (here for simplicity only 2 players, all generalized

More information

SF2972 GAME THEORY Normal-form analysis II

SF2972 GAME THEORY Normal-form analysis II SF2972 GAME THEORY Normal-form analysis II Jörgen Weibull January 2017 1 Nash equilibrium Domain of analysis: finite NF games = h i with mixed-strategy extension = h ( ) i Definition 1.1 Astrategyprofile

More information

Note: A player has, at most, one strictly dominant strategy. When a player has a dominant strategy, that strategy is a compelling choice.

Note: A player has, at most, one strictly dominant strategy. When a player has a dominant strategy, that strategy is a compelling choice. Game Theoretic Solutions Def: A strategy s i 2 S i is strictly dominated for player i if there exists another strategy, s 0 i 2 S i such that, for all s i 2 S i,wehave ¼ i (s 0 i ;s i) >¼ i (s i ;s i ):

More information

Econ 302: Microeconomics II - Strategic Behavior. Problem Set #5 June13, 2016

Econ 302: Microeconomics II - Strategic Behavior. Problem Set #5 June13, 2016 Econ 302: Microeconomics II - Strategic Behavior Problem Set #5 June13, 2016 1. T/F/U? Explain and give an example of a game to illustrate your answer. A Nash equilibrium requires that all players are

More information

Summary Overview of Topics in Econ 30200b: Decision theory: strong and weak domination by randomized strategies, domination theorem, expected utility

Summary Overview of Topics in Econ 30200b: Decision theory: strong and weak domination by randomized strategies, domination theorem, expected utility Summary Overview of Topics in Econ 30200b: Decision theory: strong and weak domination by randomized strategies, domination theorem, expected utility theorem (consistent decisions under uncertainty should

More information

Exercises for Introduction to Game Theory SOLUTIONS

Exercises for Introduction to Game Theory SOLUTIONS Exercises for Introduction to Game Theory SOLUTIONS Heinrich H. Nax & Bary S. R. Pradelski March 19, 2018 Due: March 26, 2018 1 Cooperative game theory Exercise 1.1 Marginal contributions 1. If the value

More information

Section Notes 6. Game Theory. Applied Math 121. Week of March 22, understand the difference between pure and mixed strategies.

Section Notes 6. Game Theory. Applied Math 121. Week of March 22, understand the difference between pure and mixed strategies. Section Notes 6 Game Theory Applied Math 121 Week of March 22, 2010 Goals for the week be comfortable with the elements of game theory. understand the difference between pure and mixed strategies. be able

More information

Lecture 5: Subgame Perfect Equilibrium. November 1, 2006

Lecture 5: Subgame Perfect Equilibrium. November 1, 2006 Lecture 5: Subgame Perfect Equilibrium November 1, 2006 Osborne: ch 7 How do we analyze extensive form games where there are simultaneous moves? Example: Stage 1. Player 1 chooses between fin,outg If OUT,

More information

ECO 463. SimultaneousGames

ECO 463. SimultaneousGames ECO 463 SimultaneousGames Provide brief explanations as well as your answers. 1. Two people could benefit by cooperating on a joint project. Each person can either cooperate at a cost of 2 dollars or fink

More information

Evolutionary Game Theory and Linguistics

Evolutionary Game Theory and Linguistics Gerhard.Jaeger@uni-bielefeld.de February 21, 2007 University of Tübingen Conceptualization of language evolution prerequisites for evolutionary dynamics replication variation selection Linguemes any piece

More information

Resource Allocation and Decision Analysis (ECON 8010) Spring 2014 Foundations of Game Theory

Resource Allocation and Decision Analysis (ECON 8010) Spring 2014 Foundations of Game Theory Resource Allocation and Decision Analysis (ECON 8) Spring 4 Foundations of Game Theory Reading: Game Theory (ECON 8 Coursepak, Page 95) Definitions and Concepts: Game Theory study of decision making settings

More information

Game Theory. Wolfgang Frimmel. Dominance

Game Theory. Wolfgang Frimmel. Dominance Game Theory Wolfgang Frimmel Dominance 1 / 13 Example: Prisoners dilemma Consider the following game in normal-form: There are two players who both have the options cooperate (C) and defect (D) Both players

More information

Introduction to Game Theory

Introduction to Game Theory Introduction to Game Theory Managing with Game Theory Hongying FEI Feihy@i.shu.edu.cn Poker Game ( 2 players) Each player is dealt randomly 3 cards Both of them order their cards as they want Cards at

More information

UPenn NETS 412: Algorithmic Game Theory Game Theory Practice. Clyde Silent Confess Silent 1, 1 10, 0 Confess 0, 10 5, 5

UPenn NETS 412: Algorithmic Game Theory Game Theory Practice. Clyde Silent Confess Silent 1, 1 10, 0 Confess 0, 10 5, 5 Problem 1 UPenn NETS 412: Algorithmic Game Theory Game Theory Practice Bonnie Clyde Silent Confess Silent 1, 1 10, 0 Confess 0, 10 5, 5 This game is called Prisoner s Dilemma. Bonnie and Clyde have been

More information

Economics 201A - Section 5

Economics 201A - Section 5 UC Berkeley Fall 2007 Economics 201A - Section 5 Marina Halac 1 What we learnt this week Basics: subgame, continuation strategy Classes of games: finitely repeated games Solution concepts: subgame perfect

More information

Microeconomics of Banking: Lecture 4

Microeconomics of Banking: Lecture 4 Microeconomics of Banking: Lecture 4 Prof. Ronaldo CARPIO Oct. 16, 2015 Administrative Stuff Homework 1 is due today at the end of class. I will upload the solutions and Homework 2 (due in two weeks) later

More information

ECON 2100 Principles of Microeconomics (Summer 2016) Game Theory and Oligopoly

ECON 2100 Principles of Microeconomics (Summer 2016) Game Theory and Oligopoly ECON 2100 Principles of Microeconomics (Summer 2016) Game Theory and Oligopoly Relevant readings from the textbook: Mankiw, Ch. 17 Oligopoly Suggested problems from the textbook: Chapter 17 Questions for

More information

Distributed Optimization and Games

Distributed Optimization and Games Distributed Optimization and Games Introduction to Game Theory Giovanni Neglia INRIA EPI Maestro 18 January 2017 What is Game Theory About? Mathematical/Logical analysis of situations of conflict and cooperation

More information

Domination Rationalizability Correlated Equilibrium Computing CE Computational problems in domination. Game Theory Week 3. Kevin Leyton-Brown

Domination Rationalizability Correlated Equilibrium Computing CE Computational problems in domination. Game Theory Week 3. Kevin Leyton-Brown Game Theory Week 3 Kevin Leyton-Brown Game Theory Week 3 Kevin Leyton-Brown, Slide 1 Lecture Overview 1 Domination 2 Rationalizability 3 Correlated Equilibrium 4 Computing CE 5 Computational problems in

More information

CSC304 Lecture 2. Game Theory (Basic Concepts) CSC304 - Nisarg Shah 1

CSC304 Lecture 2. Game Theory (Basic Concepts) CSC304 - Nisarg Shah 1 CSC304 Lecture 2 Game Theory (Basic Concepts) CSC304 - Nisarg Shah 1 Game Theory How do rational, self-interested agents act? Each agent has a set of possible actions Rules of the game: Rewards for the

More information

Multiagent Systems: Intro to Game Theory. CS 486/686: Introduction to Artificial Intelligence

Multiagent Systems: Intro to Game Theory. CS 486/686: Introduction to Artificial Intelligence Multiagent Systems: Intro to Game Theory CS 486/686: Introduction to Artificial Intelligence 1 Introduction So far almost everything we have looked at has been in a single-agent setting Today - Multiagent

More information

ECO 220 Game Theory. Objectives. Agenda. Simultaneous Move Games. Be able to structure a game in normal form Be able to identify a Nash equilibrium

ECO 220 Game Theory. Objectives. Agenda. Simultaneous Move Games. Be able to structure a game in normal form Be able to identify a Nash equilibrium ECO 220 Game Theory Simultaneous Move Games Objectives Be able to structure a game in normal form Be able to identify a Nash equilibrium Agenda Definitions Equilibrium Concepts Dominance Coordination Games

More information

CMU Lecture 22: Game Theory I. Teachers: Gianni A. Di Caro

CMU Lecture 22: Game Theory I. Teachers: Gianni A. Di Caro CMU 15-781 Lecture 22: Game Theory I Teachers: Gianni A. Di Caro GAME THEORY Game theory is the formal study of conflict and cooperation in (rational) multi-agent systems Decision-making where several

More information

Multiagent Systems: Intro to Game Theory. CS 486/686: Introduction to Artificial Intelligence

Multiagent Systems: Intro to Game Theory. CS 486/686: Introduction to Artificial Intelligence Multiagent Systems: Intro to Game Theory CS 486/686: Introduction to Artificial Intelligence 1 1 Introduction So far almost everything we have looked at has been in a single-agent setting Today - Multiagent

More information

Game Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India August 2012

Game Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India August 2012 Game Theory Lecture Notes By Y. Narahari Department of Computer Science and Automation Indian Institute of Science Bangalore, India August 01 Rationalizable Strategies Note: This is a only a draft version,

More information

final examination on May 31 Topics from the latter part of the course (covered in homework assignments 4-7) include:

final examination on May 31 Topics from the latter part of the course (covered in homework assignments 4-7) include: The final examination on May 31 may test topics from any part of the course, but the emphasis will be on topic after the first three homework assignments, which were covered in the midterm. Topics from

More information

1. Introduction to Game Theory

1. Introduction to Game Theory 1. Introduction to Game Theory What is game theory? Important branch of applied mathematics / economics Eight game theorists have won the Nobel prize, most notably John Nash (subject of Beautiful mind

More information

Refinements of Sequential Equilibrium

Refinements of Sequential Equilibrium Refinements of Sequential Equilibrium Debraj Ray, November 2006 Sometimes sequential equilibria appear to be supported by implausible beliefs off the equilibrium path. These notes briefly discuss this

More information

Mixed Strategies; Maxmin

Mixed Strategies; Maxmin Mixed Strategies; Maxmin CPSC 532A Lecture 4 January 28, 2008 Mixed Strategies; Maxmin CPSC 532A Lecture 4, Slide 1 Lecture Overview 1 Recap 2 Mixed Strategies 3 Fun Game 4 Maxmin and Minmax Mixed Strategies;

More information

Topic 1: defining games and strategies. SF2972: Game theory. Not allowed: Extensive form game: formal definition

Topic 1: defining games and strategies. SF2972: Game theory. Not allowed: Extensive form game: formal definition SF2972: Game theory Mark Voorneveld, mark.voorneveld@hhs.se Topic 1: defining games and strategies Drawing a game tree is usually the most informative way to represent an extensive form game. Here is one

More information

Dominance and Best Response. player 2

Dominance and Best Response. player 2 Dominance and Best Response Consider the following game, Figure 6.1(a) from the text. player 2 L R player 1 U 2, 3 5, 0 D 1, 0 4, 3 Suppose you are player 1. The strategy U yields higher payoff than any

More information

CS510 \ Lecture Ariel Stolerman

CS510 \ Lecture Ariel Stolerman CS510 \ Lecture04 2012-10-15 1 Ariel Stolerman Administration Assignment 2: just a programming assignment. Midterm: posted by next week (5), will cover: o Lectures o Readings A midterm review sheet will

More information

Introduction to Game Theory I

Introduction to Game Theory I Nicola Dimitri University of Siena (Italy) Rome March-April 2014 Introduction to Game Theory 1/3 Game Theory (GT) is a tool-box useful to understand how rational people choose in situations of Strategic

More information

Math 464: Linear Optimization and Game

Math 464: Linear Optimization and Game Math 464: Linear Optimization and Game Haijun Li Department of Mathematics Washington State University Spring 2013 Game Theory Game theory (GT) is a theory of rational behavior of people with nonidentical

More information

Introduction: What is Game Theory?

Introduction: What is Game Theory? Microeconomics I: Game Theory Introduction: What is Game Theory? (see Osborne, 2009, Sect 1.1) Dr. Michael Trost Department of Applied Microeconomics October 25, 2013 Dr. Michael Trost Microeconomics I:

More information

Contents. MA 327/ECO 327 Introduction to Game Theory Fall 2017 Notes. 1 Wednesday, August Friday, August Monday, August 28 6

Contents. MA 327/ECO 327 Introduction to Game Theory Fall 2017 Notes. 1 Wednesday, August Friday, August Monday, August 28 6 MA 327/ECO 327 Introduction to Game Theory Fall 2017 Notes Contents 1 Wednesday, August 23 4 2 Friday, August 25 5 3 Monday, August 28 6 4 Wednesday, August 30 8 5 Friday, September 1 9 6 Wednesday, September

More information

LECTURE 26: GAME THEORY 1

LECTURE 26: GAME THEORY 1 15-382 COLLECTIVE INTELLIGENCE S18 LECTURE 26: GAME THEORY 1 INSTRUCTOR: GIANNI A. DI CARO ICE-CREAM WARS http://youtu.be/jilgxenbk_8 2 GAME THEORY Game theory is the formal study of conflict and cooperation

More information

Weeks 3-4: Intro to Game Theory

Weeks 3-4: Intro to Game Theory Prof. Bryan Caplan bcaplan@gmu.edu http://www.bcaplan.com Econ 82 Weeks 3-4: Intro to Game Theory I. The Hard Case: When Strategy Matters A. You can go surprisingly far with general equilibrium theory,

More information

FIRST PART: (Nash) Equilibria

FIRST PART: (Nash) Equilibria FIRST PART: (Nash) Equilibria (Some) Types of games Cooperative/Non-cooperative Symmetric/Asymmetric (for 2-player games) Zero sum/non-zero sum Simultaneous/Sequential Perfect information/imperfect information

More information

8.F The Possibility of Mistakes: Trembling Hand Perfection

8.F The Possibility of Mistakes: Trembling Hand Perfection February 4, 2015 8.F The Possibility of Mistakes: Trembling Hand Perfection back to games of complete information, for the moment refinement: a set of principles that allow one to select among equilibria.

More information

Simultaneous Move Games

Simultaneous Move Games Simultaneous Move Games These notes essentially correspond to parts of chapters 7 and 8 of Mas-Colell, Whinston, and Green. Most of this material should be a review from BPHD 8100. 1 Introduction Up to

More information

Algorithmic Game Theory and Applications. Kousha Etessami

Algorithmic Game Theory and Applications. Kousha Etessami Algorithmic Game Theory and Applications Lecture 17: A first look at Auctions and Mechanism Design: Auctions as Games, Bayesian Games, Vickrey auctions Kousha Etessami Food for thought: sponsored search

More information

Multiagent Systems: Intro to Game Theory. CS 486/686: Introduction to Artificial Intelligence

Multiagent Systems: Intro to Game Theory. CS 486/686: Introduction to Artificial Intelligence Multiagent Systems: Intro to Game Theory CS 486/686: Introduction to Artificial Intelligence 1 Introduction So far almost everything we have looked at has been in a single-agent setting Today - Multiagent

More information

Lecture 10: Auction Mechanisms

Lecture 10: Auction Mechanisms Microeconomics I: Game Theory Lecture 10: Auction Mechanisms (see Osborne, 2009, Sect 3.5) Dr. Michael Trost Department of Applied Microeconomics January 17, 2014 Dr. Michael Trost Microeconomics I: Game

More information

Distributed Optimization and Games

Distributed Optimization and Games Distributed Optimization and Games Introduction to Game Theory Giovanni Neglia INRIA EPI Maestro 18 January 2017 What is Game Theory About? Mathematical/Logical analysis of situations of conflict and cooperation

More information

Game Theory Lecturer: Ji Liu Thanks for Jerry Zhu's slides

Game Theory Lecturer: Ji Liu Thanks for Jerry Zhu's slides Game Theory ecturer: Ji iu Thanks for Jerry Zhu's slides [based on slides from Andrew Moore http://www.cs.cmu.edu/~awm/tutorials] slide 1 Overview Matrix normal form Chance games Games with hidden information

More information

1 Simultaneous move games of complete information 1

1 Simultaneous move games of complete information 1 1 Simultaneous move games of complete information 1 One of the most basic types of games is a game between 2 or more players when all players choose strategies simultaneously. While the word simultaneously

More information

Introduction to Game Theory

Introduction to Game Theory Introduction to Game Theory Part 1. Static games of complete information Chapter 1. Normal form games and Nash equilibrium Ciclo Profissional 2 o Semestre / 2011 Graduação em Ciências Econômicas V. Filipe

More information

Topics in Applied Mathematics

Topics in Applied Mathematics Topics in Applied Mathematics Introduction to Game Theory Seung Yeal Ha Department of Mathematical Sciences Seoul National University 1 Purpose of this course Learn the basics of game theory and be ready

More information

CMU-Q Lecture 20:

CMU-Q Lecture 20: CMU-Q 15-381 Lecture 20: Game Theory I Teacher: Gianni A. Di Caro ICE-CREAM WARS http://youtu.be/jilgxenbk_8 2 GAME THEORY Game theory is the formal study of conflict and cooperation in (rational) multi-agent

More information

Game Theory: introduction and applications to computer networks

Game Theory: introduction and applications to computer networks Game Theory: introduction and applications to computer networks Lecture 1: introduction Giovanni Neglia INRIA EPI Maestro 30 January 2012 Part of the slides are based on a previous course with D. Figueiredo

More information

Game Theory and Economics Prof. Dr. Debarshi Das Humanities and Social Sciences Indian Institute of Technology, Guwahati

Game Theory and Economics Prof. Dr. Debarshi Das Humanities and Social Sciences Indian Institute of Technology, Guwahati Game Theory and Economics Prof. Dr. Debarshi Das Humanities and Social Sciences Indian Institute of Technology, Guwahati Module No. # 05 Extensive Games and Nash Equilibrium Lecture No. # 03 Nash Equilibrium

More information

Game Theory and MANETs: A Brief Tutorial

Game Theory and MANETs: A Brief Tutorial Game Theory and MANETs: A Brief Tutorial Luiz A. DaSilva and Allen B. MacKenzie Slides available at http://www.ece.vt.edu/mackenab/presentations/ GameTheoryTutorial.pdf 1 Agenda Fundamentals of Game Theory

More information

U strictly dominates D for player A, and L strictly dominates R for player B. This leaves (U, L) as a Strict Dominant Strategy Equilibrium.

U strictly dominates D for player A, and L strictly dominates R for player B. This leaves (U, L) as a Strict Dominant Strategy Equilibrium. Problem Set 3 (Game Theory) Do five of nine. 1. Games in Strategic Form Underline all best responses, then perform iterated deletion of strictly dominated strategies. In each case, do you get a unique

More information

Strategies and Game Theory

Strategies and Game Theory Strategies and Game Theory Prof. Hongbin Cai Department of Applied Economics Guanghua School of Management Peking University March 31, 2009 Lecture 7: Repeated Game 1 Introduction 2 Finite Repeated Game

More information

Lecture 6: Basics of Game Theory

Lecture 6: Basics of Game Theory 0368.4170: Cryptography and Game Theory Ran Canetti and Alon Rosen Lecture 6: Basics of Game Theory 25 November 2009 Fall 2009 Scribes: D. Teshler Lecture Overview 1. What is a Game? 2. Solution Concepts:

More information

Introduction to Game Theory

Introduction to Game Theory Introduction to Game Theory Lecture 2 Lorenzo Rocco Galilean School - Università di Padova March 2017 Rocco (Padova) Game Theory March 2017 1 / 46 Games in Extensive Form The most accurate description

More information

NORMAL FORM GAMES: invariance and refinements DYNAMIC GAMES: extensive form

NORMAL FORM GAMES: invariance and refinements DYNAMIC GAMES: extensive form 1 / 47 NORMAL FORM GAMES: invariance and refinements DYNAMIC GAMES: extensive form Heinrich H. Nax hnax@ethz.ch & Bary S. R. Pradelski bpradelski@ethz.ch March 19, 2018: Lecture 5 2 / 47 Plan Normal form

More information

Repeated Games. Economics Microeconomic Theory II: Strategic Behavior. Shih En Lu. Simon Fraser University (with thanks to Anke Kessler)

Repeated Games. Economics Microeconomic Theory II: Strategic Behavior. Shih En Lu. Simon Fraser University (with thanks to Anke Kessler) Repeated Games Economics 302 - Microeconomic Theory II: Strategic Behavior Shih En Lu Simon Fraser University (with thanks to Anke Kessler) ECON 302 (SFU) Repeated Games 1 / 25 Topics 1 Information Sets

More information

Computing Nash Equilibrium; Maxmin

Computing Nash Equilibrium; Maxmin Computing Nash Equilibrium; Maxmin Lecture 5 Computing Nash Equilibrium; Maxmin Lecture 5, Slide 1 Lecture Overview 1 Recap 2 Computing Mixed Nash Equilibria 3 Fun Game 4 Maxmin and Minmax Computing Nash

More information

Chapter 30: Game Theory

Chapter 30: Game Theory Chapter 30: Game Theory 30.1: Introduction We have now covered the two extremes perfect competition and monopoly/monopsony. In the first of these all agents are so small (or think that they are so small)

More information

Asynchronous Best-Reply Dynamics

Asynchronous Best-Reply Dynamics Asynchronous Best-Reply Dynamics Noam Nisan 1, Michael Schapira 2, and Aviv Zohar 2 1 Google Tel-Aviv and The School of Computer Science and Engineering, The Hebrew University of Jerusalem, Israel. 2 The

More information

Reading Robert Gibbons, A Primer in Game Theory, Harvester Wheatsheaf 1992.

Reading Robert Gibbons, A Primer in Game Theory, Harvester Wheatsheaf 1992. Reading Robert Gibbons, A Primer in Game Theory, Harvester Wheatsheaf 1992. Additional readings could be assigned from time to time. They are an integral part of the class and you are expected to read

More information

RECITATION 8 INTRODUCTION

RECITATION 8 INTRODUCTION ThEORy RECITATION 8 1 WHAT'S GAME THEORY? Traditional economics my decision afects my welfare but not other people's welfare e.g.: I'm in a supermarket - whether I decide or not to buy a tomato does not

More information

Finite games: finite number of players, finite number of possible actions, finite number of moves. Canusegametreetodepicttheextensiveform.

Finite games: finite number of players, finite number of possible actions, finite number of moves. Canusegametreetodepicttheextensiveform. A game is a formal representation of a situation in which individuals interact in a setting of strategic interdependence. Strategic interdependence each individual s utility depends not only on his own

More information

Homework 5 Answers PS 30 November 2013

Homework 5 Answers PS 30 November 2013 Homework 5 Answers PS 30 November 2013 Problems which you should be able to do easily 1. Consider the Battle of the Sexes game below. 1a 2, 1 0, 0 1b 0, 0 1, 2 a. Find all Nash equilibria (pure strategy

More information

Game Theory: The Basics. Theory of Games and Economics Behavior John Von Neumann and Oskar Morgenstern (1943)

Game Theory: The Basics. Theory of Games and Economics Behavior John Von Neumann and Oskar Morgenstern (1943) Game Theory: The Basics The following is based on Games of Strategy, Dixit and Skeath, 1999. Topic 8 Game Theory Page 1 Theory of Games and Economics Behavior John Von Neumann and Oskar Morgenstern (1943)

More information

Elements of Game Theory

Elements of Game Theory Elements of Game Theory S. Pinchinat Master2 RI 20-202 S. Pinchinat (IRISA) Elements of Game Theory Master2 RI 20-202 / 64 Introduction Economy Biology Synthesis and Control of reactive Systems Checking

More information

DECISION MAKING GAME THEORY

DECISION MAKING GAME THEORY DECISION MAKING GAME THEORY THE PROBLEM Two suspected felons are caught by the police and interrogated in separate rooms. Three cases were presented to them. THE PROBLEM CASE A: If only one of you confesses,

More information

The extensive form representation of a game

The extensive form representation of a game The extensive form representation of a game Nodes, information sets Perfect and imperfect information Addition of random moves of nature (to model uncertainty not related with decisions of other players).

More information

Non-Cooperative Game Theory

Non-Cooperative Game Theory Notes on Microeconomic Theory IV 3º - LE-: 008-009 Iñaki Aguirre epartamento de Fundamentos del Análisis Económico I Universidad del País Vasco An introduction to. Introduction.. asic notions.. Extensive

More information

4/21/2016. Intermediate Microeconomics W3211. Lecture 20: Game Theory 2. The Story So Far. Today. But First.. Introduction

4/21/2016. Intermediate Microeconomics W3211. Lecture 20: Game Theory 2. The Story So Far. Today. But First.. Introduction 1 Intermediate Microeconomics W3211 ecture 20: Game Theory 2 Introduction Columbia University, Spring 2016 Mark Dean: mark.dean@columbia.edu 2 The Story So Far. 3 Today 4 ast lecture we began to study

More information

Advanced Microeconomics: Game Theory

Advanced Microeconomics: Game Theory Advanced Microeconomics: Game Theory P. v. Mouche Wageningen University 2018 Outline 1 Motivation 2 Games in strategic form 3 Games in extensive form What is game theory? Traditional game theory deals

More information

EconS Game Theory - Part 1

EconS Game Theory - Part 1 EconS 305 - Game Theory - Part 1 Eric Dunaway Washington State University eric.dunaway@wsu.edu November 8, 2015 Eric Dunaway (WSU) EconS 305 - Lecture 28 November 8, 2015 1 / 60 Introduction Today, we

More information

CHAPTER LEARNING OUTCOMES. By the end of this section, students will be able to:

CHAPTER LEARNING OUTCOMES. By the end of this section, students will be able to: CHAPTER 4 4.1 LEARNING OUTCOMES By the end of this section, students will be able to: Understand what is meant by a Bayesian Nash Equilibrium (BNE) Calculate the BNE in a Cournot game with incomplete information

More information

1\2 L m R M 2, 2 1, 1 0, 0 B 1, 0 0, 0 1, 1

1\2 L m R M 2, 2 1, 1 0, 0 B 1, 0 0, 0 1, 1 Chapter 1 Introduction Game Theory is a misnomer for Multiperson Decision Theory. It develops tools, methods, and language that allow a coherent analysis of the decision-making processes when there are

More information

Game Theory. Department of Electronics EL-766 Spring Hasan Mahmood

Game Theory. Department of Electronics EL-766 Spring Hasan Mahmood Game Theory Department of Electronics EL-766 Spring 2011 Hasan Mahmood Email: hasannj@yahoo.com Course Information Part I: Introduction to Game Theory Introduction to game theory, games with perfect information,

More information

The Game Theory of Game Theory Ruben R. Puentedura, Ph.D.

The Game Theory of Game Theory Ruben R. Puentedura, Ph.D. The Game Theory of Game Theory Ruben R. Puentedura, Ph.D. Why Study Game Theory For Game Creation? Three key applications: For general game design; For social sciences-specific game design; For understanding

More information

Dominant and Dominated Strategies

Dominant and Dominated Strategies Dominant and Dominated Strategies Carlos Hurtado Department of Economics University of Illinois at Urbana-Champaign hrtdmrt2@illinois.edu May 29th, 2015 C. Hurtado (UIUC - Economics) Game Theory On the

More information

Dynamic Games: Backward Induction and Subgame Perfection

Dynamic Games: Backward Induction and Subgame Perfection Dynamic Games: Backward Induction and Subgame Perfection Carlos Hurtado Department of Economics University of Illinois at Urbana-Champaign hrtdmrt2@illinois.edu Jun 22th, 2017 C. Hurtado (UIUC - Economics)

More information

Games in Extensive Form

Games in Extensive Form Games in Extensive Form the extensive form of a game is a tree diagram except that my trees grow sideways any game can be represented either using the extensive form or the strategic form but the extensive

More information

/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Algorithmic Game Theory Date: 12/6/18

/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Algorithmic Game Theory Date: 12/6/18 601.433/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Algorithmic Game Theory Date: 12/6/18 24.1 Introduction Today we re going to spend some time discussing game theory and algorithms.

More information

Rationality and Common Knowledge

Rationality and Common Knowledge 4 Rationality and Common Knowledge In this chapter we study the implications of imposing the assumptions of rationality as well as common knowledge of rationality We derive and explore some solution concepts

More information

Game theory lecture 5. October 5, 2013

Game theory lecture 5. October 5, 2013 October 5, 2013 In normal form games one can think that the players choose their strategies simultaneously. In extensive form games the sequential structure of the game plays a central role. In this section

More information

CPS 570: Artificial Intelligence Game Theory

CPS 570: Artificial Intelligence Game Theory CPS 570: Artificial Intelligence Game Theory Instructor: Vincent Conitzer What is game theory? Game theory studies settings where multiple parties (agents) each have different preferences (utility functions),

More information

THEORY: NASH EQUILIBRIUM

THEORY: NASH EQUILIBRIUM THEORY: NASH EQUILIBRIUM 1 The Story Prisoner s Dilemma Two prisoners held in separate rooms. Authorities offer a reduced sentence to each prisoner if he rats out his friend. If a prisoner is ratted out

More information

14.12 Game Theory Lecture Notes Lectures 10-11

14.12 Game Theory Lecture Notes Lectures 10-11 4.2 Game Theory Lecture Notes Lectures 0- Muhamet Yildiz Repeated Games In these notes, we ll discuss the repeated games, the games where a particular smaller game is repeated; the small game is called

More information

Appendix A A Primer in Game Theory

Appendix A A Primer in Game Theory Appendix A A Primer in Game Theory This presentation of the main ideas and concepts of game theory required to understand the discussion in this book is intended for readers without previous exposure to

More information

Student Name. Student ID

Student Name. Student ID Final Exam CMPT 882: Computational Game Theory Simon Fraser University Spring 2010 Instructor: Oliver Schulte Student Name Student ID Instructions. This exam is worth 30% of your final mark in this course.

More information

Microeconomics II Lecture 2: Backward induction and subgame perfection Karl Wärneryd Stockholm School of Economics November 2016

Microeconomics II Lecture 2: Backward induction and subgame perfection Karl Wärneryd Stockholm School of Economics November 2016 Microeconomics II Lecture 2: Backward induction and subgame perfection Karl Wärneryd Stockholm School of Economics November 2016 1 Games in extensive form So far, we have only considered games where players

More information

Game Theory and Algorithms Lecture 3: Weak Dominance and Truthfulness

Game Theory and Algorithms Lecture 3: Weak Dominance and Truthfulness Game Theory and Algorithms Lecture 3: Weak Dominance and Truthfulness March 1, 2011 Summary: We introduce the notion of a (weakly) dominant strategy: one which is always a best response, no matter what

More information

Adversarial Search and Game Theory. CS 510 Lecture 5 October 26, 2017

Adversarial Search and Game Theory. CS 510 Lecture 5 October 26, 2017 Adversarial Search and Game Theory CS 510 Lecture 5 October 26, 2017 Reminders Proposals due today Midterm next week past midterms online Midterm online BBLearn Available Thurs-Sun, ~2 hours Overview Game

More information

Introduction to IO. Introduction to IO

Introduction to IO. Introduction to IO Basic Concepts in Noncooperative Game Theory Actions (welfare or pro ts) Help us to analyze industries with few rms What are the rms actions? Two types of games: 1 Normal Form Game 2 Extensive Form game

More information

Game Theory ( nd term) Dr. S. Farshad Fatemi. Graduate School of Management and Economics Sharif University of Technology.

Game Theory ( nd term) Dr. S. Farshad Fatemi. Graduate School of Management and Economics Sharif University of Technology. Game Theory 44812 (1393-94 2 nd term) Dr. S. Farshad Fatemi Graduate School of Management and Economics Sharif University of Technology Spring 2015 Dr. S. Farshad Fatemi (GSME) Game Theory Spring 2015

More information