Rationalizable Strategies
|
|
- Posy Riley
- 5 years ago
- Views:
Transcription
1 Rationalizable Strategies Carlos Hurtado Department of Economics University of Illinois at Urbana-Champaign Jun 1st, 2015 C. Hurtado (UIUC - Economics) Game Theory
2 On the Agenda 1 Formalizing the Game 2 Rationalizability 3 Exercises 4 Nash Equilibrium 5 Exercises C. Hurtado (UIUC - Economics) Game Theory
3 Formalizing the Game On the Agenda 1 Formalizing the Game 2 Rationalizability 3 Exercises 4 Nash Equilibrium 5 Exercises C. Hurtado (UIUC - Economics) Game Theory 1 / 19
4 Formalizing the Game Formalizing the Game Let me fix some Notation: - set of players: I = {1, 2,, N} - set of actions: i I, a i A i, where each player i has a set of actions A i. - strategies for each player: i I, s i S i, where each player i has a set of pure strategies S i available to him. A strategy is a complete contingent plan for playing the game, which specifies a feasible action of a player s information sets in the game. - profile of pure strategies: s = (s 1, s 2,, s N ) N Si = S. i=1 Note: let s i = (s 1, s 2,, s i 1, s i+1,, s N ) S i, we will denote s = (s i, s i) (S i, S i) = S. - Payoff function: u i : N Si R, denoted by ui(si, s i) i=1 - A mixed strategy for player i is a function σ i : S i [0, 1], which assigns a probability σ i(s i) 0 to each pure strategy s i S i, satisfying s i S i σ i(s i) = 1. C. Hurtado (UIUC - Economics) Game Theory 2 / 19
5 Formalizing the Game Formalizing the Game Notice now that even if there is no role for nature in a game, when players use (nondegenerate) mixed strategies, this induces a probability distribution over terminal nodes of the game. But we can easily extend payoffs again to define payoffs over a profile of mixed strategies as follows: u i (σ 1,, σ N ) = u i (σ i, σ i ) = [σ 1 (s 1 ) σ N (s N )] u i (s 1,, s N ) s S s i S i s i S i j i [ ] σ j (s j ) σ i (s i )u i (s i, s i ) For the above formula to make sense, it is critical that each player is randomizing independently. That is, each player is independently tossing her own die to decide on which pure strategy to play. C. Hurtado (UIUC - Economics) Game Theory 3 / 19
6 Formalizing the Game Formalizing the Game If s i is a strictly dominant strategy for player i, then for all σ i (S i), σ i s i, and all σ i (S i), u i(s i, σ i) > u i(σ i, σ i). Let σ i (S i), with σ i s i, and let σ i (S i). Then, [ ] u i(s i, σ i) = σ j(s j) u i(s i, s i) and u i(σ i, σ i) = s i S i s i S i s i S i j i [ ] σ j(s j) σ i( s i)u i( s i, s i) Then, u i(s i, σ i) u i(σ i, σ i) is ( ) [ ] σ j(s j) u i(s i, s i) σ i( s i)u i( s i, s i) j i s i S i s i S i j i C. Hurtado (UIUC - Economics) Game Theory 4 / 19
7 Formalizing the Game Formalizing the Game u i(s i, σ i) u i(σ i, σ i) is ( ) [ ] σ j(s j) u i(s i, s i) σ i( s i)u i( s i, s i) j i s i S i s i S i Since s i is strictly dominant, u i(s i, s i) > u i( s i, s i) for all s i s i and all s i. Hence, u i(s i, s i) > σ i( s i)u i( s i, s i) for any σ i (S i) such that σ i s i s i S i (why?). This implies the desired inequality: u i(s i, σ i) u i(σ i, σ i) > 0 C. Hurtado (UIUC - Economics) Game Theory 5 / 19
8 Formalizing the Game Formalizing the Game We learned that: If s i is a strictly dominant strategy for player i, then for all σ i (S i), σ i s i, and all σ i (S i), u i(s i, σ i) > u i(σ i, σ i). Exercise 1. Show that there can be no strategy σ i (S i) such that for all s i S i and s i S i, u i(σ i, s i) > u i(s i, s i). The preceding Theorem and Exercise show that there is absolutely no loss in restricting attention to pure strategies for all players when looking for strictly dominant strategies. C. Hurtado (UIUC - Economics) Game Theory 6 / 19
9 Rationalizability On the Agenda 1 Formalizing the Game 2 Rationalizability 3 Exercises 4 Nash Equilibrium 5 Exercises C. Hurtado (UIUC - Economics) Game Theory 7 / 19
10 Rationalizability Rationalizability Definition A strategy σ i (S i) is a best response to the strategy profile σ i (S i) if u(σ i, σ i) u( σ i, σ i) for all σ i (S i). A strategy σ i (S i) is never a best response if there is no σ i (S i) for which σ i is a best response. The idea is that a strategy, σ i, is a best response if there is some strategy profile of the opponents for which σ i does at least as well as any other strategy. Conversely, σ i is never a best response if for every strategy profile of the opponents, there is some strategy that does strictly better than σ i. Clearly, in any game, a strategy that is strictly dominated is never a best response. Exercise 2. Prove that in 2-player games, a pure strategy is never a best response if and only if it is strictly dominated. C. Hurtado (UIUC - Economics) Game Theory 8 / 19
11 Rationalizability Rationalizability In games with more than 2 players, there may be strategies that are not strictly dominated that are nonetheless never best responses. As before, it is a consequence of rationality that a player should not play a strategy that is never a best response. That is, we can delete strategies that are never best responses. By iterating on the knowledge of rationality, we iteratively delete strategies that are never best responses. The set of strategies for a player that survives this iterated deletion of never best responses is called her set of rationalizable strategies. C. Hurtado (UIUC - Economics) Game Theory 9 / 19
12 Rationalizability Rationalizability Definition 1 σ i (S i) is a 1-rationalizable strategy for player i if it is a best response to some strategy profile σ i (S i). 2 σ i (S i) is a k-rationalizable strategy (k 2) for player i if it is a best response to some strategy profile σ i (S i) such that each σ j is (k âĺš 1)-rationalizable for player j i. 3 σ i (S i) is a rationalizable for player i if it is k-rationalizable for all k 1. C. Hurtado (UIUC - Economics) Game Theory 10 / 19
13 Rationalizability Rationalizability Note that the set of rationalizable strategies can no be larger that the set of strategies surviving iterative removal of strictly dominated strategies. This follows from the earlier comment that a strictly dominated strategy is never a best response. In this sense, rationalizability is (weakly) more restrictive than iterated deletion of strictly dominated strategies. It turns out that in 2-player games, the two concepts coincide. In n-player games (n > 2), they don t have to. Strategies that remain after iterative elimination of strategies that are never best responses: those that a rational player can justify, or rationalize, with some reasonable conjecture concerning the behavior of his rivals (reasonable in the sense that his opponents are not presumed to play strategies that are never best responses, etc.). Rationalizable intuitively means that there is a plausible explanation that would justify the use of the strategy. C. Hurtado (UIUC - Economics) Game Theory 11 / 19
14 Exercises On the Agenda 1 Formalizing the Game 2 Rationalizability 3 Exercises 4 Nash Equilibrium 5 Exercises C. Hurtado (UIUC - Economics) Game Theory 12 / 19
15 Exercises Exercises Exercise 1. Show that there can be no strategy σ i (S i) such that for all s i S i and s i S i, u i(σ i, s i) > u i(s i, s i). Exercise 2. Prove that in 2-player games, a pure strategy is never a best response if and only if it is strictly dominated. Determine the set of rationalizable pure strategies for the following game: 1/2 b 1 b 2 b 3 b 4 a 1 0, 7 2, 5 7, 0 0, 1 a 2 5, 2 3, 3 5, 2 0, 1 a 3 7, 0 2, 5 0, 7 0, 1 a 4 0, 0 0,2 0, 0 10,1 C. Hurtado (UIUC - Economics) Game Theory 13 / 19
16 Nash Equilibrium On the Agenda 1 Formalizing the Game 2 Rationalizability 3 Exercises 4 Nash Equilibrium 5 Exercises C. Hurtado (UIUC - Economics) Game Theory 14 / 19
17 Nash Equilibrium Nash Equilibrium Now we turn to the most well-known solution concept in game theory. We ll first discuss pure strategy Nash equilibrium (PSNE), and then later extend to mixed strategies. Definition A strategy profile s = (s 1,..., s N ) S is a Pure Strategy Nash Equilibrium (PSNE) if for all i and s i S i, u(s i, s i) u( s i, s i). In a Nash equilibrium, each player s strategy must be a best response to those strategies of his opponents that are components of the equilibrium. Remark: Every finite game of perfect information has a pure strategy Nash equilibrium. C. Hurtado (UIUC - Economics) Game Theory 15 / 19
18 Nash Equilibrium Nash Equilibrium Unlike with our earlier solution concepts (dominance and rationalizability), Nash equilibrium applies to a profile of strategies rather than any individual s strategy. When people say Nash equilibrium strategy, what they mean is a strategy that is part of a Nash equilibrium profile. The term equilibrium is used because it connotes that if a player knew that his opponents were playing the prescribed strategies, then she is playing optimally by following her prescribed strategy. In a sense, this is like a rational expectations equilibrium, in that in a Nash equilibrium, a player s beliefs about what his opponents will do get confirmed (where the beliefs are precisely the opponents prescribed strategies). Rationalizability only requires a player play optimally with respect to some reasonable conjecture about the opponents play, where reasonable means that the conjectured play of the rivals can also be justified in this way. On the other hand, Nash requires that a player play optimally with respect to what his opponents are actually playing. That is to say, the conjecture she holds about her opponents play is correct. C. Hurtado (UIUC - Economics) Game Theory 16 / 19
19 Nash Equilibrium Nash Equilibrium The above point makes clear that Nash equilibrium is not simply a consequence of (common knowledge of) rationality and the structure of the game. Clearly, each player s strategy in a Nash equilibrium profile is rationalizable, but lots of rationalizable profiles are not Nash equilibria. C. Hurtado (UIUC - Economics) Game Theory 17 / 19
20 Exercises On the Agenda 1 Formalizing the Game 2 Rationalizability 3 Exercises 4 Nash Equilibrium 5 Exercises C. Hurtado (UIUC - Economics) Game Theory 18 / 19
21 Exercises Exercises Find the Nash Equilibria of the following games: What about Rock, Paper, Scissors? C. Hurtado (UIUC - Economics) Game Theory 19 / 19
Sequential Rationality and Weak Perfect Bayesian Equilibrium
Sequential Rationality and Weak Perfect Bayesian Equilibrium Carlos Hurtado Department of Economics University of Illinois at Urbana-Champaign hrtdmrt2@illinois.edu June 16th, 2016 C. Hurtado (UIUC - Economics)
More informationJanuary 26,
January 26, 2015 Exercise 9 7.c.1, 7.d.1, 7.d.2, 8.b.1, 8.b.2, 8.b.3, 8.b.4,8.b.5, 8.d.1, 8.d.2 Example 10 There are two divisions of a firm (1 and 2) that would benefit from a research project conducted
More information6.254 : Game Theory with Engineering Applications Lecture 3: Strategic Form Games - Solution Concepts
6.254 : Game Theory with Engineering Applications Lecture 3: Strategic Form Games - Solution Concepts Asu Ozdaglar MIT February 9, 2010 1 Introduction Outline Review Examples of Pure Strategy Nash Equilibria
More informationBest-Reply Sets. Jonathan Weinstein Washington University in St. Louis. This version: May 2015
Best-Reply Sets Jonathan Weinstein Washington University in St. Louis This version: May 2015 Introduction The best-reply correspondence of a game the mapping from beliefs over one s opponents actions to
More informationSI 563 Homework 3 Oct 5, Determine the set of rationalizable strategies for each of the following games. a) X Y X Y Z
SI 563 Homework 3 Oct 5, 06 Chapter 7 Exercise : ( points) Determine the set of rationalizable strategies for each of the following games. a) U (0,4) (4,0) M (3,3) (3,3) D (4,0) (0,4) X Y U (0,4) (4,0)
More informationGame theory and applications: Lecture 1
Game theory and applications: Lecture 1 Adam Szeidl September 20, 2018 Outline for today 1 Some applications of game theory 2 Games in strategic form 3 Dominance 4 Nash equilibrium 1 / 8 1. Some applications
More informationECONS 424 STRATEGY AND GAME THEORY HANDOUT ON PERFECT BAYESIAN EQUILIBRIUM- III Semi-Separating equilibrium
ECONS 424 STRATEGY AND GAME THEORY HANDOUT ON PERFECT BAYESIAN EQUILIBRIUM- III Semi-Separating equilibrium Let us consider the following sequential game with incomplete information. Two players are playing
More informationAdvanced Microeconomics
Advanced Microeconomics ECON5200 - Fall 2014 Introduction What you have done: - consumers maximize their utility subject to budget constraints and firms maximize their profits given technology and market
More informationIntroduction to Game Theory
Introduction to Game Theory 3a. More on Normal-Form Games Dana Nau University of Maryland Nau: Game Theory 1 More Solution Concepts Last time, we talked about several solution concepts Pareto optimality
More informationPAULI MURTO, ANDREY ZHUKOV. If any mistakes or typos are spotted, kindly communicate them to
GAME THEORY PROBLEM SET 1 WINTER 2018 PAULI MURTO, ANDREY ZHUKOV Introduction If any mistakes or typos are spotted, kindly communicate them to andrey.zhukov@aalto.fi. Materials from Osborne and Rubinstein
More informationECE 586GT: Problem Set 1: Problems and Solutions Analysis of static games
University of Illinois Fall 2018 ECE 586GT: Problem Set 1: Problems and Solutions Analysis of static games Due: Tuesday, Sept. 11, at beginning of class Reading: Course notes, Sections 1.1-1.4 1. [A random
More informationBasic Game-Theoretic Concepts. Game in strategic form has following elements. Player set N. (Pure) strategy set for player i, S i.
Basic Game-Theoretic Concepts Game in strategic form has following elements Player set N (Pure) strategy set for player i, S i. Payoff function f i for player i f i : S R, where S is product of S i s.
More informationCS711: Introduction to Game Theory and Mechanism Design
CS711: Introduction to Game Theory and Mechanism Design Teacher: Swaprava Nath Domination, Elimination of Dominated Strategies, Nash Equilibrium Domination Normal form game N, (S i ) i N, (u i ) i N Definition
More informationECON 803: MICROECONOMIC THEORY II Arthur J. Robson Fall 2016 Assignment 9 (due in class on November 22)
ECON 803: MICROECONOMIC THEORY II Arthur J. Robson all 2016 Assignment 9 (due in class on November 22) 1. Critique of subgame perfection. 1 Consider the following three-player sequential game. In the first
More informationIntroduction. Microeconomics II. Dominant Strategies. Definition (Dominant Strategies)
Introduction Microeconomics II Dominance and Rationalizability Levent Koçkesen Koç University Nash equilibrium concept assumes that each player knows the other players equilibrium behavior This is problematic
More informationCS711 Game Theory and Mechanism Design
CS711 Game Theory and Mechanism Design Problem Set 1 August 13, 2018 Que 1. [Easy] William and Henry are participants in a televised game show, seated in separate booths with no possibility of communicating
More informationGame Theory. VK Room: M1.30 Last updated: October 22, 2012.
Game Theory VK Room: M1.30 knightva@cf.ac.uk www.vincent-knight.com Last updated: October 22, 2012. 1 / 33 Overview Normal Form Games Pure Nash Equilibrium Mixed Nash Equilibrium 2 / 33 Normal Form Games
More informationCMSC 474, Introduction to Game Theory 16. Behavioral vs. Mixed Strategies
CMSC 474, Introduction to Game Theory 16. Behavioral vs. Mixed Strategies Mohammad T. Hajiaghayi University of Maryland Behavioral Strategies In imperfect-information extensive-form games, we can define
More informationMicroeconomic Theory II Preliminary Examination Solutions
Microeconomic Theory II Preliminary Examination Solutions 1. (45 points) Consider the following normal form game played by Bruce and Sheila: L Sheila R T 1, 0 3, 3 Bruce M 1, x 0, 0 B 0, 0 4, 1 (a) Suppose
More informationIntroduction to Industrial Organization Professor: Caixia Shen Fall 2014 Lecture Note 5 Games and Strategy (Ch. 4)
Introduction to Industrial Organization Professor: Caixia Shen Fall 2014 Lecture Note 5 Games and Strategy (Ch. 4) Outline: Modeling by means of games Normal form games Dominant strategies; dominated strategies,
More informationPreliminary Notions in Game Theory
Chapter 7 Preliminary Notions in Game Theory I assume that you recall the basic solution concepts, namely Nash Equilibrium, Bayesian Nash Equilibrium, Subgame-Perfect Equilibrium, and Perfect Bayesian
More informationAn introduction on game theory for wireless networking [1]
An introduction on game theory for wireless networking [1] Ning Zhang 14 May, 2012 [1] Game Theory in Wireless Networks: A Tutorial 1 Roadmap 1 Introduction 2 Static games 3 Extensive-form games 4 Summary
More informationPAULI MURTO, ANDREY ZHUKOV
GAME THEORY SOLUTION SET 1 WINTER 018 PAULI MURTO, ANDREY ZHUKOV Introduction For suggested solution to problem 4, last year s suggested solutions by Tsz-Ning Wong were used who I think used suggested
More information1 R. 2 l r 1 1 l2 r 2
4. Game Theory Midterm I Instructions. This is an open book exam; you can use any written material. You have one hour and 0 minutes. Each question is 35 points. Good luck!. Consider the following game
More informationEconomics 109 Practice Problems 1, Vincent Crawford, Spring 2002
Economics 109 Practice Problems 1, Vincent Crawford, Spring 2002 P1. Consider the following game. There are two piles of matches and two players. The game starts with Player 1 and thereafter the players
More information10.1 Elimination of strictly dominated strategies
Chapter 10 Elimination by Mixed Strategies The notions of dominance apply in particular to mixed extensions of finite strategic games. But we can also consider dominance of a pure strategy by a mixed strategy.
More informationTest 1. ECON3161, Game Theory. Tuesday, September 25 th
Test 1 ECON3161, Game Theory Tuesday, September 2 th Directions: Answer each question completely. If you cannot determine the answer, explaining how you would arrive at the answer may earn you some points.
More informationEconomics 171: Final Exam
Question 1: Basic Concepts (20 points) Economics 171: Final Exam 1. Is it true that every strategy is either strictly dominated or is a dominant strategy? Explain. (5) No, some strategies are neither dominated
More informationIterated Dominance and Nash Equilibrium
Chapter 11 Iterated Dominance and Nash Equilibrium In the previous chapter we examined simultaneous move games in which each player had a dominant strategy; the Prisoner s Dilemma game was one example.
More informationIn the Name of God. Sharif University of Technology. Microeconomics 2. Graduate School of Management and Economics. Dr. S.
In the Name of God Sharif University of Technology Graduate School of Management and Economics Microeconomics 2 44706 (1394-95 2 nd term) - Group 2 Dr. S. Farshad Fatemi Chapter 8: Simultaneous-Move Games
More informationOutline Introduction Game Representations Reductions Solution Concepts. Game Theory. Enrico Franchi. May 19, 2010
May 19, 2010 1 Introduction Scope of Agent preferences Utility Functions 2 Game Representations Example: Game-1 Extended Form Strategic Form Equivalences 3 Reductions Best Response Domination 4 Solution
More informationPrisoner s Dilemma. CS 331: Artificial Intelligence Game Theory I. Prisoner s Dilemma. Prisoner s Dilemma. Prisoner s Dilemma.
CS 331: rtificial Intelligence Game Theory I You and your partner have both been caught red handed near the scene of a burglary. oth of you have been brought to the police station, where you are interrogated
More informationIntroduction to Game Theory Lecture Note 5: Repeated Games
Introduction to Game Theory Lecture Note 5: Repeated Games Haifeng Huang University of California, Merced Repeated games Repeated games: given a simultaneous-move game G, a repeated game of G is an extensive
More informationNotes for Section: Week 4
Economics 160 Professor Steven Tadelis Stanford University Spring Quarter, 2004 Notes for Section: Week 4 Notes prepared by Paul Riskind (pnr@stanford.edu). spot errors or have questions about these notes.
More informationpreferences of the individual players over these possible outcomes, typically measured by a utility or payoff function.
Leigh Tesfatsion 26 January 2009 Game Theory: Basic Concepts and Terminology A GAME consists of: a collection of decision-makers, called players; the possible information states of each player at each
More informationECON 459 Game Theory. Lecture Notes Auctions. Luca Anderlini Spring 2017
ECON 459 Game Theory Lecture Notes Auctions Luca Anderlini Spring 2017 These notes have been used and commented on before. If you can still spot any errors or have any suggestions for improvement, please
More informationBeliefs and Sequential Rationality
Beliefs and Sequential Rationality A system of beliefs µ in extensive form game Γ E is a specification of a probability µ(x) [0,1] for each decision node x in Γ E such that x H µ(x) = 1 for all information
More informationTR : Knowledge-Based Rational Decisions and Nash Paths
City University of New York (CUNY) CUNY Academic Works Computer Science Technical Reports Graduate Center 2009 TR-2009015: Knowledge-Based Rational Decisions and Nash Paths Sergei Artemov Follow this and
More information1 Games in Strategic Form
1 Games in Strategic Form A game in strategic form or normal form is a triple Γ (N,{S i } i N,{u i } i N ) in which N = {1,2,...,n} is a finite set of players, S i is the set of strategies of player i,
More informationProblem 3 Solutions. l 3 r, 1
. Economic Applications of Game Theory Fall 00 TA: Youngjin Hwang Problem 3 Solutions. (a) There are three subgames: [A] the subgame starting from Player s decision node after Player s choice of P; [B]
More informationGame Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India October 2012
Game Theory Lecture Notes By Y. Narahari Department of Computer Science and Automation Indian Institute of Science Bangalore, India October 22 COOPERATIVE GAME THEORY Correlated Strategies and Correlated
More informationGame Theory for Wireless Engineers Chapter 3, 4
Game Theory for Wireless Engineers Chapter 3, 4 Zhongliang Liang ECE@Mcmaster Univ October 8, 2009 Outline Chapter 3 - Strategic Form Games - 3.1 Definition of A Strategic Form Game - 3.2 Dominated Strategies
More informationHandout on Rationalizability and IDSDS 1
EconS 424 - Strategy and Game Theory Handout on Rationalizability and ISS 1 1 Introduction In this handout, we will discuss an extension of best response functions: Rationalizability. Best response: As
More informationLecture 1: Normal Form Games: Refinements and Correlated Equilibrium
Lecture 1: Normal Form Games: Refinements and Correlated Equilibrium Albert Banal-Estanol April 2006 Lecture 1 2 Albert Banal-Estanol Trembling hand perfect equilibrium: Motivation, definition and examples
More informationG5212: Game Theory. Mark Dean. Spring 2017
G5212: Game Theory Mark Dean Spring 2017 Modelling Dynamics Up until now, our games have lacked any sort of dynamic aspect We have assumed that all players make decisions at the same time Or at least no
More informationCS 331: Artificial Intelligence Game Theory I. Prisoner s Dilemma
CS 331: Artificial Intelligence Game Theory I 1 Prisoner s Dilemma You and your partner have both been caught red handed near the scene of a burglary. Both of you have been brought to the police station,
More informationExtensive form games - contd
Extensive form games - contd Proposition: Every finite game of perfect information Γ E has a pure-strategy SPNE. Moreover, if no player has the same payoffs in any two terminal nodes, then there is a unique
More informationExtensive-Form Games with Imperfect Information
May 6, 2015 Example 2, 2 A 3, 3 C Player 1 Player 1 Up B Player 2 D 0, 0 1 0, 0 Down C Player 1 D 3, 3 Extensive-Form Games With Imperfect Information Finite No simultaneous moves: each node belongs to
More informationGames of Incomplete Information
Games of Incomplete Information EC202 Lectures V & VI Francesco Nava London School of Economics January 2011 Nava (LSE) EC202 Lectures V & VI Jan 2011 1 / 22 Summary Games of Incomplete Information: Definitions:
More informationMarch 30, Why do economists (and increasingly, engineers and computer scientists) study auctions?
March 3, 215 Steven A. Matthews, A Technical Primer on Auction Theory I: Independent Private Values, Northwestern University CMSEMS Discussion Paper No. 196, May, 1995. This paper is posted on the course
More informationNow we return to simultaneous-move games. We resolve the issue of non-existence of Nash equilibrium. in pure strategies through intentional mixing.
Econ 221 Fall, 2018 Li, Hao UBC CHAPTER 7. SIMULTANEOUS-MOVE GAMES: MIXED STRATEGIES Now we return to simultaneous-move games. We resolve the issue of non-existence of Nash equilibrium in pure strategies
More informationSequential-move games with Nature s moves.
Econ 221 Fall, 2018 Li, Hao UBC CHAPTER 3. GAMES WITH SEQUENTIAL MOVES Game trees. Sequential-move games with finite number of decision notes. Sequential-move games with Nature s moves. 1 Strategies in
More informationIntroduction to Game Theory
Introduction to Game Theory What is a Game? A game is a formal representation of a situation in which a number of individuals interact in a setting of strategic interdependence. By that, we mean that each
More informationLecture 3 Representation of Games
ecture 3 epresentation of Games 4. Game Theory Muhamet Yildiz oad Map. Cardinal representation Expected utility theory. Quiz 3. epresentation of games in strategic and extensive forms 4. Dominance; dominant-strategy
More informationMicroeconomics II. CIDE, MsC Economics. List of Problems
Microeconomics II CIDE, MsC Economics List of Problems 1. There are three people, Amy (A), Bart (B) and Chris (C): A and B have hats. These three people are arranged in a room so that B can see everything
More informationMixed Strategies. In the previous chapters we restricted players to using pure strategies and we
6 Mixed Strategies In the previous chapters we restricted players to using pure strategies and we postponed discussing the option that a player may choose to randomize between several of his pure strategies.
More informationIntroduction to Multi-Agent Programming
Introduction to Multi-Agent Programming 10. Game Theory Strategic Reasoning and Acting Alexander Kleiner and Bernhard Nebel Strategic Game A strategic game G consists of a finite set N (the set of players)
More informationEconomics 209A Theory and Application of Non-Cooperative Games (Fall 2013) Repeated games OR 8 and 9, and FT 5
Economics 209A Theory and Application of Non-Cooperative Games (Fall 2013) Repeated games OR 8 and 9, and FT 5 The basic idea prisoner s dilemma The prisoner s dilemma game with one-shot payoffs 2 2 0
More informationGame Theory: Global Games. Christoph Schottmüller
Game Theory: Global Games Christoph Schottmüller 1 / 20 Outline 1 Global Games: Stag Hunt 2 An investment example 3 Revision questions and exercises 2 / 20 Stag Hunt Example H2 S2 H1 3,3 3,0 S1 0,3 4,4
More informationFinitely repeated simultaneous move game.
Finitely repeated simultaneous move game. Consider a normal form game (simultaneous move game) Γ N which is played repeatedly for a finite (T )number of times. The normal form game which is played repeatedly
More informationCMPSCI 240: Reasoning about Uncertainty
CMPSCI 240: Reasoning about Uncertainty Lecture 23: More Game Theory Andrew McGregor University of Massachusetts Last Compiled: April 20, 2017 Outline 1 Game Theory 2 Non Zero-Sum Games and Nash Equilibrium
More informationStochastic Games and Bayesian Games
Stochastic Games and Bayesian Games CPSC 532L Lecture 10 Stochastic Games and Bayesian Games CPSC 532L Lecture 10, Slide 1 Lecture Overview 1 Recap 2 Stochastic Games 3 Bayesian Games Stochastic Games
More informationMicroeconomics Comprehensive Exam
Microeconomics Comprehensive Exam June 2009 Instructions: (1) Please answer each of the four questions on separate pieces of paper. (2) When finished, please arrange your answers alphabetically (in the
More informationAdvanced Micro 1 Lecture 14: Dynamic Games Equilibrium Concepts
Advanced Micro 1 Lecture 14: Dynamic Games quilibrium Concepts Nicolas Schutz Nicolas Schutz Dynamic Games: quilibrium Concepts 1 / 79 Plan 1 Nash equilibrium and the normal form 2 Subgame-perfect equilibrium
More informationMA300.2 Game Theory 2005, LSE
MA300.2 Game Theory 2005, LSE Answers to Problem Set 2 [1] (a) This is standard (we have even done it in class). The one-shot Cournot outputs can be computed to be A/3, while the payoff to each firm can
More informationProblem Set 2 - SOLUTIONS
Problem Set - SOLUTONS 1. Consider the following two-player game: L R T 4, 4 1, 1 B, 3, 3 (a) What is the maxmin strategy profile? What is the value of this game? Note, the question could be solved like
More informationMIDTERM ANSWER KEY GAME THEORY, ECON 395
MIDTERM ANSWER KEY GAME THEORY, ECON 95 SPRING, 006 PROFESSOR A. JOSEPH GUSE () There are positions available with wages w and w. Greta and Mary each simultaneously apply to one of them. If they apply
More informationGAME THEORY. Department of Economics, MIT, Follow Muhamet s slides. We need the following result for future reference.
14.126 GAME THEORY MIHAI MANEA Department of Economics, MIT, 1. Existence and Continuity of Nash Equilibria Follow Muhamet s slides. We need the following result for future reference. Theorem 1. Suppose
More informationChapter 10: Mixed strategies Nash equilibria, reaction curves and the equality of payoffs theorem
Chapter 10: Mixed strategies Nash equilibria reaction curves and the equality of payoffs theorem Nash equilibrium: The concept of Nash equilibrium can be extended in a natural manner to the mixed strategies
More information(a) (5 points) Suppose p = 1. Calculate all the Nash Equilibria of the game. Do/es the equilibrium/a that you have found maximize social utility?
GAME THEORY EXAM (with SOLUTIONS) January 20 P P2 P3 P4 INSTRUCTIONS: Write your answers in the space provided immediately after each question. You may use the back of each page. The duration of this exam
More informationStochastic Games and Bayesian Games
Stochastic Games and Bayesian Games CPSC 532l Lecture 10 Stochastic Games and Bayesian Games CPSC 532l Lecture 10, Slide 1 Lecture Overview 1 Recap 2 Stochastic Games 3 Bayesian Games 4 Analyzing Bayesian
More informationUsing the Maximin Principle
Using the Maximin Principle Under the maximin principle, it is easy to see that Rose should choose a, making her worst-case payoff 0. Colin s similar rationality as a player induces him to play (under
More informationPlayer 2 H T T -1,1 1, -1
1 1 Question 1 Answer 1.1 Q1.a In a two-player matrix game, the process of iterated elimination of strictly dominated strategies will always lead to a pure-strategy Nash equilibrium. Answer: False, In
More informationOn Existence of Equilibria. Bayesian Allocation-Mechanisms
On Existence of Equilibria in Bayesian Allocation Mechanisms Northwestern University April 23, 2014 Bayesian Allocation Mechanisms In allocation mechanisms, agents choose messages. The messages determine
More informationElements of Economic Analysis II Lecture X: Introduction to Game Theory
Elements of Economic Analysis II Lecture X: Introduction to Game Theory Kai Hao Yang 11/14/2017 1 Introduction and Basic Definition of Game So far we have been studying environments where the economic
More informationMicroeconomic Theory III Final Exam March 18, 2010 (80 Minutes)
4. Microeconomic Theory III Final Exam March 8, (8 Minutes). ( points) This question assesses your understanding of expected utility theory. (a) In the following pair of games, check whether the players
More informationMixed Strategy Nash Equilibrium. player 2
Mixed Strategy Nash Equilibrium In the Matching Pennies Game, one can try to outwit the other player by guessing which strategy the other player is more likely to choose. player 2 player 1 1 1 1 1 1 1
More informationStrategies and Nash Equilibrium. A Whirlwind Tour of Game Theory
Strategies and Nash Equilibrium A Whirlwind Tour of Game Theory (Mostly from Fudenberg & Tirole) Players choose actions, receive rewards based on their own actions and those of the other players. Example,
More informationECON322 Game Theory Half II
ECON322 Game Theory Half II Part 1: Reasoning Foundations Rationality Christian W. Bach University of Liverpool & EPICENTER Agenda Introduction Rational Choice Strict Dominance Characterization of Rationality
More informationIntroduction to game theory LECTURE 2
Introduction to game theory LECTURE 2 Jörgen Weibull February 4, 2010 Two topics today: 1. Existence of Nash equilibria (Lecture notes Chapter 10 and Appendix A) 2. Relations between equilibrium and rationality
More informationEcon 101A Final exam May 14, 2013.
Econ 101A Final exam May 14, 2013. Do not turn the page until instructed to. Do not forget to write Problems 1 in the first Blue Book and Problems 2, 3 and 4 in the second Blue Book. 1 Econ 101A Final
More informationFDPE Microeconomics 3 Spring 2017 Pauli Murto TA: Tsz-Ning Wong (These solution hints are based on Julia Salmi s solution hints for Spring 2015.
FDPE Microeconomics 3 Spring 2017 Pauli Murto TA: Tsz-Ning Wong (These solution hints are based on Julia Salmi s solution hints for Spring 2015.) Hints for Problem Set 2 1. Consider a zero-sum game, where
More informationGame Theory. Wolfgang Frimmel. Repeated Games
Game Theory Wolfgang Frimmel Repeated Games 1 / 41 Recap: SPNE The solution concept for dynamic games with complete information is the subgame perfect Nash Equilibrium (SPNE) Selten (1965): A strategy
More informationNotes on Game Theory Debasis Mishra October 29, 2018
Notes on Game Theory Debasis Mishra October 29, 2018 1 1 Games in Strategic Form A game in strategic form or normal form is a triple Γ (N,{S i } i N,{u i } i N ) in which N = {1,2,...,n} is a finite set
More informationG5212: Game Theory. Mark Dean. Spring 2017
G5212: Game Theory Mark Dean Spring 2017 Bargaining We will now apply the concept of SPNE to bargaining A bit of background Bargaining is hugely interesting but complicated to model It turns out that the
More informationarxiv: v1 [cs.gt] 12 Jul 2007
Generalized Solution Concepts in Games with Possibly Unaware Players arxiv:0707.1904v1 [cs.gt] 12 Jul 2007 Leandro C. Rêgo Statistics Department Federal University of Pernambuco Recife-PE, Brazil e-mail:
More informationSolution to Tutorial 1
Solution to Tutorial 1 011/01 Semester I MA464 Game Theory Tutor: Xiang Sun August 4, 011 1 Review Static means one-shot, or simultaneous-move; Complete information means that the payoff functions are
More informationEpistemic Game Theory
Epistemic Game Theory Lecture 1 ESSLLI 12, Opole Eric Pacuit Olivier Roy TiLPS, Tilburg University MCMP, LMU Munich ai.stanford.edu/~epacuit http://olivier.amonbofis.net August 6, 2012 Eric Pacuit and
More informationEcon 711 Homework 1 Solutions
Econ 711 Homework 1 s January 4, 014 1. 1 Symmetric, not complete, not transitive. Not a game tree. Asymmetric, not complete, transitive. Game tree. 1 Asymmetric, not complete, transitive. Not a game tree.
More informationSolution to Tutorial /2013 Semester I MA4264 Game Theory
Solution to Tutorial 1 01/013 Semester I MA464 Game Theory Tutor: Xiang Sun August 30, 01 1 Review Static means one-shot, or simultaneous-move; Complete information means that the payoff functions are
More informationThis is page 5 Printer: Opaq
9 Mixed Strategies This is page 5 Printer: Opaq The basic idea of Nash equilibria, that is, pairs of actions where each player is choosing a particular one of his possible actions, is an appealing one.
More informationRegret Minimization and Security Strategies
Chapter 5 Regret Minimization and Security Strategies Until now we implicitly adopted a view that a Nash equilibrium is a desirable outcome of a strategic game. In this chapter we consider two alternative
More informationUniversity of Hong Kong
University of Hong Kong ECON6036 Game Theory and Applications Problem Set I 1 Nash equilibrium, pure and mixed equilibrium 1. This exercise asks you to work through the characterization of all the Nash
More informationS 2,2-1, x c C x r, 1 0,0
Problem Set 5 1. There are two players facing each other in the following random prisoners dilemma: S C S, -1, x c C x r, 1 0,0 With probability p, x c = y, and with probability 1 p, x c = 0. With probability
More informationGame Theory with Applications to Finance and Marketing, I
Game Theory with Applications to Finance and Marketing, I Homework 1, due in recitation on 10/18/2018. 1. Consider the following strategic game: player 1/player 2 L R U 1,1 0,0 D 0,0 3,2 Any NE can be
More informationTit for tat: Foundations of preferences for reciprocity in strategic settings
Journal of Economic Theory 136 (2007) 197 216 www.elsevier.com/locate/jet Tit for tat: Foundations of preferences for reciprocity in strategic settings Uzi Segal a, Joel Sobel b, a Department of Economics,
More informationMA200.2 Game Theory II, LSE
MA200.2 Game Theory II, LSE Problem Set 1 These questions will go over basic game-theoretic concepts and some applications. homework is due during class on week 4. This [1] In this problem (see Fudenberg-Tirole
More informationGame Theory Problem Set 4 Solutions
Game Theory Problem Set 4 Solutions 1. Assuming that in the case of a tie, the object goes to person 1, the best response correspondences for a two person first price auction are: { }, < v1 undefined,
More informationG5212: Game Theory. Mark Dean. Spring 2017
G5212: Game Theory Mark Dean Spring 2017 More on Nash Equilibrium So now we know That (almost) all games have a Nash Equilibrium in mixed strategies How to find these equilibria by calculating best responses
More informationGame Theory: Additional Exercises
Game Theory: Additional Exercises Problem 1. Consider the following scenario. Players 1 and 2 compete in an auction for a valuable object, for example a painting. Each player writes a bid in a sealed envelope,
More information