The Rubinstein bargaining game without an exogenous first-mover
|
|
- Clare Rogers
- 5 years ago
- Views:
Transcription
1 The Rubinstein bargaining game without an exogenous first-mover Fernando Branco Universidade Católica Portuguesa First Version: June 2007 This Version: January 2008 Abstract I study the equilibria of a modified Rubinstein alternating offer bargaining game, in which no player is exogenously given a role of first mover Concentrating the analysis in mixed strategy equilibria, I show that delays appear in equilibrium with positive probability If players have similar and low discount factors, the competition is very intense In the limit, with myopic players, they propose in every period and agreement is never reached On the other hand, if discount factors are very different, the more patient player proposes with a higher probability but agreement is faster Anyway, the expected moment of agreement is always above 2, and may be quite large JEL Classification: C72, C78 Please address correspondence to Fernando Branco, Universidade Católica Portuguesa, FCEE, Palma de Cima, Lisboa, Portugal (fbranco@ucppt) A previous version of this paper was presented at the 2007 ASSET Meeting in Padova A grant from Fundação para a Ciência e Tecnologia (POCTI/ECO/13133/98/2001) is gratefully acknowledged
2 1 Introduction In his seminal paper, Rubinstein (1982) considered a dynamic model of bargaining between two players, which alternate in proposing the division of a shrinking pie 1 Quite surprisingly, in Rubinstein s own words, the game has a unique subgame perfect equilibrium The player that starts the bargaining (labelled as player 1) obtains the fraction (1 δ 2 )/(1 δ 1 δ 2 ) of the pie, where δ i is player i s discount factor Hence, the equilibrium division of the pie depends only on the players discount factors and on who starts the bargaining In this note, I study the equilibria of a modified Rubinstein alternating offer bargaining game, in which no player is exogenously given a role of first mover The modified game proceeds as follows In the first period, both players simultaneously select an action, which may either be to propose a division of the pie or the decision of no proposal If one player only proposes a division in the first period, the game will proceed as in the Rubinstein bargaining game: the other player may accept or reject; if he accepts, the division takes place and payoffs are realized; if he rejects, it will be his turn to propose a division in the following period; and so on If neither player or both players propose divisions in the first period, the game advances to the second period, where both players simultaneously select an action (either proposing a division or not proposing) and the game proceeds as described for the previous period I find an interest in this modified Rubinstein bargaining game for several reasons First, the players start the game in symmetric positions relative to the order of moves Second, the players are allowed not only to propose divisions but also to decide on when to make a proposal Third, the model allows for studying the role of discount factors not only on the proposed divisions but also on the decision to propose and the time of agreement Fourth, there are equilibria in which delays happen with positive probability In the following section I develop the analysis of the model First, I provide some general properties of the equilibrium strategies Then, I proceed with the analysis of two cases: I start with the case in which both players have a common discount factor; then, I continue with the case of distinct discount factors 1 In this paper I refer only to the fixed discounting factor sub-family of the model 1
3 2 The analysis of the model There may be many equilibria in the modified Rubinstein bargaining game For example, two of the equilibria correspond to the equilibria in the Rubinstein bargaining game with either player as the first-mover: in a period in which both players can propose, one of the players always proposes and the other player never does it In this note, however, I concentrate the analysis to equilibria in which both players propose divisions with positive probability in every period in which both players have the opportunity to propose To be more precise, I explore equilibria of the following form: In period 1, with probability α i player i proposes x i for him and 1 x i for the other player, and with probability 1 α i player i does not present a proposal; If a single player has proposed in period 1, the game will proceed as in the Rubinstein alternating offer bargaining game; Otherwise, the game moves to the period 2, and with probability α i player i proposes x i for him and (1 x i ) for the other player, and with probability 1 α i player i does not present a proposal; The game continues as in the previous period I first characterization of the equilibrium strategies is provided in the following proposition Proposition 1 In any equilibrium, within the class analyzed, the divisions proposed by player i are the same as the divisions proposed in the equilibrium of the Rubinstein alternating offer bargaining game I find useful to think about this result in the following way In the beginning of a period in which a player is allowed to propose a division, he has a two step decision: first, he needs to decide whether or not he wants to propose a division; second, if proposing, he needs to decide which division to propose But, his proposal in a given period will only be payoff relevant if it is the unique proposal, and from that moment on the game follows as the Rubinstein alternating offer bargaining game So, in this second step, the player faces exactly the same trade-offs he faces in 2
4 the Rubinstein alternating offer bargaining game Therefore, in equilibrium, the divisions proposed are the ones proposed in the equilibrium of the Rubinstein alternating offer bargaining game I continue the analysis by separating the case in which the players have a common discount factor and that in which they have different discount factors 21 The common discount factor case I consider first the case in which both players have the same discount factor, δ Following Proposition 1, in any equilibrium, whenever a player proposes a division, he proposes a share x = 1/(1+δ) of the pie for himself, leaving the remaining share 1 x = δ/(1 + δ) for the other player If he is the unique player proposing a division in that period, such a division will immediately be accepted by the other player I will look at mixed strategy equilibria, in which, in all periods when both players are allowed to propose a division, player i will make an offer with probability α i (0, 1) Proposition 2 There is a unique equilibrium in (strictly) mixed strategies: in any period in which both players can propose a division, each player proposes a share x = 1/(1 + δ) of the pie for himself, with probability α = 1 + 4δ 1 2δ The first issue to remark is that the players will propose a division with the same probability, ie, there are no (strictly) mixed strategy equilibria in which the players use different probabilities In this equilibrium each player proposes a division with a probability that varies monotonically α δ Figure 1: Probability of proposing a division 3
5 between 1 and ( 5 1)/2, as δ goes from 0 to 1 (see Figure 1) Hence, the more patient the players are, the lower is the probability that any player proposes a division The equilibrium expected payoff of each player, π is given by: π = 1 + 2δ 1 + 4δ ( δ(1 + δ) 3 ), 1 + 4δ which monotonically varies between 0 and 05, as δ goes from 0 to 1 (see Figure 2) π δ Figure 2: Expected payoff It is also possible to compute the probability of agreement in the current period, conditional on having reached that period, β, which is: β = 2α (1 α ) = (1 + δ) 1 + 4δ (1 + 3δ) δ 2 This probability varies monotonically between 0 and 2 5 4, as δ goes from 0 to 1 Hence, the probability of agreement in the current period, conditional on not having an agreement before, is greater as the players get more patient, but it is always below 05 (see Figure 3) β Figure 3: Probability of agreement in the current period δ 4
6 Therefore, delays in reaching an agreement are highly probable Indeed the period of agreement is a random variable with a geometric distribution Some cases, for several values of δ, are depicted in Figure 4 P ro b a b i l i t y o f a g re e m en t Period Figure 4: Probability of agreement in each period ( δ = 01; δ = 05; δ = 09) Agreement is faster for more patient players This is nicely captured by the determination of the expected moment of agreement: E {T } = 1 β = δ 2 (1 + δ) 1 + 4δ (1 + 3δ), which monotonically varies from + to 1/(2 5 4), as δ goes from 0 to 1 (see Figure 5) Hence, the expected agreement moment is lowered as the discount factor increases (more patient players), but it is always above two periods E {T } δ Figure 5: Expected agreement period The results in this subsection can be read in terms of the intensity of competition between 5
7 the two players In one extreme case, if the players are myopic (δ = 0), they will be driven to a Bertrand-like competition: both players will propose a division in every moment; there is never an agreement; and their payoffs are zero As the players become more patient the competition becomes less intense Nevertheless, even for infinitely patient players, their are delays in the agreement, which comes on average after moment 2, which however does not affect the expected payoff, which is equal to The distinct commonly known discount factor case Suppose now that the two players have distinct discount factors (δ i is player s i discount factor) From Proposition 1, we know that, when proposing a division, player i will ask for a share x i = (1 δ j )/(1 δ i δ j ) of the pie for himself, leaving the remaining share 1 x i = δ j(1 δ i )/(1 δ i δ j ) for player j I now look for a mixed strategy equilibrium, in which in periods when both players are allowed to propose a division, player i will propose with probability α i characterizes such equilibrium (0, 1) The following Proposition Proposition 3 There is a unique equilibrium in (strictly) mixed strategies: in any period in which both players can propose a division, player i proposes a share x i = (1 δ j)/(1 δ i δ j ) of the pie for himself, with probability α i = 1 + 4δj 1 2δ j The expression for α i factor analyzed in Subsection 21 is a generalization of the expression obtained for the common discount The probability that a player proposes a division in the current period, depends on the other player s discount factor: the more patient the other player is the lower the probability of proposing a division Hence, the most patient player will be more likely to propose a division, ie, if δ 1 > δ 2, then α1 > α 2 (see Figure 6) The expected equilibrium payoff of player i is given by: π i = (1 δ j)(1 + 2δ i 1 + 4δ i ) δ i (1 δ i δ j )( δ i ), 6
8 α i α 1 with δ 2 = 01 α 1 with δ 2 = 025 α 1 with δ 2 = 05 α 1 with δ 2 = 075 α 2 δ 1 Figure 6: Probability of proposing a division which was derived in the proof of Proposition 3 The expected payoff increases in the player s own discount factor and decreases in the other player s discount factor In fact: Given δ 2 1, πi varies continuously from 0 to 1 as δ 1 goes from 0 to 1 2 Given δ i, πi varies from (1 + 2δ i 1 + 4δ i )/(δ i ( δ i )) to 0 as δ 2 goes from 0 to 1 δ π1 = 01 π1 = 02 π1 = 035 π1 = δ 1 Figure 7: Expected payoff of player i Hence, the most patient player will get a higher expected payoff The evolution of π 1 and π 2 for some values of the parameters is depicted in Figure There is a discontinuity if δ 2 = 1, in which case π i = 0, except that π i = 05 if δ 1 = 1 3 The dashed curves are π 2 s iso-level curves for the values 01, 02, 035 and 055 Note that for the same value π 1 and π 2 the iso-level curves intersect on the diagonal 7
9 It is also possible to compute the probability of agreement in the current period, conditional on having reached that period, β, which is: β = α 1(1 α 2) + α 2(1 α 1) = 1 + 4δ δ δ δ δ 2 2δ 1 2δ δ δ2 1 2δ 2 β δj = 09 δ j = 05 δ j = 01 Figure 8: Probability of agreement in the current period This probability varies monotonically between 0 and 2 5 4, as δ goes from 0 to 1 Its evolution is depicted in Figure 8, for several values of the discount factors The probability of an agreement in the current period increases in both discount factors Hence, when either player becomes more patient the probability of agreement in the current period increases δ i The expected moment of agreement decreases in both discount factors player becomes more patient the agreement is faster in expectation 120 Hence, when either E {T } δ j = 01 δ j = δ j = Figure 9: Expected agreement moment δ i 8
10 3 Conclusion In this note, I studied equilibria of a modified Rubinstein alternating offer bargaining game, in which no player is exogenously given a role of first mover Hence, right from the first period, any player may decide to propose a division of the pie While none or both players propose a division, there is no agreement and the game proceeds to the following period with a similar round of possible proposals When, in a given period, a single player proposes a division, the game continues as in the Rubinstein bargaining game I concentrated the analysis of the model in mixed strategy equilibria in which players propose a division with the same probability in any period in which both players are allowed to propose a division In equilibrium, whenever allowed, a player proposes a division with strictly positive probability Therefore, delays in reaching the agreement happen in equilibrium The expected moment of agreement is greater than 2, and may be quite large for small discount factors If both players are very patient, the probabilities that each will propose a division in the initial period are lower Hence, agreement is faster and payoffs are higher On the other extreme, if both players are (close to) myopic, the probabilities that each will propose a division grows to approach 1 Agreements are delayed and payoffs are lower In the limit, as players do not value the future, a Bertrand-like competition emerges: both players propose divisions in every period and there is never an agreement When the game is played by players with different discount values, the more patient player will be more likely to propose a division in the initial period and he earns a higher expected payoff There may exist other equilibria in the game The characterization of other equilibria will be the next step in this note All the analysis in this note has been done under complete information The next step in this research will be to analyze the model if players are privately informed about their discount factors Appendix: Proofs Proof of Proposition 1 The proof is straightforward 9
11 Proof of Proposition 2 Suppose that player 2 behaves in the assumed way If player 1 proposes a division in period 1, his expected payoff will be: (1 α2)x + α2δπ 1 If, instead, player 1 decides not to propose a division in period 1, his expected payoff will be: α 2(1 x ) + (1 α 2)δπ 1 Hence, player 1 will be indifferent between the two choices in period 1, if and only if: (1 α2)x + α2δπ 1 = π1 α2(1 x ) + (1 α2)δπ 1 = π1 Solving this system of equations in order to α 2 one obtains a unique solution in (0, 1): α 2 = 1 + 4δ 1 2δ Hence, if α 2 = ( 1 + 4δ 1)/(2δ), player 1 will be willing to randomize over whether to propose a division of not to The problem of player 2 is similar to the problem of player 1 Therefore, it can be concluded that the equilibrium is unique, and that each player while both players are allowed to propose a division, both will propose the share x = 1/(1 + δ) of the pie for himself, with probability α = 1+4δ 1 2δ Proof of Proposition 3 Denote by πi the equilibrium payoff of player i in such an equilibrium The equilibrium payoffs associated to each choice in period 1 are presented in the following table: 4 4 This table should not be confused with a payoff matrix of a strategic form game 10
12 Player 2 Player 1 Offer Offer δ 1 π 1, δ 2π 2 No offer No offer 1 δ 2, δ 2(1 δ 1 ) 1 δ 1 δ 2 1 δ 1 δ 2 δ 1 (1 δ 2 ) 1 δ 1, δ 1 π1 1 δ 1 δ 2 1 δ 1 δ, δ 2π2 2 The values of α j and π i can be determined jointly from the following conditions: αjδ i πi + (1 αj) 1 δ j = πi 1 δ i δ j αj δ i (1 δ j ) + (1 α 1 δ i δ j)δ i πi = πi j The conditions to determine α i and π j are similar Solving these conditions one obtains: 1 + αi 4δj 1 = 2δ j πi = (1 δ j)(1 + 2δ i 1 + 4δ i ) δ i (1 δ i δ j )( δ i ) References Rubinstein, A (1982) Perfect Equilibrium in a Bargaining Game, Econometrica, 50(1),
Multi-Agent Bilateral Bargaining and the Nash Bargaining Solution
Multi-Agent Bilateral Bargaining and the Nash Bargaining Solution Sang-Chul Suh University of Windsor Quan Wen Vanderbilt University December 2003 Abstract This paper studies a bargaining model where n
More informationStrategic Bargaining. This is page 1 Printer: Opaq
16 This is page 1 Printer: Opaq Strategic Bargaining The strength of the framework we have developed so far, be it normal form or extensive form games, is that almost any well structured game can be presented
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 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 informationGOLDEN AND SILVER RATIOS IN BARGAINING
GOLDEN AND SILVER RATIOS IN BARGAINING KIMMO BERG, JÁNOS FLESCH, AND FRANK THUIJSMAN Abstract. We examine a specific class of bargaining problems where the golden and silver ratios appear in a natural
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 informationECON 301: Game Theory 1. Intermediate Microeconomics II, ECON 301. Game Theory: An Introduction & Some Applications
ECON 301: Game Theory 1 Intermediate Microeconomics II, ECON 301 Game Theory: An Introduction & Some Applications You have been introduced briefly regarding how firms within an Oligopoly interacts strategically
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 informationGames in Extensive Form, Backward Induction, and Subgame Perfection:
Econ 460 Game Theory Assignment 4 Games in Extensive Form, Backward Induction, Subgame Perfection (Ch. 14,15), Bargaining (Ch. 19), Finitely Repeated Games (Ch. 22) Games in Extensive Form, Backward Induction,
More informationECON 312: Games and Strategy 1. Industrial Organization Games and Strategy
ECON 312: Games and Strategy 1 Industrial Organization Games and Strategy A Game is a stylized model that depicts situation of strategic behavior, where the payoff for one agent depends on its own actions
More informationStability of Cartels in Multi-market Cournot Oligopolies
Stability of artels in Multi-market ournot Oligopolies Subhadip hakrabarti Robert P. Gilles Emiliya Lazarova April 2017 That cartel formation among producers in a ournot oligopoly may not be sustainable
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 informationBargaining and Reputation with Ultimatums
Bargaining and Reputation with Ultimatums Mehmet Ekmekci 1 Hanzhe Zhang 2 1 Boston College 2 Michigan State University Monday, November 19, 2018 Southern Economic Association - http://www.msu.edu/ hanzhe/
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 informationGame Theory and Economics of Contracts Lecture 4 Basics in Game Theory (2)
Game Theory and Economics of Contracts Lecture 4 Basics in Game Theory (2) Yu (Larry) Chen School of Economics, Nanjing University Fall 2015 Extensive Form Game I It uses game tree to represent the games.
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 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 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 informationTopic 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 informationBargaining Games. An Application of Sequential Move Games
Bargaining Games An Application of Sequential Move Games The Bargaining Problem The Bargaining Problem arises in economic situations where there are gains from trade, for example, when a buyer values an
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 informationGame Theory -- Lecture 6. Patrick Loiseau EURECOM Fall 2016
Game Theory -- Lecture 6 Patrick Loiseau EURECOM Fall 06 Outline. Stackelberg duopoly and the first mover s advantage. Formal definitions 3. Bargaining and discounted payoffs Outline. Stackelberg duopoly
More informationBargaining games. Felix Munoz-Garcia. EconS Strategy and Game Theory Washington State University
Bargaining games Felix Munoz-Garcia EconS 424 - Strategy and Game Theory Washington State University Bargaining Games Bargaining is prevalent in many economic situations where two or more parties negotiate
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 informationECO 199 B GAMES OF STRATEGY Spring Term 2004 B February 24 SEQUENTIAL AND SIMULTANEOUS GAMES. Representation Tree Matrix Equilibrium concept
CLASSIFICATION ECO 199 B GAMES OF STRATEGY Spring Term 2004 B February 24 SEQUENTIAL AND SIMULTANEOUS GAMES Sequential Games Simultaneous Representation Tree Matrix Equilibrium concept Rollback (subgame
More informationNon-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 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 informationDEPARTMENT OF ECONOMICS WORKING PAPER SERIES. Stable Networks and Convex Payoffs. Robert P. Gilles Virginia Tech University
DEPARTMENT OF ECONOMICS WORKING PAPER SERIES Stable Networks and Convex Payoffs Robert P. Gilles Virginia Tech University Sudipta Sarangi Louisiana State University Working Paper 2005-13 http://www.bus.lsu.edu/economics/papers/pap05_13.pdf
More informationPROBLEM SET 1 1. (Geanokoplos, 1992) Imagine three girls sitting in a circle, each wearing either a red hat or a white hat. Each girl can see the colo
PROBLEM SET 1 1. (Geanokoplos, 1992) Imagine three girls sitting in a circle, each wearing either a red hat or a white hat. Each girl can see the color of the hat of the other two girls, but not the color
More informationDynamic Games of Complete Information
Dynamic Games of Complete Information Dynamic Games of Complete and Perfect Information F. Valognes - Game Theory - Chp 13 1 Outline of dynamic games of complete information Dynamic games of complete information
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 informationPROBLEM SET Explain the difference between mutual knowledge and common knowledge.
PROBLEM SET 1 1. Define Pareto Optimality. 2. Explain the difference between mutual knowledge and common knowledge. 3. Define strategy. Why is it possible for a player in a sequential game to have more
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 informationNORMAL 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 informationFinance Solutions to Problem Set #8: Introduction to Game Theory
Finance 30210 Solutions to Problem Set #8: Introduction to Game Theory 1) Consider the following version of the prisoners dilemma game (Player one s payoffs are in bold): Cooperate Cheat Player One Cooperate
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 informationEconS Sequential Move Games
EconS 425 - Sequential Move Games Eric Dunaway Washington State University eric.dunaway@wsu.edu Industrial Organization Eric Dunaway (WSU) EconS 425 Industrial Organization 1 / 57 Introduction Today, we
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 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 informationSF2972 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 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 informationFebruary 11, 2015 :1 +0 (1 ) = :2 + 1 (1 ) =3 1. is preferred to R iff
February 11, 2015 Example 60 Here s a problem that was on the 2014 midterm: Determine all weak perfect Bayesian-Nash equilibria of the following game. Let denote the probability that I assigns to being
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 informationAsynchronous 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 informationUltimatum Bargaining. James Andreoni Econ 182
1 Ultimatum Bargaining James Andreoni Econ 182 3 1 Demonstration: The Proposer-Responder Game 4 2 Background: Nash Equilibrium Example Let's think about how we make a prediction in this game: Each Player
More informationPROBLEM SET 1 1. (Geanokoplos, 1992) Imagine three girls sitting in a circle, each wearing either a red hat or a white hat. Each girl can see the colo
PROBLEM SET 1 1. (Geanokoplos, 1992) Imagine three girls sitting in a circle, each wearing either a red hat or a white hat. Each girl can see the color of the hat of the other two girls, but not the color
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 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 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 informationVariations on the Two Envelopes Problem
Variations on the Two Envelopes Problem Panagiotis Tsikogiannopoulos pantsik@yahoo.gr Abstract There are many papers written on the Two Envelopes Problem that usually study some of its variations. In this
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 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 information/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 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 informationSimultaneous-Move Games: Mixed Strategies. Games Of Strategy Chapter 7 Dixit, Skeath, and Reiley
Simultaneous-Move Games: Mixed Strategies Games Of Strategy Chapter 7 Dixit, Skeath, and Reiley Terms to Know Expected Payoff Opponent s Indifference Property Introductory Game The professor will assign
More informationFinite 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 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 informationSignaling Games
46. Signaling Games 3 This is page Printer: Opaq Building a eputation 3. Driving a Tough Bargain It is very common to use language such as he has a reputation for driving a tough bargain or he s known
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 informationIncentives and Game Theory
April 15, 2010 This work is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike 3.0 License. Putting Utilitarianism to Work Example Suppose that you and your roomate are considering
More information. Introduction to Game Theory Lecture Note 4: Extensive-Form Games and Subgame Perfect Equilibrium. HUANG Haifeng University of California, Merced
.. Introduction to Game Theory Lecture Note 4: Extensive-Form Games and Subgame Perfect Equilibrium HUANG Haifeng University of California, Merced Extensive games with perfect information What we have
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 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 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 informationSupplementary Appendix Commitment and (In)Efficiency: a Bargaining Experiment
Supplementary Appendix Commitment and (In)Efficiency: a Bargaining Experiment Marina Agranov Matt Elliott July 28, 2016 This document contains supporting material for the document Commitment and (In)Efficiency:
More informationStrategic delegation: An experiment
RAND Journal of Economics Vol. 32, No. 2, Summer 2001 pp. 352 368 Strategic delegation: An experiment Chaim Fershtman and Uri Gneezy We examine the effects of strategic delegation in a simple ultimatum
More informationPerfect Bayesian Equilibrium
Perfect Bayesian Equilibrium When players move sequentially and have private information, some of the Bayesian Nash equilibria may involve strategies that are not sequentially rational. The problem is
More informationTurn-Taking in Finitely Repeated Symmetric Games: Experimental Evidence
Turn-Taking in Finitely Repeated Symmetric Games: Experimental Evidence H. Sibly, J. Tisdell & S. Evans May 8, Abstract In this paper we investigate the emergence of turn taking in three finitely repeated
More informationVeronika Grimm, Friederike Mengel. An Experiment on Learning in a Multiple Games Environment RM/09/007
Veronika Grimm, Friederike Mengel An Experiment on Learning in a Multiple Games Environment RM/09/007 An Experiment on Learning in a Multiple Games Environment Veronika Grimm University of Erlangen Nuremberg
More informationDoes strategy fairness make inequality more acceptable? by Mengjie Wang*
CBESS Discussion Paper 17-08 Does strategy fairness make inequality more acceptable? by Mengjie Wang* * School of Economics, CCP and CBESS, University of East Anglia Abstract This paper proposes a new
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 informationIntroduction to Industrial Organization Professor: Caixia Shen Fall 2014 Lecture Note 6 Games and Strategy (ch.4)-continue
Introduction to Industrial Organization Professor: Caixia Shen Fall 014 Lecture Note 6 Games and Strategy (ch.4)-continue Outline: Modeling by means of games Normal form games Dominant strategies; dominated
More informationGames of Perfect Information and Backward Induction
Games of Perfect Information and Backward Induction Economics 282 - Introduction to Game Theory Shih En Lu Simon Fraser University ECON 282 (SFU) Perfect Info and Backward Induction 1 / 14 Topics 1 Basic
More informationExtensive Form Games. Mihai Manea MIT
Extensive Form Games Mihai Manea MIT Extensive-Form Games N: finite set of players; nature is player 0 N tree: order of moves payoffs for every player at the terminal nodes information partition actions
More informationOn Patent Licensing in Spatial Competition
Department of Economics Working Paper No. 01 http://www.fas.nus.edu.sg/ecs/pub/wp/wp01.pdf On Patent Licensing in Spatial Competition Sougata Poddar National University of Singapore Uday hanu Sinha Indian
More informationName. Midterm, Econ 171, February 27, 2014
Name Midterm, Econ 171, February 27, 2014 There are 6 questions. Answer as many as you can. Good luck! Problem 1. Two players, A and B, have a chance to contribute effort to supplying a resource that is
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 informationComputational aspects of two-player zero-sum games Course notes for Computational Game Theory Section 3 Fall 2010
Computational aspects of two-player zero-sum games Course notes for Computational Game Theory Section 3 Fall 21 Peter Bro Miltersen November 1, 21 Version 1.3 3 Extensive form games (Game Trees, Kuhn Trees)
More information4. Game Theory: Introduction
4. Game Theory: Introduction Laurent Simula ENS de Lyon L. Simula (ENSL) 4. Game Theory: Introduction 1 / 35 Textbook : Prajit K. Dutta, Strategies and Games, Theory and Practice, MIT Press, 1999 L. Simula
More informationECO 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 informationState Math Contest Junior Exam SOLUTIONS
State Math Contest Junior Exam SOLUTIONS 1. The following pictures show two views of a non standard die (however the numbers 1-6 are represented on the die). How many dots are on the bottom face of figure?
More informationChapter 1. The alternating groups. 1.1 Introduction. 1.2 Permutations
Chapter 1 The alternating groups 1.1 Introduction The most familiar of the finite (non-abelian) simple groups are the alternating groups A n, which are subgroups of index 2 in the symmetric groups S n.
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 informationDynamic 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 informationIntroduction to Game Theory
Introduction to Game Theory Part 2. Dynamic games of complete information Chapter 4. Dynamic games of complete but imperfect information Ciclo Profissional 2 o Semestre / 2011 Graduação em Ciências Econômicas
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 informationBasic Solution Concepts and Computational Issues
CHAPTER asic Solution Concepts and Computational Issues Éva Tardos and Vijay V. Vazirani Abstract We consider some classical games and show how they can arise in the context of the Internet. We also introduce
More informationGame 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 informationNormal 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 informationBS2243 Lecture 3 Strategy and game theory
BS2243 Lecture 3 Strategy and game theory Spring 2012 (Dr. Sumon Bhaumik) Based on: Rasmusen, Eric (1992) Games and Information, Oxford, UK and Cambridge, Mass.: Blackwell; Chapters 1 & 2. Games what are
More informationThe tenure game. The tenure game. Winning strategies for the tenure game. Winning condition for the tenure game
The tenure game The tenure game is played by two players Alice and Bob. Initially, finitely many tokens are placed at positions that are nonzero natural numbers. Then Alice and Bob alternate in their moves
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 informationPortugal Mapping ICT R&D & Innovation
Portugal Mapping ICT R&D & Innovation Daniel Ferreira Department for the Information Society Fundação para a Ciência e a Tecnologia 21.10.2015 About the project What is this project about? Who is carrying
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 informationSolutions to the problems from Written assignment 2 Math 222 Winter 2015
Solutions to the problems from Written assignment 2 Math 222 Winter 2015 1. Determine if the following limits exist, and if a limit exists, find its value. x2 y (a) The limit of f(x, y) = x 4 as (x, y)
More informationConstructions of Coverings of the Integers: Exploring an Erdős Problem
Constructions of Coverings of the Integers: Exploring an Erdős Problem Kelly Bickel, Michael Firrisa, Juan Ortiz, and Kristen Pueschel August 20, 2008 Abstract In this paper, we study necessary conditions
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 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 informationDice Games and Stochastic Dynamic Programming
Dice Games and Stochastic Dynamic Programming Henk Tijms Dept. of Econometrics and Operations Research Vrije University, Amsterdam, The Netherlands Revised December 5, 2007 (to appear in the jubilee issue
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 information