Network Markets and Coordination Games

Total Page:16

File Type:pdf, Size:1020Kb

Load more

Network Markets and Coordination Games A Dissertation Presented to the Faculty of the Graduate School of Yale University in Candidacy for the Degree of Doctor of Philosophy by Rosa Argenziano Dissertation Directors: Professor Dirk Bergemann and Professor Stephen Morris May 2005 Contents Acknowledgments v Introduction 1 1Differentiated Networks: Equilibrium and Efficiency 5 1.1Introduction.................................... 5 1.2TheModel.................................... 10 1.3 EfficientAllocation................................ 15 1.4TheEquilibriumAllocation........................... 23 1.4.1 ConsumerCoordination......................... 24 1.4.2 UnsponsoredNetworks.......................... 28 1.4.3 SponsoredNetworks........................... 30 1.5Conclusions.................................... 33 2 Network Markets and Consumer Coordination1 36 2.1Introduction.................................... 36 2.2RelatedLiterature................................ 42 2.3TheModel.................................... 44 2.4 Coalitional Rationalizability and Coalition Perfect Equilibrium . 46 2.5MonopolistwithOneNetwork.......................... 51 2.6MonopolistWhoCanOperateMultipleNetworks............... 53 2.6.1 TwoTypesofConsumersonEachSide................ 54 2.6.2 General Specification........................... 61 2.7Duopoly...................................... 62 2.7.1 HomogeneousConsumers........................ 63 2.7.2 TheGeneralCase............................ 66 2.8Discussion..................................... 70 2.8.1 PositiveMarginalCost.......................... 70 2.8.2 Multi-Homing............................... 71 2.8.3 Conflict of Interest among Consumers on the Same Side . 71 2.8.4 MorethanTwoFirms.......................... 72 2.9ConclusionsandPossibleExtensions...................... 73 1 Attila Ambrus and Rosa Argenziano i CONTENTS ii 3 History as a Coordination Device2 74 3.1Introduction.................................... 74 3.2RelatedLiterature................................ 77 3.3TheStageGame................................. 78 3.4WhereDoExpectationsComefrom?...................... 83 3.5TheDynamicProcess.............................. 87 Appendices 91 A 92 B 109 C 131 Bibliography 135 2 Rosa Argenziano and Itzhak Gilboa List of Figures 1.1 Aggregate surplus derived from the vertical quality of the goods for the case θ =2. ....................................... 19 1.2 Aggregate surplus derived from idiosyncratic taste for the case θ =2. .... 21 1.3 Aggregate surplus derived from the network effect for the case θ =2. .... 22 2.1 Optimal Price Structure for a Monopolist with Two Networks . 59 3.1 Threshold p∗(x) .................................. 82 iii c 2005 by Rosa Argenziano ° All rights reserved. Acknowledgments I am deeply indebted to Dirk Bergemann and Stephen Morris for their constant support, their detailed feedback and their infinite patience. The guidance, help and encouragement I received from them in the last five years were more than any doctoral student could have asked for. When I work on my research, I tend to commit at least two mistakes. First, I often develop confused ideas and equations and get lost into them. Stephen’s ability to see clearly through my confusion and find the potentially interesting element hidden in there has been invaluable. Second, I tend to underestimate what I can achieve. Dirk’s wise but firm unwillingness to believe me every time I announced that I had done "my best" has constituted a constant challenge for which I will never thank him enough. I am also grateful to Dino Gerardi for his encouragement, his irony, and all his precious, constructive suggestions and to Ben Polak for his support and his generous attention to every detail of my work. A special thanks goes to Don Brown for his patience, his enthusiasm and the long afternoons he spent listening to my attempts to prove some lemma. And for the chocolate. Chapter 2 of this dissertation is coauthored with Attila Ambrus, to whom I am deeply grateful for the incredible amount of work he invested in our project. His deep understanding of game theory and his dedication to his work have been a real source of inspiration for me. Chapter 3 of this dissertation is coauthored with Itzhak Gilboa, a true Renaissance man from whom I learnt, among innumerable other things, that a sincere intellectual curiosity is a necessary condition to enjoy life as a researcher. I also thank Bernard Caillaud, Giancarlo Corsetti, Jacques Cremer, Gergely Csorba, Ulrich Doraszelvski, Erica Field, Ezra Friedman, Drew Fudenberg, Bernardo Guimaraes, Barry O’Neill, Ady Pauzner, Alessandro Pavan, Ben Polak, Dmitry Shapiro, Hyun Song Shin, Gábor Virág and seminar participants at Yale University, Harvard University, Olin School of Business, at the Conference on Two-Sided Markets and at the Conference on The Economics of Software and the Internet organized by IDEI Toulouse, at the 31st TPRC, at the 2004 Winter Meeting of the Ec PAC Project and at the WISE workshop in Salerno for helpful comments and discussions. This dissertation would have never been written if I had not taken Riccardo Martina’s undergraduate microeconomics class. He has the gift to share with his students much more than his knowledge of economics: he shares with them his passion for it. In the last eleven years he has been a great teacher and a true friend and I will always be grateful for his constant encouragement. I consider myself extremely lucky for the chance I had to spend the last five years in the Economics Department at Yale University. Here I found not only dedicated teachers and inspiring advisors, but also a warm and friendly work environment, and colleagues from whom I have learnt something new every day. Finally, I want to thank Pam O’Donnell, for being a mother away from home. I gratefully acknowledge financial support from the Cowles Foundation and from Yale University in the form of a Robert M. Leylan Dissertation Fellowship. To my parents, Tina and Salvatore, for teaching me to follow my dreams To Sergio, for sharing those dreams Introduction Several oligopolistic industries that play a crucial role in modern economies are "network industries": industries where the benefit that an individual consumer derives from consum- ing a good increases with the number of other people consuming the same good. Network markets can be one-sided or two-sided. Examples of the first class of markets are soft- ware markets: the utility an individual derives from a given software is increasing in the total number of users because the more people own the software, the more people they can interact with, exchanging files and know-how. The second class of markets includes auction websites, credit card networks, directory services and all those markets where two groups of individuals or firms need a common platform to interact and one or more firms own platforms and sell access to them. In this case, the utility derived from accessing a platform is increasing in the number of potential counterparts who join the same platform. Also, network products can be divided into pure network goods, such as telecommunication networks, and non-pure network goods. The first class of products includes all those goods for which the network externality is the only source of utility a consumer derives from the product, while the second class includes al those products that also provide an intrinsic utility. 1 2 A classic methodological issue related to network markets is that modeling the demand function is particularly challenging because the problem faced by consumers choosing which network to join, for given prices, constitutes a coordination game and typically coordination games have multiple equilibria. My dissertation explores three different approaches to this problem. In chapter 1, I analyze one-sided markets for non-pure network goods where consumers can choose between two alternative products that are both vertically and horizontally dif- ferentiated. Modeling consumer choice as a global game with private values, I show that either a large amount of horizontal differentiation or a high positive correlation of con- sumers’ private values of the goods are necessary and sufficient for the demand function to be well-defined. Using this result, I then address the issue of efficiency on these mar- kets. I derive the equilibrium allocation of consumers to the networks for both the case of sponsored and unsponsored networks as well as the allocation that would maximize social welfare. The three allocations share two important features: in all of them both networks are active, due to the presence of sufficiently strong horizontal differentiation, and the high quality network attracts more than one half of the consumers. Nonetheless, two inefficien- cies arise. First, since consumers fail to internalize network externalities, the equilibrium allocation with unsponsored networks is too balanced. Second, if access to the networks is priced by strategic firms, then the firm with a higher expected quality charges a price higher than the competitor’s and this further reduces the asymmetry between market shares and therefore social welfare. In chapter 2, which is coauthored with Attila Ambrus, we analyze two-sided markets for 3 pure network goods. We address the issue of multiple equilibria of the coordination game played by consumers, assuming that the latter can coordinate their decisions to their advan- tage, if their interests coincide and if coordination can be achieved without communication. Using this methodology, we show that multiple
Recommended publications
  • Lecture 4 Rationalizability & Nash Equilibrium Road

    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).
  • Learning and Equilibrium

    Learning and Equilibrium

    Learning and Equilibrium Drew Fudenberg1 and David K. Levine2 1Department of Economics, Harvard University, Cambridge, Massachusetts; email: [email protected] 2Department of Economics, Washington University of St. Louis, St. Louis, Missouri; email: [email protected] Annu. Rev. Econ. 2009. 1:385–419 Key Words First published online as a Review in Advance on nonequilibrium dynamics, bounded rationality, Nash equilibrium, June 11, 2009 self-confirming equilibrium The Annual Review of Economics is online at by 140.247.212.190 on 09/04/09. For personal use only. econ.annualreviews.org Abstract This article’s doi: The theory of learning in games explores how, which, and what 10.1146/annurev.economics.050708.142930 kind of equilibria might arise as a consequence of a long-run non- Annu. Rev. Econ. 2009.1:385-420. Downloaded from arjournals.annualreviews.org Copyright © 2009 by Annual Reviews. equilibrium process of learning, adaptation, and/or imitation. If All rights reserved agents’ strategies are completely observed at the end of each round 1941-1383/09/0904-0385$20.00 (and agents are randomly matched with a series of anonymous opponents), fairly simple rules perform well in terms of the agent’s worst-case payoffs, and also guarantee that any steady state of the system must correspond to an equilibrium. If players do not ob- serve the strategies chosen by their opponents (as in extensive-form games), then learning is consistent with steady states that are not Nash equilibria because players can maintain incorrect beliefs about off-path play. Beliefs can also be incorrect because of cogni- tive limitations and systematic inferential errors.
  • Lecture Notes

    Lecture Notes

    GRADUATE GAME THEORY LECTURE NOTES BY OMER TAMUZ California Institute of Technology 2018 Acknowledgments These lecture notes are partially adapted from Osborne and Rubinstein [29], Maschler, Solan and Zamir [23], lecture notes by Federico Echenique, and slides by Daron Acemoglu and Asu Ozdaglar. I am indebted to Seo Young (Silvia) Kim and Zhuofang Li for their help in finding and correcting many errors. Any comments or suggestions are welcome. 2 Contents 1 Extensive form games with perfect information 7 1.1 Tic-Tac-Toe ........................................ 7 1.2 The Sweet Fifteen Game ................................ 7 1.3 Chess ............................................ 7 1.4 Definition of extensive form games with perfect information ........... 10 1.5 The ultimatum game .................................. 10 1.6 Equilibria ......................................... 11 1.7 The centipede game ................................... 11 1.8 Subgames and subgame perfect equilibria ...................... 13 1.9 The dollar auction .................................... 14 1.10 Backward induction, Kuhn’s Theorem and a proof of Zermelo’s Theorem ... 15 2 Strategic form games 17 2.1 Definition ......................................... 17 2.2 Nash equilibria ...................................... 17 2.3 Classical examples .................................... 17 2.4 Dominated strategies .................................. 22 2.5 Repeated elimination of dominated strategies ................... 22 2.6 Dominant strategies ..................................
  • Prophylaxy Copie.Pdf

    Prophylaxy Copie.Pdf

    Social interactions and the prophylaxis of SI epidemics on networks Géraldine Bouveret, Antoine Mandel To cite this version: Géraldine Bouveret, Antoine Mandel. Social interactions and the prophylaxis of SI epi- demics on networks. Journal of Mathematical Economics, Elsevier, 2021, 93, pp.102486. 10.1016/j.jmateco.2021.102486. halshs-03165772 HAL Id: halshs-03165772 https://halshs.archives-ouvertes.fr/halshs-03165772 Submitted on 17 Mar 2021 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Social interactions and the prophylaxis of SI epidemics on networkssa G´eraldineBouveretb Antoine Mandel c March 17, 2021 Abstract We investigate the containment of epidemic spreading in networks from a nor- mative point of view. We consider a susceptible/infected model in which agents can invest in order to reduce the contagiousness of network links. In this setting, we study the relationships between social efficiency, individual behaviours and network structure. First, we characterise individual and socially efficient behaviour using the notions of communicability and exponential centrality. Second, we show, by computing the Price of Anarchy, that the level of inefficiency can scale up to lin- early with the number of agents.
  • Collusion Constrained Equilibrium

    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.
  • Economics 201B Economic Theory (Spring 2021) Strategic Games

    Economics 201B Economic Theory (Spring 2021) Strategic Games

    Economics 201B Economic Theory (Spring 2021) Strategic Games Topics: terminology and notations (OR 1.7), games and solutions (OR 1.1-1.3), rationality and bounded rationality (OR 1.4-1.6), formalities (OR 2.1), best-response (OR 2.2), Nash equilibrium (OR 2.2), 2 2 examples × (OR 2.3), existence of Nash equilibrium (OR 2.4), mixed strategy Nash equilibrium (OR 3.1, 3.2), strictly competitive games (OR 2.5), evolution- ary stability (OR 3.4), rationalizability (OR 4.1), dominance (OR 4.2, 4.3), trembling hand perfection (OR 12.5). Terminology and notations (OR 1.7) Sets For R, ∈ ≥ ⇐⇒ ≥ for all . and ⇐⇒ ≥ for all and some . ⇐⇒ for all . Preferences is a binary relation on some set of alternatives R. % ⊆ From % we derive two other relations on : — strict performance relation and not  ⇐⇒ % % — indifference relation and ∼ ⇐⇒ % % Utility representation % is said to be — complete if , or . ∀ ∈ % % — transitive if , and then . ∀ ∈ % % % % can be presented by a utility function only if it is complete and transitive (rational). A function : R is a utility function representing if → % ∀ ∈ () () % ⇐⇒ ≥ % is said to be — continuous (preferences cannot jump...) if for any sequence of pairs () with ,and and , . { }∞=1 % → → % — (strictly) quasi-concave if for any the upper counter set ∈ { ∈ : is (strictly) convex. % } These guarantee the existence of continuous well-behaved utility function representation. Profiles Let be a the set of players. — () or simply () is a profile - a collection of values of some variable,∈ one for each player. — () or simply is the list of elements of the profile = ∈ { } − () for all players except . ∈ — ( ) is a list and an element ,whichistheprofile () .
  • Interim Correlated Rationalizability

    Interim Correlated Rationalizability

    Interim Correlated Rationalizability The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters Citation Dekel, Eddie, Drew Fudenberg, and Stephen Morris. 2007. Interim correlated rationalizability. Theoretical Economics 2, no. 1: 15-40. Published Version http://econtheory.org/ojs/index.php/te/article/view/20070015 Citable link http://nrs.harvard.edu/urn-3:HUL.InstRepos:3196333 Terms of Use This article was downloaded from Harvard University’s DASH repository, and is made available under the terms and conditions applicable to Other Posted Material, as set forth at http:// nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of- use#LAA Theoretical Economics 2 (2007), 15–40 1555-7561/20070015 Interim correlated rationalizability EDDIE DEKEL Department of Economics, Northwestern University, and School of Economics, Tel Aviv University DREW FUDENBERG Department of Economics, Harvard University STEPHEN MORRIS Department of Economics, Princeton University This paper proposes the solution concept of interim correlated rationalizability, and shows that all types that have the same hierarchies of beliefs have the same set of interim-correlated-rationalizable outcomes. This solution concept charac- terizes common certainty of rationality in the universal type space. KEYWORDS. Rationalizability, incomplete information, common certainty, com- mon knowledge, universal type space. JEL CLASSIFICATION. C70, C72. 1. INTRODUCTION Harsanyi (1967–68) proposes solving games of incomplete
  • Tacit Collusion in Oligopoly"

    Tacit Collusion in Oligopoly"

    Tacit Collusion in Oligopoly Edward J. Green,y Robert C. Marshall,z and Leslie M. Marxx February 12, 2013 Abstract We examine the economics literature on tacit collusion in oligopoly markets and take steps toward clarifying the relation between econo- mists’analysis of tacit collusion and those in the legal literature. We provide examples of when the economic environment might be such that collusive pro…ts can be achieved without communication and, thus, when tacit coordination is su¢ cient to elevate pro…ts versus when com- munication would be required. The authors thank the Human Capital Foundation (http://www.hcfoundation.ru/en/), and especially Andrey Vavilov, for …nancial support. The paper bene…tted from discussions with Roger Blair, Louis Kaplow, Bill Kovacic, Vijay Krishna, Steven Schulenberg, and Danny Sokol. We thank Gustavo Gudiño for valuable research assistance. [email protected], Department of Economics, Penn State University [email protected], Department of Economics, Penn State University [email protected], Fuqua School of Business, Duke University 1 Introduction In this chapter, we examine the economics literature on tacit collusion in oligopoly markets and take steps toward clarifying the relation between tacit collusion in the economics and legal literature. Economists distinguish between tacit and explicit collusion. Lawyers, using a slightly di¤erent vocabulary, distinguish between tacit coordination, tacit agreement, and explicit collusion. In hopes of facilitating clearer communication between economists and lawyers, in this chapter, we attempt to provide a coherent resolution of the vernaculars used in the economics and legal literature regarding collusion.1 Perhaps the easiest place to begin is to de…ne explicit collusion.
  • Statistical GGP Game Decomposition Aline Hufschmitt, Jean-Noël Vittaut, Nicolas Jouandeau

    Statistical GGP Game Decomposition Aline Hufschmitt, Jean-Noël Vittaut, Nicolas Jouandeau

    Statistical GGP Game Decomposition Aline Hufschmitt, Jean-Noël Vittaut, Nicolas Jouandeau To cite this version: Aline Hufschmitt, Jean-Noël Vittaut, Nicolas Jouandeau. Statistical GGP Game Decomposition. Computer Games - 7th Workshop, CGW 2018, Held in Conjunction with the 27th International Con- ference on Artificial Intelligence, IJCAI 2018, Jul 2018, Stockholm, Sweden. pp.79-97, 10.1007/978- 3-030-24337-1_4. hal-02182443 HAL Id: hal-02182443 https://hal.archives-ouvertes.fr/hal-02182443 Submitted on 15 Oct 2019 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. In Proceedings of the IJCAI-18 Workshop on Computer Games (CGW 2018) Statistical GGP Game Decomposition Aline Hufschmitt, Jean-No¨elVittaut, and Nicolas Jouandeau LIASD - University of Paris 8, France falinehuf,jnv,[email protected] Abstract. This paper presents a statistical approach for the decompo- sition of games in the General Game Playing framework. General game players can drastically decrease game search cost if they hold a decom- posed version of the game. Previous works on decomposition rely on syn- tactical structures, which can be missing from the game description, or on the disjunctive normal form of the rules, which is very costly to compute.
  • Common Belief Foundations of Global Games∗

    Common Belief Foundations of Global Games∗

    Common Belief Foundations of Global Games Stephen Morris Hyun Song Shin Muhamet Yildiz Princeton University Bank of International Settlements M.I.T. January 2015 Abstract Complete information games– i.e., games where there is common certainty of payoffs– often have multiple rationalizable actions. What happens if the common certainty of payoffs assumption is relaxed? Consider a two player game where a player’spayoff depends on a payoff parameter. Define a player’s"rank belief" as the probability he assigns to his payoff parameter being higher than his opponent’s. We show that there is a unique rationalizable action played when there is common certainty of rank beliefs, and we argue this is the driving force behind selection results in the global games literature. We consider what happens if players’payoff parameters are derived from common and idiosyncratic terms with fat tailed distributions, and we approach complete information by shrinking the distribution of both terms. There are two cases. If the common component has a thicker tails, then there is common certainty of rank beliefs, and thus uniqueness and equilibrium selection. If the idiosyncratic terms has thicker tails, then there is approximate common certainty of payoffs, and thus multiple rationalizable actions. 1 Introduction Complete information games often have many equilibria. Even when they have a single equilibrium, they often have many actions that are rationalizable, and are therefore consistent with common This paper incorporates material from a working paper of the same title circulated in 2009 (Morris and Shin (2009)). We are grateful for comments from seminar participants at Northwestern on this iteration of the project.
  • Essays on Supermodular Games, Design, and Political Theory

    Essays on Supermodular Games, Design, and Political Theory

    Selection, Learning, and Nomination: Essays on Supermodular Games, Design, and Political Theory Thesis by Laurent Mathevet In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy California Institute of Technology Pasadena, California 2008 (Defended May 15th, 2008) ii c 2008 Laurent Mathevet All Rights Reserved iii For my parents, Denise and Ren´eMathevet iv Acknowledgements Many people have helped me along the way. Christelle has been a source of happiness, and without her uncompromising support and faith in me, I would have been miserable. My parents, to whom this dissertation is dedicated, have shown continual and unconditional support despite the distance. They are a constant source of inspiration. I also wish to thank my advisors, Federico Echenique and Matthew Jackson, for their help and encouragement. Federico has spent numerous hours advising me, meeting with me nearly every week since my second year as a graduate student. He has endeavored to extract the most out of me, discarding unpromising thoughts and results, reading my drafts countless times and demanding (countless!) rewrites. Most importantly, he found the right words in those difficult times of a PhD graduate student. Matt has also been a wonderful advisor, available, demanding, and encouraging. I have benefited greatly from his comments, which are the kind that shapes the core of a research project. Matt has funded me for several years, which allowed me to concentrate on research. I also thank him for his invitation to spend a term at Stanford to further my research. I am indebted to Preston McAfee, whose personality, charisma, and sharpness have made meetings with him among the most fruitful and enjoyable.
  • Game Theory Chris Georges Some Examples of 2X2 Games Here Are

    Game Theory Chris Georges Some Examples of 2X2 Games Here Are

    Game Theory Chris Georges Some Examples of 2x2 Games Here are some widely used stylized 2x2 normal form games (two players, two strategies each). The ranking of the payoffs is what distinguishes the games, rather than the actual values of these payoffs. I will use Watson’s numbers here (see e.g., p. 31). Coordination game: two friends have agreed to meet on campus, but didn’t resolve where. They had narrowed it down to two possible choices: library or pub. Here are two versions. Player 2 Library Pub Player 1 Library 1,1 0,0 Pub 0,0 1,1 Player 2 Library Pub Player 1 Library 2,2 0,0 Pub 0,0 1,1 Battle of the Sexes: This is an asymmetric coordination game. A couple is trying to agree on what to do this evening. They have narrowed the choice down to two concerts: Nicki Minaj or Justin Bieber. Each prefers one over the other, but prefers either to doing nothing. If they disagree, they do nothing. Possible metaphor for bargaining (strategies are high wage, low wage: if disagreement we get a strike (0,0)) or agreement between two firms on a technology standard. Notice that this is a coordination game in which the two players are of different types (have different preferences). Player 2 NM JB Player 1 NM 2,1 0,0 JB 0,0 1,2 Matching Pennies: coordination is good for one player and bad for the other. Player 1 wins if the strategies match, player 2 wins if they don’t match.