DOCSLIB.ORG

Production Games

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Production Games Production game Strategic Production Game1 Consider two firms, which have to make production decisions without knowing what the other is doing. For simplicity we shall suppose that the product is essentially identical. If outputs levels are qq12and so = + that the total supply is q q1 q2 , the market-clearing price is =− =− + p abqabqq()12 = Firm i has a production cost of Ccqiii. Then if firm 2 produces q2 , firm 1’s profit is Π=−=−−−2 112(,q q ) pq 1 c 11 q ( a c 1 bq 21 ) q bq 1 Next differentiating firm 1's profit by q1 , ∂Π 1 =−−()22[()/2]a c bq − bq = b a −− c bq b − q ∂ 12 1 12 1 q1 ∂Π Hence 1 ==−−0ifqacbqb ( )/2 ∂ 112 q1 Best response: ∂Π Choose output such that marginal profit 1 is zero. ∂ q1 B =−− BR1 : qacbqb112()/2 Similarly for player 2: B =−− BR2 : qacbqb221()/2 1 The earliest discussion of this game goes all the way back to Augustin Cournot (1848). 1 Production game q2 BR1 − E ()/2ac2 b BR2 q ()/ac− b 1 ()/2ac− b 2 1 Figure E-2: Best responses For equilibrium, BR =−− = BR1 : qacbqbq1121()/2 Similarly for player 2: BR =−− = BR2 : qacbqbq2212()/2 Rearranging, +=− × +=− 2bq12 bq a c 1 2 42bq12 bq 2() a c 1 and +=− × +=− qbqac122 2 1 qbqac122 2 =−−− Subtracting: 32()()bq112 ac ac =− − − Arguing symmetrically: 3()2()bqac21 ac 2 +=11 −−− Dividing by 3 and summing: bq()()()12 q33 a c 1 a c 2 =− + =11 + + 1 Then the equilibrium price p abqq()1233 a c 1 3 c 2 2 Production game Sequential rather than simultaneous play The oligopoly game is a natural one to use to introduce games in which moves are sequential, rather than simultaneous. (The classic childhood sequential game is 0’s and X’s or tic-tac-toe) If firms are very similar in size, the simultaneous model is more likely to be appropriate. However, when one firm is larger, or the incumbent, it may be in a position to make the first move, leaving other firms to follow. What should the first mover do? RULE : Look ahead and work backwards Once firm 1 has made its move, firm 2 simply gets to maximize profit conditional upon firm 1’s move. That is, it will choose its best response: * =−− qacbqb221()/2 (Best Response by firm 2) has the same best response rule as before, firm 1 is not simply responding to firm 2’s choice. Suppose that firm 1 initially chooses the same output as in the simultaneous move game. Then the outcome is the point E in the figure. But firm 1 knows that firm 2 will choose a response along the heavy response curve. Thus firm 1 optimizes by picking the most profitable point on this curve. As depicted it is the point A. Example: ==== abcc100, 1,12 10. Simultaneous moves: * =−− = − BR1 : qacbqb212( )/2 (90 q 2 )/2 * =−− = − BR2 : qacbqb221( )/2 (90 q 1 )/2 == Solving, qq1230 Sequential moves: * =−− = − BR2 : qacbqb221( )/2 (90 q 1 )/2 3 Production game =− + = −BR − p abqq()100()12 q 21 q q 1 Π= − = − = − −BR − 111pqcqpcq()(100()) 1 cqq 2111 qq Use the product rule ddqΠ BR 12== − −BR − − − (100cq21 ( q ) q 1 ) 1 dq11 dq Note that the best response is a decreasing function of q1 . Thus the second last term is positive and so the gain to increasing output is larger than in the simultaneous game. Proposition: Comparison with the simultaneous move game The first mover thus produces more. The best response by the second mover is to produce less. Example: =− + = − +11 − = − p abqq(12 ) 100 ( q 122 (90 q 1 ) 55 q 1 Π= − = − = −1 111pqcqpcq()(45) 12 qq 11. Differentiating, ∂Π =−45 q . Thus q* = 45 and qq* =−(90 ) / 2 = 22.5 ∂ 1 1 21 q1 4 Production game Entry Game Incumbent monopolist and a potential entrant. Incumbents payoffs indicated first. Entrant (6,0) Stay out Come In Incumbent Fight Share (1,-2) (2,2) Nash equilibrium 1: Incumbent announces that he will fight if there is entry. Entrant’s BR is to choose OUT. Given that Entrant stays OUT, the strategy FIGHT is a BR for the Incumbent. Nash equilibrium 2: Entrant believes Incumbent will share. Then BR is COME IN. Given that Entrant does come in, Incumbent’s BR is SHARE. Which equilibrium is more plausible? If you look down the tree and ask what each player would actually do at a decision node, one equilibrium is eliminated “Perfect Nash Equilibrium” (or Sub-game Perfect Nash Equilibrium) 5.
Load more

