Collusive Behavior in Noncooperative Epsilon-Equilibria of Oligopolies with Long but Finite Lives
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Game Theory 2: Extensive-Form Games and Subgame Perfection
Game Theory 2: Extensive-Form Games and Subgame Perfection 1 / 26 Dynamics in Games How should we think of strategic interactions that occur in sequence? Who moves when? And what can they do at different points in time? How do people react to different histories? 2 / 26 Modeling Games with Dynamics Players Player function I Who moves when Terminal histories I Possible paths through the game Preferences over terminal histories 3 / 26 Strategies A strategy is a complete contingent plan Player i's strategy specifies her action choice at each point at which she could be called on to make a choice 4 / 26 An Example: International Crises Two countries (A and B) are competing over a piece of land that B occupies Country A decides whether to make a demand If Country A makes a demand, B can either acquiesce or fight a war If A does not make a demand, B keeps land (game ends) A's best outcome is Demand followed by Acquiesce, worst outcome is Demand and War B's best outcome is No Demand and worst outcome is Demand and War 5 / 26 An Example: International Crises A can choose: Demand (D) or No Demand (ND) B can choose: Fight a war (W ) or Acquiesce (A) Preferences uA(D; A) = 3 > uA(ND; A) = uA(ND; W ) = 2 > uA(D; W ) = 1 uB(ND; A) = uB(ND; W ) = 3 > uB(D; A) = 2 > uB(D; W ) = 1 How can we represent this scenario as a game (in strategic form)? 6 / 26 International Crisis Game: NE Country B WA D 1; 1 3X; 2X Country A ND 2X; 3X 2; 3X I Is there something funny here? I Is there something funny here? I Specifically, (ND; W )? I Is there something funny here? -
Repeated Games
6.254 : Game Theory with Engineering Applications Lecture 15: Repeated Games Asu Ozdaglar MIT April 1, 2010 1 Game Theory: Lecture 15 Introduction Outline Repeated Games (perfect monitoring) The problem of cooperation Finitely-repeated prisoner's dilemma Infinitely-repeated games and cooperation Folk Theorems Reference: Fudenberg and Tirole, Section 5.1. 2 Game Theory: Lecture 15 Introduction Prisoners' Dilemma How to sustain cooperation in the society? Recall the prisoners' dilemma, which is the canonical game for understanding incentives for defecting instead of cooperating. Cooperate Defect Cooperate 1, 1 −1, 2 Defect 2, −1 0, 0 Recall that the strategy profile (D, D) is the unique NE. In fact, D strictly dominates C and thus (D, D) is the dominant equilibrium. In society, we have many situations of this form, but we often observe some amount of cooperation. Why? 3 Game Theory: Lecture 15 Introduction Repeated Games In many strategic situations, players interact repeatedly over time. Perhaps repetition of the same game might foster cooperation. By repeated games, we refer to a situation in which the same stage game (strategic form game) is played at each date for some duration of T periods. Such games are also sometimes called \supergames". We will assume that overall payoff is the sum of discounted payoffs at each stage. Future payoffs are discounted and are thus less valuable (e.g., money and the future is less valuable than money now because of positive interest rates; consumption in the future is less valuable than consumption now because of time preference). We will see in this lecture how repeated play of the same strategic game introduces new (desirable) equilibria by allowing players to condition their actions on the way their opponents played in the previous periods. -
Lecture 4 Rationalizability & Nash Equilibrium Road
Lecture 4 Rationalizability & Nash Equilibrium 14.12 Game Theory Muhamet Yildiz Road Map 1. Strategies – completed 2. Quiz 3. Dominance 4. Dominant-strategy equilibrium 5. Rationalizability 6. Nash Equilibrium 1 Strategy A strategy of a player is a complete contingent-plan, determining which action he will take at each information set he is to move (including the information sets that will not be reached according to this strategy). Matching pennies with perfect information 2’s Strategies: HH = Head if 1 plays Head, 1 Head if 1 plays Tail; HT = Head if 1 plays Head, Head Tail Tail if 1 plays Tail; 2 TH = Tail if 1 plays Head, 2 Head if 1 plays Tail; head tail head tail TT = Tail if 1 plays Head, Tail if 1 plays Tail. (-1,1) (1,-1) (1,-1) (-1,1) 2 Matching pennies with perfect information 2 1 HH HT TH TT Head Tail Matching pennies with Imperfect information 1 2 1 Head Tail Head Tail 2 Head (-1,1) (1,-1) head tail head tail Tail (1,-1) (-1,1) (-1,1) (1,-1) (1,-1) (-1,1) 3 A game with nature Left (5, 0) 1 Head 1/2 Right (2, 2) Nature (3, 3) 1/2 Left Tail 2 Right (0, -5) Mixed Strategy Definition: A mixed strategy of a player is a probability distribution over the set of his strategies. Pure strategies: Si = {si1,si2,…,sik} σ → A mixed strategy: i: S [0,1] s.t. σ σ σ i(si1) + i(si2) + … + i(sik) = 1. If the other players play s-i =(s1,…, si-1,si+1,…,sn), then σ the expected utility of playing i is σ σ σ i(si1)ui(si1,s-i) + i(si2)ui(si2,s-i) + … + i(sik)ui(sik,s-i). -
Algorithms and Collusion - Background Note by the Secretariat
Unclassified DAF/COMP(2017)4 Organisation for Economic Co-operation and Development 9 June 2017 English - Or. English DIRECTORATE FOR FINANCIAL AND ENTERPRISE AFFAIRS COMPETITION COMMITTEE Cancels & replaces the same document of 17 May 2017. Algorithms and Collusion - Background Note by the Secretariat 21-23 June 2017 This document was prepared by the OECD Secretariat to serve as a background note for Item 10 at the 127th Meeting of the Competition Committee on 21-23 June 2017. The opinions expressed and arguments employed herein do not necessarily reflect the official views of the Organisation or of the governments of its member countries. More documentation related to this discussion can be found at http://www.oecd.org/daf/competition/algorithms-and-collusion.htm Please contact Mr. Antonio Capobianco if you have any questions about this document [E-mail: [email protected]] JT03415748 This document, as well as any data and map included herein, are without prejudice to the status of or sovereignty over any territory, to the delimitation of international frontiers and boundaries and to the name of any territory, city or area. 2 │ DAF/COMP(2017)4 Algorithms and Collusion Background note by the Secretariat Abstract The combination of big data with technologically advanced tools, such as pricing algorithms, is increasingly diffused in today everyone’s life, and it is changing the competitive landscape in which many companies operate and the way in which they make commercial and strategic decisions. While the size of this phenomenon is to a large extent unknown, there are a growing number of firms using computer algorithms to improve their pricing models, customise services and predict market trends. -
A New Approach to Stable Matching Problems
August1 989 Report No. STAN-CS-89- 1275 A New Approach to Stable Matching Problems bY Ashok Subramanian Department of Computer Science Stanford University Stanford, California 94305 3 DISTRIBUTION /AVAILABILITY OF REPORT Unrestricted: Distribution Unlimited GANIZATION 1 1 TITLE (Include Securrty Clamfrcat!on) A New Approach to Stable Matching Problems 12 PERSONAL AUTHOR(S) Ashok Subramanian 13a TYPE OF REPORT 13b TtME COVERED 14 DATE OF REPORT (Year, Month, Day) 15 PAGE COUNT FROM TO August 1989 34 16 SUPPLEMENTARY NOTATION 17 COSATI CODES 18 SUBJECT TERMS (Contrnue on reverse If necessary and jdentrfy by block number) FIELD GROUP SUB-GROUP 19 ABSTRACT (Continue on reverse if necessary and identrfy by block number) Abstract. We show that Stable Matching problems are the same as problems about stable config- urations of X-networks. Consequences include easy proofs of old theorems, a new simple algorithm for finding a stable matching, an understanding of the difference between Stable Marriage and Stable Roommates, NTcompleteness of Three-party Stable Marriage, CC-completeness of several Stable Matching problems, and a fast parallel reduction from the Stable Marriage problem to the ’ Assignment problem. 20 DISTRIBUTION /AVAILABILITY OF ABSTRACT 21 ABSTRACT SECURITY CLASSIFICATION q UNCLASSIFIED/UNLIMITED 0 SAME AS Rf’T 0 DTIC USERS 22a NAME OF RESPONSIBLE INDIVIDUAL 22b TELEPHONE (Include Area Code) 22c OFFICE SYMBOL Ernst Mavr DD Form 1473, JUN 86 Prevrous edrtions are obsolete SECURITY CLASSIFICATION OF TYS PAGt . 1 , S/N 0102-LF-014-6603 \ \ ““*5 - - A New Approach to Stable Matching Problems * Ashok Subramanian Department of Computer Science St anford University Stanford, CA 94305-2140 Abstract. -
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]. -
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 -
The Three Types of Collusion: Fixing Prices, Rivals, and Rules Robert H
University of Baltimore Law ScholarWorks@University of Baltimore School of Law All Faculty Scholarship Faculty Scholarship 2000 The Three Types of Collusion: Fixing Prices, Rivals, and Rules Robert H. Lande University of Baltimore School of Law, [email protected] Howard P. Marvel Ohio State University, [email protected] Follow this and additional works at: http://scholarworks.law.ubalt.edu/all_fac Part of the Antitrust and Trade Regulation Commons, and the Law and Economics Commons Recommended Citation The Three Types of Collusion: Fixing Prices, Rivals, and Rules, 2000 Wis. L. Rev. 941 (2000) This Article is brought to you for free and open access by the Faculty Scholarship at ScholarWorks@University of Baltimore School of Law. It has been accepted for inclusion in All Faculty Scholarship by an authorized administrator of ScholarWorks@University of Baltimore School of Law. For more information, please contact [email protected]. ARTICLES THE THREE TYPES OF COLLUSION: FIXING PRICES, RIVALS, AND RULES ROBERTH. LANDE * & HOWARDP. MARVEL** Antitrust law has long held collusion to be paramount among the offenses that it is charged with prohibiting. The reason for this prohibition is simple----collusion typically leads to monopoly-like outcomes, including monopoly profits that are shared by the colluding parties. Most collusion cases can be classified into two established general categories.) Classic, or "Type I" collusion involves collective action to raise price directly? Firms can also collude to disadvantage rivals in a manner that causes the rivals' output to diminish or causes their behavior to become chastened. This "Type 11" collusion in turn allows the colluding firms to raise prices.3 Many important collusion cases, however, do not fit into either of these categories. -
Kranton Duke University
The Devil is in the Details – Implications of Samuel Bowles’ The Moral Economy for economics and policy research October 13 2017 Rachel Kranton Duke University The Moral Economy by Samuel Bowles should be required reading by all graduate students in economics. Indeed, all economists should buy a copy and read it. The book is a stunning, critical discussion of the interplay between economic incentives and preferences. It challenges basic premises of economic theory and questions policy recommendations based on these theories. The book proposes the path forward: designing policy that combines incentives and moral appeals. And, therefore, like such as book should, The Moral Economy leaves us with much work to do. The Moral Economy concerns individual choices and economic policy, particularly microeconomic policies with goals to enhance the collective good. The book takes aim at laws, policies, and business practices that are based on the classic Homo economicus model of individual choice. The book first argues in great detail that policies that follow from the Homo economicus paradigm can backfire. While most economists would now recognize that people are not purely selfish and self-interested, The Moral Economy goes one step further. Incentives can amplify the selfishness of individuals. People might act in more self-interested ways in a system based on incentives and rewards than they would in the absence of such inducements. The Moral Economy warns economists to be especially wary of incentives because social norms, like norms of trust and honesty, are critical to economic activity. The danger is not only of incentives backfiring in a single instance; monetary incentives can generally erode ethical and moral codes and social motivations people can have towards each other. -
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. -
Scenario Analysis Normal Form Game
Overview Economics 3030 I. Introduction to Game Theory Chapter 10 II. Simultaneous-Move, One-Shot Games Game Theory: III. Infinitely Repeated Games Inside Oligopoly IV. Finitely Repeated Games V. Multistage Games 1 2 Normal Form Game A Normal Form Game • A Normal Form Game consists of: n Players Player 2 n Strategies or feasible actions n Payoffs Strategy A B C a 12,11 11,12 14,13 b 11,10 10,11 12,12 Player 1 c 10,15 10,13 13,14 3 4 Normal Form Game: Normal Form Game: Scenario Analysis Scenario Analysis • Suppose 1 thinks 2 will choose “A”. • Then 1 should choose “a”. n Player 1’s best response to “A” is “a”. Player 2 Player 2 Strategy A B C a 12,11 11,12 14,13 Strategy A B C b 11,10 10,11 12,12 a 12,11 11,12 14,13 Player 1 11,10 10,11 12,12 c 10,15 10,13 13,14 b Player 1 c 10,15 10,13 13,14 5 6 1 Normal Form Game: Normal Form Game: Scenario Analysis Scenario Analysis • Suppose 1 thinks 2 will choose “B”. • Then 1 should choose “a”. n Player 1’s best response to “B” is “a”. Player 2 Player 2 Strategy A B C Strategy A B C a 12,11 11,12 14,13 a 12,11 11,12 14,13 b 11,10 10,11 12,12 11,10 10,11 12,12 Player 1 b c 10,15 10,13 13,14 Player 1 c 10,15 10,13 13,14 7 8 Normal Form Game Dominant Strategy • Regardless of whether Player 2 chooses A, B, or C, Scenario Analysis Player 1 is better off choosing “a”! • “a” is Player 1’s Dominant Strategy (i.e., the • Similarly, if 1 thinks 2 will choose C… strategy that results in the highest payoff regardless n Player 1’s best response to “C” is “a”. -
How to Win at Tic-Tac-Toe
More Than Child’s Play How to Get N in a Row Games with Animals Hypercube Tic-Tac-Toe How to Win at Tic-Tac-Toe Norm Do Undoubtably, one of the most popular pencil and paper games in the world is tic-tac-toe, also commonly known as noughts and crosses. In this talk, you will learn how to beat your friends (at tic-tac-toe), discover why snaky is so shaky, and see the amazing tic-tac-toe playing chicken! March 2007 Norm Do How to Win at Tic-Tac-Toe Tic-Tac-Toe is popular: You’ve all played it while sitting at the back of a boring class. In fact, some of you are probably playing it right now! Tic-Tac-Toe is boring: People who are mildly clever should never lose. More Than Child’s Play How to Get N in a Row Some Facts About Tic-Tac-Toe Games with Animals Games to Beat your Friends With Hypercube Tic-Tac-Toe Some facts about tic-tac-toe Tic-Tac-Toe is old: It may have been played under the name of “terni lapilli” in Ancient Rome. Norm Do How to Win at Tic-Tac-Toe Tic-Tac-Toe is boring: People who are mildly clever should never lose. More Than Child’s Play How to Get N in a Row Some Facts About Tic-Tac-Toe Games with Animals Games to Beat your Friends With Hypercube Tic-Tac-Toe Some facts about tic-tac-toe Tic-Tac-Toe is old: It may have been played under the name of “terni lapilli” in Ancient Rome.