Lecture 3: Nash Equilibrium
|
|
- Emery Edwards
- 5 years ago
- Views:
Transcription
1 Microeconomics I: Game Theory Lecture 3: Nash Equilibrium (see Osborne, 2009, Sect ) Dr. Michael Trost Department of Applied Microeconomics November 8, 2013 Dr. Michael Trost Microeconomics I: Game Theory Lecture 3 1 / 38
2 Strategic games and Nash equilibrium Our study of games starts with the study of the simplest class of games. The so called class of strategic games. After introducing the class of strategic games we present the most prominent solution concept that is applied on such games. This solution concept has been devised by John F. Nash and is named after its inventor, the Nash equilibrium concept. Dr. Michael Trost Microeconomics I: Game Theory Lecture 3 2 / 38
3 Strategic game A strategic game is a games in which each player chooses her action once and for all, the players choose their actions simultaneously in the sense that no player is informed of the actions chosen by the other players, when she chooses her action. Strategic games are also referred to as simultaneous-move games. Dr. Michael Trost Microeconomics I: Game Theory Lecture 3 3 / 38
4 Strategic game Definition 3.1 (Strategic game) A strategic game Γ := (I, (A i ) i I, ( i ) i I ) consists of a finite set of players I, for each player i I, a set of actions A i for each player i I, a preference relation i on the set of action profiles A := i I A i which is representable by some utility function U i Dr. Michael Trost Microeconomics I: Game Theory Lecture 3 4 / 38
5 Action and action profile Consider a strategic game Γ := (I, (A i ) i I, ( i ) i I ). An action a i of player i is an element of player i s action set A i. An action profile a:=(a i)i I is a list specifying the actions of every player. It is an element of the Cartesian product A := i I A i of the players action sets. Dr. Michael Trost Microeconomics I: Game Theory Lecture 3 5 / 38
6 Preferences on action profiles NOTE: The preferences of the decision makers in a strategic game are defined on the set of all action profiles. This captures the interaction between the decision makers. Each player is affected by the actions of all players, not only by her own action. Dr. Michael Trost Microeconomics I: Game Theory Lecture 3 6 / 38
7 Other players action Consider a strategic game Γ := (I, (A i ) i I, ( i ) i I ). Let a A be an action profile and a i A i an action of player i. List a i := (a j)j I\{i} denotes the actions of all players except i. Cartesian product A i := lists of action. j I\{i}A j is the set of all such Action profile (a i, a i) denotes the action profile in which player i chooses action a i and each player j different to i chooses action a j. Dr. Michael Trost Microeconomics I: Game Theory Lecture 3 7 / 38
8 Subclasses of strategic games A strategic game Γ := (I, (A i ) i I, ( i ) i I ) is called finite if the action set A i is finite for every player i I. a two-player strategic game if only two players participate in the game (i.e., #I = 2). Dr. Michael Trost Microeconomics I: Game Theory Lecture 3 8 / 38
9 Symmetric two-player strategic games A two-player strategic game Γ := ( ) {k, l}, (A i ) i {k,l}, ( i ) i {k,l} is called symmetric if the actions sets and the preferences of the players are identical, i.e., A k = A l holds and (a k, a l ) k (b k, b l ) if and only if (a k, a l ) l (b k, b l ) is satisfied for every action profiles (a k, a l ), (b k, b l ) A k A l. Dr. Michael Trost Microeconomics I: Game Theory Lecture 3 9 / 38
10 Competitive two-player strategic games A two-player strategic game Γ := ( ) {k, l}, (A i ) i {k,l}, ( i ) i {k,l} is called competitive (or alternatively, zero-sum game) if the preferences of the players are opposite, i.e., (a k, a l ) k (b k, b l ) if and only if (b k, b l ) l (a k, a l ) is satisfied for every action profiles (a k, a l ), (b k, b l ) A k A l. Dr. Michael Trost Microeconomics I: Game Theory Lecture 3 10 / 38
11 Example: Prisoner s Dilemma The two suspects A and B in a major crime are questioned separately. There is enough evidence to convict each of them of a minor offense, but not enough evidence to convict either of them of the major crime unless one of them acts as informer against the other ( finks ). If both stay quiet, each must spend 1 year in prison. If one and only one finks, then the one who finks is freed and the other one spends 4 years in prison. If both fink, each of them will spend 3 years in prison. Dr. Michael Trost Microeconomics I: Game Theory Lecture 3 11 / 38
12 The strategic game of Prisoner s Dilemma EXERCISE: Describe the strategic game Γ PD := (I, (A i ) i I, ( i ) i I ) behind the PRISONER S DILEMMA story! The players are The players action sets are The players preferences are Dr. Michael Trost Microeconomics I: Game Theory Lecture 3 12 / 38
13 Bimatrix of Prisoner s Dilemma EXERCISE: Describe the PRISONER S DILEMMA by a bimatrix! Dr. Michael Trost Microeconomics I: Game Theory Lecture 3 13 / 38
14 Example: Guessing Game Each person of group I of participants must announce a real number from 0 to 100. The person whose guessed number is the closest to the two-third of the average of all guessed numbers is the winner and receives a monetary prize of e 10. If two or more persons announce numbers which turn out to be the closest to the two-third of the average of all guessed numbers, then the monetary prize is split equally between these persons. Dr. Michael Trost Microeconomics I: Game Theory Lecture 3 14 / 38
15 The strategic game of the Guessing Game EXERCISE: Describe the strategic game Γ GG := (I, (A i ) i I, ( i ) i I ) behind the GUESSING GAME story! The players are The players action sets are The players preferences are Dr. Michael Trost Microeconomics I: Game Theory Lecture 3 15 / 38
16 The two issues of game theory Having specified the rules of the game, game theory aims at tackling the positive issue: Which of the available actions the players will choose? or the normative issue: Which of the available actions the players should choose? Dr. Michael Trost Microeconomics I: Game Theory Lecture 3 16 / 38
17 Solution concept A theory that provides answers to the positive or normative issue of game theory is called a solution theory or, more common, solution concept. The most prominent solution concept for strategic games is the Nash equilibrium concept. Dr. Michael Trost Microeconomics I: Game Theory Lecture 3 17 / 38
18 Nash equilibrium as a steady state The Nash equilibrium describes a steady state of the strategic game: An action profile is a Nash equilibrium whenever no player has an incentive to deviate from her action given the other players adhere to their actions. Dr. Michael Trost Microeconomics I: Game Theory Lecture 3 18 / 38
19 Nash equilibrium Definition 3.2 (Nash equilibrium) Consider a strategic game Γ := (I, (A i ) i I, ( i ) i I ). An action profile a := (ai ) i I A is a 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. Dr. Michael Trost Microeconomics I: Game Theory Lecture 3 19 / 38
20 Nash equilibrium of Prisoner s Dilemma Suspect B Suspect A quiet fink quiet 2,2 0,3 fink 3,0 1,1 QUESTION: Is action profile (quiet,quiet) a Nash equilibrium? ANSWER: No, because if suspect B chooses to be quiet, then A is better off if she finks. (Moreover, if suspect A chooses to be quiet, then B is better off if he finks, too). Dr. Michael Trost Microeconomics I: Game Theory Lecture 3 20 / 38
21 Nash equilibrium of Prisoner s Dilemma Suspect B Suspect A quiet fink quiet 2,2 0,3 fink 3,0 1,1 QUESTION: Is action profile (fink,quiet) a Nash equilibrium? ANSWER: No, because if suspect A chooses to fink, then B is better off if he finks, too. Dr. Michael Trost Microeconomics I: Game Theory Lecture 3 21 / 38
22 Nash equilibrium of Prisoner s Dilemma Suspect B Suspect A quiet fink quiet 2,2 0,3 fink 3,0 1,1 QUESTION: Is action profile (quiet,fink) a Nash equilibrium? ANSWER: No, because if suspect B chooses to fink, then A is better off if he finks, too. Dr. Michael Trost Microeconomics I: Game Theory Lecture 3 22 / 38
23 Nash equilibrium of Prisoner s Dilemma Suspect B Suspect A quiet fink quiet 2,2 0,3 fink 3,0 1,1 QUESTION: Is action profile (fink,fink) a Nash equilibrium? ANSWER: Yes! To prove this answer, you must show that, for every player, it is not profitable to be quiet given the other suspect finks. Dr. Michael Trost Microeconomics I: Game Theory Lecture 3 23 / 38
24 Nash equilibrium of Prisoner s Dilemma Suspect B Suspect A quiet fink quiet 2,2 0,3 fink 3,0 1,1 The action profile (fink,fink) is a Nash equilibrium, because given suspect B finks, then suspect A would not experience a higher utility if she chooses to be quiet. given suspect A finks, then suspect B would not experience a higher utility if she chooses to be quiet. Dr. Michael Trost Microeconomics I: Game Theory Lecture 3 24 / 38
25 The Prisoner s Dilemma The salient feature of PRISONER S DILEMMA is that the Nash equilibrium is an inefficient outcome of the game in the sense that there are other outcomes that are preferred to the Nash outcome by both players. Indeed, both players would be better off in outcome (quiet,quiet) than in Nash outcome (fink,fink) Dr. Michael Trost Microeconomics I: Game Theory Lecture 3 25 / 38
26 The Prisoner s Dilemma The reason why an inefficient outcome is reached is that the efficient outcome is instable. In the efficient situation, players have an incentive to deviate from it. This behavioral instability of efficient outcomes is presumably inherent in numerous real-life situations (e.g., in the competition of firms for profits and of states on international power) Dr. Michael Trost Microeconomics I: Game Theory Lecture 3 26 / 38
27 Example: Price-competing firms For all firms, the best outcome would be to charge a high price for their goods. However, to receive a higher profit every firm has an incentives to undercut the prices of its competitors. The process of undercutting prices ends up in an inefficient outcome for the firms. Finally, all firms charge a low price for their goods. Dr. Michael Trost Microeconomics I: Game Theory Lecture 3 27 / 38
28 Example: Arms-racing states For states, the best outcome would be to spend its revenues on social and economic welfare. However, each state has an incentive to gain international power by building an arsenal of weapons. This incentive ends up in an arms race between states and thus in an inefficient outcome. Finally, because of the mutual military buildup, no state has gained additional international power, but less financial capabilities for social and economic initiatives. Dr. Michael Trost Microeconomics I: Game Theory Lecture 3 28 / 38
29 Nash equilibrium of Matching Pennies Individual B Individual A Head Tail Head 1,-1-1,1 Tail -1,1 1,-1 EXERCISE: Figure out the Nash equilibria of MATCHING PENNIES! Dr. Michael Trost Microeconomics I: Game Theory Lecture 3 29 / 38
30 Nash equilibrium of Battle of Sexes Individual B Individual A Bach Stravinsky Bach 2,1 0,0 Stravinsky 0,0 1,2 EXERCISE: Figure out the Nash equilibria of BATTLE OF SEXES! Dr. Michael Trost Microeconomics I: Game Theory Lecture 3 30 / 38
31 The issue of existence and uniqueness The last two example of strategic games reveal that there are games in which there is no Nash equilibrium solution (see MATCHING PENNIES). there are more than one Nash equilibrium solution (see BATTLE OF SEXES). The first observation is referred to as the problem of existence, and the second one is referred to as the problem of uniqueness. Dr. Michael Trost Microeconomics I: Game Theory Lecture 3 31 / 38
32 Nash equilibrium of the Guessing Game QUESTION: What are the Nash equilibria of the GUESSING GAME with two players called henceforth player 1 and player 2. We demonstrate that the action profile (0, 0) (i.e., both players guess number 0) is the only Nash equilibrium of this game. Dr. Michael Trost Microeconomics I: Game Theory Lecture 3 32 / 38
33 Nash equilibrium of the Guessing Game CLAIM: The action profile (0, 0) is a Nash equilibrium of the two player GUESSING GAME. PROOF: If both players guess number 0, there is a draw and each player receives a monetary prize of e 5. Given player 2 guessed number 0, then player 1 would be worse off and gain e 0 if she guesses a number being different to 0. Thus, there is no incentive for her to deviate from the guessed number. The same arguments holds for player 2 Dr. Michael Trost Microeconomics I: Game Theory Lecture 3 33 / 38
34 Nash equilibrium of the Guessing Game CLAIM: Any action profile (a 1, a 2 ) different to (0, 0) is not a Nash equilibrium of the two player GUESSING GAME. PROOF: We show that in each of the three possible cases 1 a 1 = a 2 > 0 2 a 1 > a 2 3 a 2 > a 1 the profile (a 1, a 2 ) of guesses does not constitute a Nash equilibrium. Dr. Michael Trost Microeconomics I: Game Theory Lecture 3 34 / 38
35 Nash equilibrium of the Guessing Game CLAIM: Any action profile (a 1, a 2 ) different to (0, 0) is not a Nash equilibrium of the two player GUESSING GAME. CASE 1 a 1 = a 2 > 0 In this case, both players are winners and both players receive a prize of e 5. However, both players have an incentive to revise their guesses. Given player 2 announces guess a 2, player 1 could win e 10 if she announces a guess that is below a 2. A similar argument holds for player 2. Therefore in this case the profile of guesses is not a Nash equilibrium. Dr. Michael Trost Microeconomics I: Game Theory Lecture 3 35 / 38
36 Nash equilibrium of the Guessing Game CLAIM: Any action profile (a 1, a 2 ) different to (0, 0) is not a Nash equilibrium of the two player GUESSING GAME. CASE 2 a 1 > a 2 In this case, player 1 receives nothing because a 1 2 a 1 + a 2 > 2 a 1 + a 2 a holds. Given player 2 adheres to a 2, then player 1 could be a winner (and receives at least e 5) if she chooses a number which is smaller or equal than a 2. Hence, the profile of guesses is not a Nash equilibrium in this case. Dr. Michael Trost Microeconomics I: Game Theory Lecture 3 36 / 38
37 Nash equilibrium of the Guessing Game CLAIM: Any action profile (a 1, a 2 ) different to (0, 0) is not a Nash equilibrium of the two player GUESSING GAME. CASE 3 a 2 > a 1 To show that, in this case, the profile of guesses is not a Nash equilibrium one has to adopt only the arguments of case 2 and swap the roles of player 1 and player 2. Dr. Michael Trost Microeconomics I: Game Theory Lecture 3 37 / 38
38 Nash equilibrium of the Guessing Game EXERCISE: Show that the only Nash equilibrium in GUESSING GAMES with n 2 players is the profile of guesses in which every player announces number 0. HINT: Proceed as follows. Show that the profile of guesses in which every player chooses 0 is a Nash equilibrium. Thereafter demonstrate that in every other profile of guesses a player announcing the highest number could be better off by guessing a different number (which one?). Dr. Michael Trost Microeconomics I: Game Theory Lecture 3 38 / 38
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 informationLecture 7: Dominance Concepts
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
More informationAdvanced 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 informationIntroduction: 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 informationLecture 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 informationIntroduction 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 informationUPenn 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 informationLecture 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 informationIntroduction to Game Theory. František Kopřiva VŠE, Fall 2009
Introduction to Game Theory František Kopřiva VŠE, Fall 2009 Basic Information František Kopřiva Email: fkopriva@cerge-ei.cz Course webpage: http://home.cerge-ei.cz/kopriva Office hours: Tue 13:00-14:00
More informationEconomics 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 informationIntroduction 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 informationSession Outline. Application of Game Theory in Economics. Prof. Trupti Mishra, School of Management, IIT Bombay
36 : Game Theory 1 Session Outline Application of Game Theory in Economics Nash Equilibrium It proposes a strategy for each player such that no player has the incentive to change its action unilaterally,
More informationReading 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 informationTopics 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 informationEC3224 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 informationIntroduction to (Networked) Game Theory. Networked Life NETS 112 Fall 2016 Prof. Michael Kearns
Introduction to (Networked) Game Theory Networked Life NETS 112 Fall 2016 Prof. Michael Kearns Game Theory for Fun and Profit The Beauty Contest Game Write your name and an integer between 0 and 100 Let
More informationCS510 \ 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 informationMath 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 informationStudent 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 informationDYNAMIC GAMES. Lecture 6
DYNAMIC GAMES Lecture 6 Revision Dynamic game: Set of players: Terminal histories: all possible sequences of actions in the game Player function: function that assigns a player to every proper subhistory
More informationIntroduction to (Networked) Game Theory. Networked Life NETS 112 Fall 2014 Prof. Michael Kearns
Introduction to (Networked) Game Theory Networked Life NETS 112 Fall 2014 Prof. Michael Kearns percent who will actually attend 100% Attendance Dynamics: Concave equilibrium: 100% percent expected to attend
More informationTHEORY: 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 informationNORMAL FORM (SIMULTANEOUS MOVE) GAMES
NORMAL FORM (SIMULTANEOUS MOVE) GAMES 1 For These Games Choices are simultaneous made independently and without observing the other players actions Players have complete information, which means they know
More informationFIRST 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 informationSummary 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 informationESSENTIALS OF GAME THEORY
ESSENTIALS OF GAME THEORY 1 CHAPTER 1 Games in Normal Form Game theory studies what happens when self-interested agents interact. What does it mean to say that agents are self-interested? It does not necessarily
More informationEvolutionary 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 informationIntroduction 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 informationGame 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 informationIntroduction Economic Models Game Theory Models Games Summary. Syllabus
Syllabus Contact: kalk00@vse.cz home.cerge-ei.cz/kalovcova/teaching.html Office hours: Wed 7.30pm 8.00pm, NB339 or by email appointment Osborne, M. J. An Introduction to Game Theory Gibbons, R. A Primer
More informationGame theory Computational Models of Cognition
Game theory Taxonomy Rational behavior Definitions Common games Nash equilibria Mixed strategies Properties of Nash equilibria What do NE mean? Mutually Assured Destruction 6 rik@cogsci.ucsd.edu Taxonomy
More informationPrisoner 2 Confess Remain Silent Confess (-5, -5) (0, -20) Remain Silent (-20, 0) (-1, -1)
Session 14 Two-person non-zero-sum games of perfect information The analysis of zero-sum games is relatively straightforward because for a player to maximize its utility is equivalent to minimizing the
More informationIntroduction 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 informationThe 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 informationECON 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 informationSection 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 informationfinal 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 informationPARALLEL NASH EQUILIBRIA IN BIMATRIX GAMES ISAAC ELBAZ CSE633 FALL 2012 INSTRUCTOR: DR. RUSS MILLER
PARALLEL NASH EQUILIBRIA IN BIMATRIX GAMES ISAAC ELBAZ CSE633 FALL 2012 INSTRUCTOR: DR. RUSS MILLER WHAT IS GAME THEORY? Branch of mathematics that deals with the analysis of situations involving parties
More informationGame Theory: Introduction. Game Theory. Game Theory: Applications. Game Theory: Overview
Game Theory: Introduction Game Theory Game theory A means of modeling strategic behavior Agents act to maximize own welfare Agents understand their actions affect actions of other agents ECON 370: Microeconomic
More informationU 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 informationECO 5341 Strategic Behavior Lecture Notes 3
ECO 5341 Strategic Behavior Lecture Notes 3 Saltuk Ozerturk SMU Spring 2016 (SMU) Lecture Notes 3 Spring 2016 1 / 20 Lecture Outline Review: Dominance and Iterated Elimination of Strictly Dominated Strategies
More informationFirst Prev Next Last Go Back Full Screen Close Quit. Game Theory. Giorgio Fagiolo
Game Theory Giorgio Fagiolo giorgio.fagiolo@univr.it https://mail.sssup.it/ fagiolo/welcome.html Academic Year 2005-2006 University of Verona Web Resources My homepage: https://mail.sssup.it/~fagiolo/welcome.html
More informationGame Theory and Randomized Algorithms
Game Theory and Randomized Algorithms Guy Aridor Game theory is a set of tools that allow us to understand how decisionmakers interact with each other. It has practical applications in economics, international
More informationIntroduction. Begin with basic ingredients of a game. optimisation equilibrium. Frank Cowell: Game Theory Basics. July
GAME THEORY: BASICS MICROECONOMICS Principles and Analysis Frank Cowell Note: the detail in slides marked * can only be seen if you run the slideshow July 2017 1 Introduction Focus on conflict and cooperation
More informationGame Theory: Basics MICROECONOMICS. Principles and Analysis Frank Cowell
Game Theory: Basics MICROECONOMICS Principles and Analysis Frank Cowell March 2004 Introduction Focus on conflict and cooperation. Provides fundamental tools for microeconomic analysis. Offers new insights
More informationLecture 12: Extensive Games with Perfect Information
Microeconomics I: Game Theory Lecture 12: Extensive Games with Perfect Information (see Osborne, 2009, Sections 5.1,6.1) Dr. Michael Trost Department of Applied Microeconomics January 31, 2014 Dr. Michael
More informationCMU 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 informationGame Theory. Wolfgang Frimmel. Subgame Perfect Nash Equilibrium
Game Theory Wolfgang Frimmel Subgame Perfect Nash Equilibrium / Dynamic games of perfect information We now start analyzing dynamic games Strategic games suppress the sequential structure of decision-making
More informationBackward Induction and Stackelberg Competition
Backward Induction and Stackelberg Competition Economics 302 - Microeconomic Theory II: Strategic Behavior Shih En Lu Simon Fraser University (with thanks to Anke Kessler) ECON 302 (SFU) Backward Induction
More informationExtensive Games with Perfect Information. Start by restricting attention to games without simultaneous moves and without nature (no randomness).
Extensive Games with Perfect Information There is perfect information if each player making a move observes all events that have previously occurred. Start by restricting attention to games without simultaneous
More informationHomework 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 informationLecture #3: Networks. Kyumars Sheykh Esmaili
Lecture #3: Game Theory and Social Networks Kyumars Sheykh Esmaili Outline Games Modeling Network Traffic Using Game Theory Games Exam or Presentation Game You need to choose between exam or presentation:
More information1\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 information1. Simultaneous games All players move at same time. Represent with a game table. We ll stick to 2 players, generally A and B or Row and Col.
I. Game Theory: Basic Concepts 1. Simultaneous games All players move at same time. Represent with a game table. We ll stick to 2 players, generally A and B or Row and Col. Representation of utilities/preferences
More informationUC Berkeley Haas School of Business Economic Analysis for Business Decisions (EWMBA 201A) Game Theory I (PR 5) The main ideas
UC Berkeley Haas School of Business Economic Analysis for Business Decisions (EWMBA 201A) Game Theory I (PR 5) The main ideas Lectures 5-6 Aug. 29, 2009 Prologue Game theory is about what happens when
More informationCSCI 699: Topics in Learning and Game Theory Fall 2017 Lecture 3: Intro to Game Theory. Instructor: Shaddin Dughmi
CSCI 699: Topics in Learning and Game Theory Fall 217 Lecture 3: Intro to Game Theory Instructor: Shaddin Dughmi Outline 1 Introduction 2 Games of Complete Information 3 Games of Incomplete Information
More informationAppendix 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 informationChapter 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 informationLecture 23. Offense vs. Defense & Dynamic Games
Lecture 3. Offense vs. Defense & Dynamic Games EC DD & EE / Manove Offense vs Defense p EC DD & EE / Manove Clicker Question p Using Game Theory to Analyze Offense versus Defense In many competitive situations
More informationCHAPTER 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 informationCopyright 2008, Yan Chen
Unless otherwise noted, the content of this course material is licensed under a Creative Commons Attribution Non-Commercial 3.0 License. http://creativecommons.org/licenses/by-nc/3.0/ Copyright 2008, Yan
More informationEcon 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 informationMicroeconomics 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 informationLecture 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 informationResource 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 informationGame Theory. 4: Nash equilibrium in different games and mixed strategies
Game Theory 4: Nash equilibrium in different games and mixed strategies Review of lecture three A game with no dominated strategy: The battle of the sexes The concept of Nash equilibrium The formal definition
More information1. 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 informationIntroduction to Game Theory
Introduction to Game Theory (From a CS Point of View) Olivier Serre Serre@irif.fr IRIF (CNRS & Université Paris Diderot Paris 7) 14th of September 2017 Master Parisien de Recherche en Informatique Who
More informationComputational Aspects of Game Theory Bertinoro Spring School Lecture 2: Examples
Computational Aspects of Game Theory Bertinoro Spring School 2011 Lecturer: Bruno Codenotti Lecture 2: Examples We will present some examples of games with a few players and a few strategies. Each example
More informationEconS 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 informationGame 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 informationTerry College of Business - ECON 7950
Terry College of Business - ECON 7950 Lecture 5: More on the Hold-Up Problem + Mixed Strategy Equilibria Primary reference: Dixit and Skeath, Games of Strategy, Ch. 5. The Hold Up Problem Let there be
More informationStrategies 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 informationMulti-player, non-zero-sum games
Multi-player, non-zero-sum games 4,3,2 4,3,2 1,5,2 4,3,2 7,4,1 1,5,2 7,7,1 Utilities are tuples Each player maximizes their own utility at each node Utilities get propagated (backed up) from children to
More informationAdversarial 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 informationMultiagent 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 information3 Game Theory II: Sequential-Move and Repeated Games
3 Game Theory II: Sequential-Move and Repeated Games Recognizing that the contributions you make to a shared computer cluster today will be known to other participants tomorrow, you wonder how that affects
More informationMixed strategy Nash equilibrium
Mixed strategy Nash equilibrium Felix Munoz-Garcia Strategy and Game Theory - Washington State University Looking back... So far we have been able to nd the NE of a relatively large class of games with
More information(a) Left Right (b) Left Right. Up Up 5-4. Row Down 0-5 Row Down 1 2. (c) B1 B2 (d) B1 B2 A1 4, 2-5, 6 A1 3, 2 0, 1
Economics 109 Practice Problems 2, Vincent Crawford, Spring 2002 In addition to these problems and those in Practice Problems 1 and the midterm, you may find the problems in Dixit and Skeath, Games of
More informationGame 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 informationECON 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 informationGame Theory and the Environment. Game Theory and the Environment
and the Environment Static Games of Complete Information Game theory attempts to mathematically capture behavior in strategic situations Normal Form Game: Each Player simultaneously choose a strategy,
More informationElements 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 information14.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 informationChapter 13. Game Theory
Chapter 13 Game Theory 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 friend coolly replies, I don
More informationMultiagent 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 informationExercises 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 informationIntroduction 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 informationRationality 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 informationStatic or simultaneous games. 1. Normal Form and the elements of the game
Static or simultaneous games 1. Normal Form and the elements of the game Simultaneous games Definition Each player chooses an action without knowing what the others choose. The players move simultaneously.
More informationMultiagent 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 informationWhat is... Game Theory? By Megan Fava
ABSTRACT What is... Game Theory? By Megan Fava Game theory is a branch of mathematics used primarily in economics, political science, and psychology. This talk will define what a game is and discuss a
More informationCMU-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 informationExtensive Games with Perfect Information A Mini Tutorial
Extensive Games withperfect InformationA Mini utorial p. 1/9 Extensive Games with Perfect Information A Mini utorial Krzysztof R. Apt (so not Krzystof and definitely not Krystof) CWI, Amsterdam, the Netherlands,
More informationLecture 24. Extensive-Form Dynamic Games
Lecture 4. Extensive-orm Dynamic Games Office Hours this week at usual times: Tue 5:5-6:5, ri - Practice inal Exam available on course website. A Graded Homework is due this Thursday at 7pm. EC DD & EE
More informationLecture 13(ii) Announcements. Lecture on Game Theory. None. 1. The Simple Version of the Battle of the Sexes
Lecture 13(ii) Announcements None Lecture on Game Theory 1. The Simple Version of the Battle of the Sexes 2. The Battle of the Sexes with Some Strategic Moves 3. Rock Paper Scissors 4. Chicken 5. Duopoly
More informationComputational Methods for Non-Cooperative Game Theory
Computational Methods for Non-Cooperative Game Theory What is a game? Introduction A game is a decision problem in which there a multiple decision makers, each with pay-off interdependence Each decisions
More informationRepeated 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 informationGame 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 informationWHEN PRISONERS ENTER BATTLE: NATURAL CONNECTIONS IN 2 X 2 SYMMETRIC GAMES. by: Sarah Heilig
WHEN PRISONERS ENTER BATTLE: NATURAL CONNECTIONS IN 2 X 2 SYMMETRIC GAMES by: Sarah Heilig Thesis submitted to the Honors Program, Saint Peter's College Date of Submission: March 28, 2011 Acknowledgements
More information