Recommended publications
  • Labsi Working Papers
    UNIVERSITY OF SIENA S.N. O’ H iggins Arturo Palomba Patrizia Sbriglia Second Mover Advantage and Bertrand Dynamic Competition: An Experiment May 2010 LABSI WORKING PAPERS N. 28/2010 SECOND MOVER ADVANTAGE AND BERTRAND DYNAMIC COMPETITION: AN EXPERIMENT § S.N. O’Higgins University of Salerno [email protected] Arturo Palomba University of Naples II [email protected] Patrizia Sbriglia §§ University of Naples II [email protected] Abstract In this paper we provide an experimental test of a dynamic Bertrand duopolistic model, where firms move sequentially and their informational setting varies across different designs. Our experiment is composed of three treatments. In the first treatment, subjects receive information only on the costs and demand parameters and on the price’ choices of their opponent in the market in which they are positioned (matching is fixed); in the second and third treatments, subjects are also informed on the behaviour of players who are not directly operating in their market. Our aim is to study whether the individual behaviour and the process of equilibrium convergence are affected by the specific informational setting adopted. In all treatments we selected students who had previously studied market games and industrial organization, conjecturing that the specific participants’ expertise decreased the chances of imitation in treatment II and III. However, our results prove the opposite: the extra information provided in treatment II and III strongly affects the long run convergence to the market equilibrium. In fact, whilst in the first session, a high proportion of markets converge to the Nash-Bertrand symmetric solution, we observe that a high proportion of markets converge to more collusive outcomes in treatment II and more competitive outcomes in treatment III.
    [Show full text]
  • 1 Sequential Games
    1 Sequential Games We call games where players take turns moving “sequential games”. Sequential games consist of the same elements as normal form games –there are players, rules, outcomes, and payo¤s. However, sequential games have the added element that history of play is now important as players can make decisions conditional on what other players have done. Thus, if two people are playing a game of Chess the second mover is able to observe the …rst mover’s initial move prior to making his initial move. While it is possible to represent sequential games using the strategic (or matrix) form representation of the game it is more instructive at …rst to represent sequential games using a game tree. In addition to the players, actions, outcomes, and payo¤s, the game tree will provide a history of play or a path of play. A very basic example of a sequential game is the Entrant-Incumbent game. The game is described as follows: Consider a game where there is an entrant and an incumbent. The entrant moves …rst and the incumbent observes the entrant’sdecision. The entrant can choose to either enter the market or remain out of the market. If the entrant remains out of the market then the game ends and the entrant receives a payo¤ of 0 while the incumbent receives a payo¤ of 2. If the entrant chooses to enter the market then the incumbent gets to make a choice. The incumbent chooses between …ghting entry or accommodating entry. If the incumbent …ghts the entrant receives a payo¤ of 3 while the incumbent receives a payo¤ of 1.
    [Show full text]
  • Evolutionary Stable Strategy Application of Nash Equilibrium in Biology
    GENERAL ARTICLE Evolutionary Stable Strategy Application of Nash Equilibrium in Biology Jayanti Ray-Mukherjee and Shomen Mukherjee Every behaviourally responsive animal (including us) make decisions. These can be simple behavioural decisions such as where to feed, what to feed, how long to feed, decisions related to finding, choosing and competing for mates, or simply maintaining ones territory. All these are conflict situations between competing individuals, hence can be best understood Jayanti Ray-Mukherjee is using a game theory approach. Using some examples of clas- a faculty member in the School of Liberal Studies sical games, we show how evolutionary game theory can help at Azim Premji University, understand behavioural decisions of animals. Game theory Bengaluru. Jayanti is an (along with its cousin, optimality theory) continues to provide experimental ecologist who a strong conceptual and theoretical framework to ecologists studies mechanisms of species coexistence among for understanding the mechanisms by which species coexist. plants. Her research interests also inlcude plant Most of you, at some point, might have seen two cats fighting. It invasion ecology and is often accompanied with the cats facing each other with puffed habitat restoration. up fur, arched back, ears back, tail twitching, with snarls, growls, Shomen Mukherjee is a and howls aimed at each other. But, if you notice closely, they faculty member in the often try to avoid physical contact, and spend most of their time School of Liberal Studies in the above-mentioned behavioural displays. Biologists refer to at Azim Premji University, this as a ‘limited war’ or conventional (ritualistic) strategy (not Bengaluru. He uses field experiments to study causing serious injury), as opposed to dangerous (escalated) animal behaviour and strategy (Figure 1) [1].
    [Show full text]
  • Finitely Repeated Games
    Repeated games 1: Finite repetition Universidad Carlos III de Madrid 1 Finitely repeated games • A finitely repeated game is a dynamic game in which a simultaneous game (the stage game) is played finitely many times, and the result of each stage is observed before the next one is played. • Example: Play the prisoners’ dilemma several times. The stage game is the simultaneous prisoners’ dilemma game. 2 Results • If the stage game (the simultaneous game) has only one NE the repeated game has only one SPNE: In the SPNE players’ play the strategies in the NE in each stage. • If the stage game has 2 or more NE, one can find a SPNE where, at some stage, players play a strategy that is not part of a NE of the stage game. 3 The prisoners’ dilemma repeated twice • Two players play the same simultaneous game twice, at ! = 1 and at ! = 2. • After the first time the game is played (after ! = 1) the result is observed before playing the second time. • The payoff in the repeated game is the sum of the payoffs in each stage (! = 1, ! = 2) • Which is the SPNE? Player 2 D C D 1 , 1 5 , 0 Player 1 C 0 , 5 4 , 4 4 The prisoners’ dilemma repeated twice Information sets? Strategies? 1 .1 5 for each player 2" for each player D C E.g.: (C, D, D, C, C) Subgames? 2.1 5 D C D C .2 1.3 1.5 1 1.4 D C D C D C D C 2.2 2.3 2 .4 2.5 D C D C D C D C D C D C D C D C 1+1 1+5 1+0 1+4 5+1 5+5 5+0 5+4 0+1 0+5 0+0 0+4 4+1 4+5 4+0 4+4 1+1 1+0 1+5 1+4 0+1 0+0 0+5 0+4 5+1 5+0 5+5 5+4 4+1 4+0 4+5 4+4 The prisoners’ dilemma repeated twice Let’s find the NE in the subgames.
    [Show full text]
  • Game Theory]: Basics of Game Theory
    Artificial Intelligence Methods for Social Good M2-1 [Game Theory]: Basics of Game Theory 08-537 (9-unit) and 08-737 (12-unit) Instructor: Fei Fang [email protected] Wean Hall 4126 1 5/8/2018 Quiz 1: Recap: Optimization Problem Given coordinates of 푛 residential areas in a city (assuming 2-D plane), denoted as 푥1, … , 푥푛, the government wants to find a location that minimizes the sum of (Euclidean) distances to all residential areas to build a hospital. The optimization problem can be written as A: min |푥푖 − 푥| 푥 푖 B: min 푥푖 − 푥 푥 푖 2 2 C: min 푥푖 − 푥 푥 푖 D: none of above 2 Fei Fang 5/8/2018 From Games to Game Theory The study of mathematical models of conflict and cooperation between intelligent decision makers Used in economics, political science etc 3/72 Fei Fang 5/8/2018 Outline Basic Concepts in Games Basic Solution Concepts Compute Nash Equilibrium Compute Strong Stackelberg Equilibrium 4 Fei Fang 5/8/2018 Learning Objectives Understand the concept of Game, Player, Action, Strategy, Payoff, Expected utility, Best response Dominant Strategy, Maxmin Strategy, Minmax Strategy Nash Equilibrium Stackelberg Equilibrium, Strong Stackelberg Equilibrium Describe Minimax Theory Formulate the following problem as an optimization problem Find NE in zero-sum games (LP) Find SSE in two-player general-sum games (multiple LP and MILP) Know how to find the method/algorithm/solver/package you can use for solving the games Compute NE/SSE by hand or by calling a solver for small games 5 Fei Fang 5/8/2018 Let’s Play! Classical Games
    [Show full text]
  • Collusion Constrained Equilibrium
    Theoretical Economics 13 (2018), 307–340 1555-7561/20180307 Collusion constrained equilibrium Rohan Dutta Department of Economics, McGill University David K. Levine Department of Economics, European University Institute and Department of Economics, Washington University in Saint Louis Salvatore Modica Department of Economics, Università di Palermo We study collusion within groups in noncooperative games. The primitives are the preferences of the players, their assignment to nonoverlapping groups, and the goals of the groups. Our notion of collusion is that a group coordinates the play of its members among different incentive compatible plans to best achieve its goals. Unfortunately, equilibria that meet this requirement need not exist. We instead introduce the weaker notion of collusion constrained equilibrium. This al- lows groups to put positive probability on alternatives that are suboptimal for the group in certain razor’s edge cases where the set of incentive compatible plans changes discontinuously. These collusion constrained equilibria exist and are a subset of the correlated equilibria of the underlying game. We examine four per- turbations of the underlying game. In each case,we show that equilibria in which groups choose the best alternative exist and that limits of these equilibria lead to collusion constrained equilibria. We also show that for a sufficiently broad class of perturbations, every collusion constrained equilibrium arises as such a limit. We give an application to a voter participation game that shows how collusion constraints may be socially costly. Keywords. Collusion, organization, group. JEL classification. C72, D70. 1. Introduction As the literature on collective action (for example, Olson 1965) emphasizes, groups often behave collusively while the preferences of individual group members limit the possi- Rohan Dutta: [email protected] David K.
    [Show full text]
  • Chapter 16 Oligopoly and Game Theory Oligopoly Oligopoly
    Chapter 16 “Game theory is the study of how people Oligopoly behave in strategic situations. By ‘strategic’ we mean a situation in which each person, when deciding what actions to take, must and consider how others might respond to that action.” Game Theory Oligopoly Oligopoly • “Oligopoly is a market structure in which only a few • “Figuring out the environment” when there are sellers offer similar or identical products.” rival firms in your market, means guessing (or • As we saw last time, oligopoly differs from the two ‘ideal’ inferring) what the rivals are doing and then cases, perfect competition and monopoly. choosing a “best response” • In the ‘ideal’ cases, the firm just has to figure out the environment (prices for the perfectly competitive firm, • This means that firms in oligopoly markets are demand curve for the monopolist) and select output to playing a ‘game’ against each other. maximize profits • To understand how they might act, we need to • An oligopolist, on the other hand, also has to figure out the understand how players play games. environment before computing the best output. • This is the role of Game Theory. Some Concepts We Will Use Strategies • Strategies • Strategies are the choices that a player is allowed • Payoffs to make. • Sequential Games •Examples: • Simultaneous Games – In game trees (sequential games), the players choose paths or branches from roots or nodes. • Best Responses – In matrix games players choose rows or columns • Equilibrium – In market games, players choose prices, or quantities, • Dominated strategies or R and D levels. • Dominant Strategies. – In Blackjack, players choose whether to stay or draw.
    [Show full text]
  • Cooperation Spillovers in Coordination Games*
    Cooperation Spillovers in Coordination Games* Timothy N. Casona, Anya Savikhina, and Roman M. Sheremetab aDepartment of Economics, Krannert School of Management, Purdue University, 403 W. State St., West Lafayette, IN 47906-2056, U.S.A. bArgyros School of Business and Economics, Chapman University, One University Drive, Orange, CA 92866, U.S.A. November 2009 Abstract Motivated by problems of coordination failure observed in weak-link games, we experimentally investigate behavioral spillovers for order-statistic coordination games. Subjects play the minimum- and median-effort coordination games simultaneously and sequentially. The results show the precedent for cooperative behavior spills over from the median game to the minimum game when the games are played sequentially. Moreover, spillover occurs even when group composition changes, although the effect is not as strong. We also find that the precedent for uncooperative behavior does not spill over from the minimum game to the median game. These findings suggest guidelines for increasing cooperative behavior within organizations. JEL Classifications: C72, C91 Keywords: coordination, order-statistic games, experiments, cooperation, minimum game, behavioral spillover Corresponding author: Timothy Cason, [email protected] * We thank Yan Chen, David Cooper, John Duffy, Vai-Lam Mui, seminar participants at Purdue University, and participants at Economic Science Association conferences for helpful comments. Any remaining errors are ours. 1. Introduction Coordination failure is often the reason for the inefficient performance of many groups, ranging from small firms to entire economies. When agents’ actions have strategic interdependence, even when they succeed in coordinating they may be “trapped” in an equilibrium that is objectively inferior to other equilibria. Coordination failure and inefficient coordination has been an important theme across a variety of fields in economics, ranging from development and macroeconomics to mechanism design for overcoming moral hazard in teams.
    [Show full text]
  • 570: Minimax Sample Complexity for Turn-Based Stochastic Game
    Minimax Sample Complexity for Turn-based Stochastic Game Qiwen Cui1 Lin F. Yang2 1School of Mathematical Sciences, Peking University 2Electrical and Computer Engineering Department, University of California, Los Angeles Abstract guarantees are rather rare due to complex interaction be- tween agents that makes the problem considerably harder than single agent reinforcement learning. This is also known The empirical success of multi-agent reinforce- as non-stationarity in MARL, which means when multi- ment learning is encouraging, while few theoret- ple agents alter their strategies based on samples collected ical guarantees have been revealed. In this work, from previous strategy, the system becomes non-stationary we prove that the plug-in solver approach, proba- for each agent and the improvement can not be guaranteed. bly the most natural reinforcement learning algo- One fundamental question in MBRL is that how to design rithm, achieves minimax sample complexity for efficient algorithms to overcome non-stationarity. turn-based stochastic game (TBSG). Specifically, we perform planning in an empirical TBSG by Two-players turn-based stochastic game (TBSG) is a two- utilizing a ‘simulator’ that allows sampling from agents generalization of Markov decision process (MDP), arbitrary state-action pair. We show that the em- where two agents choose actions in turn and one agent wants pirical Nash equilibrium strategy is an approxi- to maximize the total reward while the other wants to min- mate Nash equilibrium strategy in the true TBSG imize it. As a zero-sum game, TBSG is known to have and give both problem-dependent and problem- Nash equilibrium strategy [Shapley, 1953], which means independent bound.
    [Show full text]
  • Contemporaneous Perfect Epsilon-Equilibria
    Games and Economic Behavior 53 (2005) 126–140 www.elsevier.com/locate/geb Contemporaneous perfect epsilon-equilibria George J. Mailath a, Andrew Postlewaite a,∗, Larry Samuelson b a University of Pennsylvania b University of Wisconsin Received 8 January 2003 Available online 18 July 2005 Abstract We examine contemporaneous perfect ε-equilibria, in which a player’s actions after every history, evaluated at the point of deviation from the equilibrium, must be within ε of a best response. This concept implies, but is stronger than, Radner’s ex ante perfect ε-equilibrium. A strategy profile is a contemporaneous perfect ε-equilibrium of a game if it is a subgame perfect equilibrium in a perturbed game with nearly the same payoffs, with the converse holding for pure equilibria. 2005 Elsevier Inc. All rights reserved. JEL classification: C70; C72; C73 Keywords: Epsilon equilibrium; Ex ante payoff; Multistage game; Subgame perfect equilibrium 1. Introduction Analyzing a game begins with the construction of a model specifying the strategies of the players and the resulting payoffs. For many games, one cannot be positive that the specified payoffs are precisely correct. For the model to be useful, one must hope that its equilibria are close to those of the real game whenever the payoff misspecification is small. To ensure that an equilibrium of the model is close to a Nash equilibrium of every possible game with nearly the same payoffs, the appropriate solution concept in the model * Corresponding author. E-mail addresses: [email protected] (G.J. Mailath), [email protected] (A. Postlewaite), [email protected] (L.
    [Show full text]
  • Formation of Coalition Structures As a Non-Cooperative Game
    Formation of coalition structures as a non-cooperative game Dmitry Levando, ∗ Abstract We study coalition structure formation with intra and inter-coalition externalities in the introduced family of nested non-cooperative si- multaneous finite games. A non-cooperative game embeds a coalition structure formation mechanism, and has two outcomes: an alloca- tion of players over coalitions and a payoff for every player. Coalition structures of a game are described by Young diagrams. They serve to enumerate coalition structures and allocations of players over them. For every coalition structure a player has a set of finite strategies. A player chooses a coalition structure and a strategy. A (social) mechanism eliminates conflicts in individual choices and produces final coalition structures. Every final coalition structure is a non-cooperative game. Mixed equilibrium always exists and consists arXiv:2107.00711v1 [cs.GT] 1 Jul 2021 of a mixed strategy profile, payoffs and equilibrium coalition struc- tures. We use a maximum coalition size to parametrize the family ∗Moscow, Russian Federation, independent. No funds, grants, or other support was received. Acknowledge: Nick Baigent, Phillip Bich, Giulio Codognato, Ludovic Julien, Izhak Gilboa, Olga Gorelkina, Mark Kelbert, Anton Komarov, Roger Myerson, Ariel Rubinstein, Shmuel Zamir. Many thanks for advices and for discussion to participants of SIGE-2015, 2016 (an earlier version of the title was “A generalized Nash equilibrium”), CORE 50 Conference, Workshop of the Central European Program in Economic Theory, Udine (2016), Games 2016 Congress, Games and Applications, (2016) Lisbon, Games and Optimization at St Etienne (2016). All possible mistakes are only mine. E-mail for correspondence: dlevando (at) hotmail.ru.
    [Show full text]
  • The Computational Complexity of Evolutionarily Stable Strategies
    International Journal of Game Theory manuscript No. (will be inserted by the editor) The Computational Complexity of Evolutionarily Stable Strategies K. Etessami1, A. Lochbihler2 1 Laboratory for Foundations of Computer Science, School of Informatics, University of Edinburgh, Edinburgh EH9 3JZ, Scotland, UK, e-mail: [email protected] 2 Fakult¨at f¨ur Mathematik und Informatik, Universit¨at Passau, 94030 Passau, Germany, e-mail: [email protected] The date of receipt and acceptance will be inserted by the editor Abstract The concept of evolutionarily stable strategies (ESS) has been cen- tral to applications of game theory in evolutionary biology, and it has also had an influence on the modern development of game theory. A regular ESS is an im- portant refinement the ESS concept. Although there is a substantial literature on computing evolutionarily stable strategies, the precise computational complexity of determining the existence of an ESS in a symmetric two-player strategic form game has remained open, though it has been speculated that the problem is NP- hard. In this paper we show that determining the existence of an ESS is both NP- Σp hard and coNP-hard, and that the problem is contained in 2 , the second level of the polynomial time hierarchy. We also show that determining the existence of a regular ESS is indeed NP-complete. Our upper bounds also yield algorithms for computing a (regular) ESS, if one exists, with the same complexities. Key words computational complexity – game theory – evolutionarily stable stra- tegies – evolutionary biology – Nash equilibria 1 Introduction Game theoretic methods have been applied for a long time to study phenomena in evolutionary biology, most systematically since the pioneering work of May- nard Smith in the 1970’s and 80’s ([SP73,May82]).
    [Show full text]