DOCSLIB.ORG

Game Theory for Linguists

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Game Theory for Linguists Overview Review: Session 1-3 Rationalizability, Beliefs & Best Response Signaling Games Game Theory for Linguists Fritz Hamm, Roland Mühlenbernd 9. Mai 2016 Game Theory for Linguists Overview Review: Session 1-3 Rationalizability, Beliefs & Best Response Signaling Games Overview Overview 1. Review: Session 1-3 2. Rationalizability, Beliefs & Best Response 3. Signaling Games Game Theory for Linguists Overview Review: Session 1-3 Rationalizability, Beliefs & Best Response Signaling Games Conclusions Conclusion of Sessions 1-3 I a game describes a situation of multiple players I that can make decisions (choose actions) I that have preferences over ‘interdependent’ outcomes (action profiles) I preferences are defined by a utility function I games can be defined by abstracting from concrete utility values, but describing it with a general utility function (c.f. synergistic relationship, contribution to public good) I a solution concept describes a process that leads agents to a particular action I a Nash equilibrium defines an action profile where no agent has a need to change the current action I Nash equilibria can be determined by Best Response functions, or by ‘iterated elimination’ of Dominated Actions Game Theory for Linguists Overview Review: Session 1-3 Rationalizability, Beliefs & Best Response Signaling Games Rationalizability Rationalizability I The Nash equilibrium as a solution concept for strategic games does not crucially appeal to a notion of rationality in a players reasoning. I Another concept that is more explicitly linked to a reasoning process of players in a one-shot game is called ratiolalizability. I The set of rationalizable actions can be found by the iterated strict dominance algorithm: I Given a strategic game G I Do the following step until there aren’t dominated strategies left: I for all players: remove all dominated strategies in game G Game Theory for Linguists Overview Review: Session 1-3 Rationalizability, Beliefs & Best Response Signaling Games Rationalizability Nash Equilibria and Rationalizable Actions 1. Apply the Iterated Strict Dominance Algorithm 2. Apply the Best Response Function LCR U 1,1 3,3∗ 4,2 M 0,2 5,16 ∗,3∗ D 2∗,26 ∗,2 0,3∗ Tabelle: The ‘RNE’ game I L is dominated by R I B1(L) = fDg, B1(C) = fDg, I U is dominated by M B1(R) = fMg I C is dominated by R I B2(U) = fCg, B2(M) = fRg, B (R) = fRg I D is dominated by M 2 Game Theory for Linguists Overview Review: Session 1-3 Rationalizability, Beliefs & Best Response Signaling Games Rationalizability Nash Equilibria and Rationalizable Actions 1. Apply the Iterated Strict Dominance Algorithm 2. Apply the Best Response Function DBS D -1,-1 -2,0∗ -2,0∗ B 0∗,-22 ∗,1∗ 0,0 S 0∗,-2 0,0 1∗,2∗ Tabelle: The ‘Bach-Stravinsky-Dentist’ game I D is dominated by B and S I B1(D) = fB; Sg, B1(B) = fBg, B1(S) = fSg I B2(D) = fB; Sg, B2(B) = fBg, B2(S) = fSg Game Theory for Linguists Overview Review: Session 1-3 Rationalizability, Beliefs & Best Response Signaling Games Rationalizability Nash Equilibria and Rationalizable Actions Exercises: 1. Apply the Iterated Strict Dominance Algorithm 2. Apply the Best Response Function EFGH A 0,7∗ 2,5 7∗,0 0,1 B 5,2 3∗,3∗ 5,2 0,1 C 7∗,0 2,5 0,7∗ 0,1 D 0,0∗ 0,-2 0,0∗ 10∗,-1 Tabelle: The ‘non-RNE’ game Game Theory for Linguists Overview Review: Session 1-3 Rationalizability, Beliefs & Best Response Signaling Games Rationalizability Nash Equilibria and Rationalizable Actions I ratiolalizability can lead to a unique solution (‘RNE’ game), I but generally does only restrict the number of rational actions (‘Bach-Stravinsky-Dentist’ game) I or does not help at all, even when there is a unique Nash equilibrium (‘non-RNE’ game) Note: if the Iterated Strict Dominance algorithm (rationalizability) leads to one unique strategy profile, then it is the only Nash equilibrium1 of the game, but not the other way around 1and it is a strict Nash equilibrium Game Theory for Linguists Overview Review: Session 1-3 Rationalizability, Beliefs & Best Response Signaling Games Beliefs Beliefs I ratiolalizability solely makes use of the standard assumption, namely that each player knows the utilities of the game, and assumes the other player(s) i) to know the utilities of the game, and ii) to be rational I but players can be assumed to have more knowledge about the other player(s), c.f. such as a belief about how the other player would behave I a belief can be represented as a mixed strategy Game Theory for Linguists Overview Review: Session 1-3 Rationalizability, Beliefs & Best Response Signaling Games Beliefs Mixed Strategies I a mixed strategy δi of player i is a probability distribution over the set of the player’s actions Ai : δi 2 ∆(Ai ) I ∆ : A ! R has the following properties: I 8a 2 A : 0 ≤ ∆(a) ≤ 1 P I a2A ∆(a) = 1 I Exercise: given an action set A = fr; p; sg. Which of the following probability distribution is a mixed strategy for A? p I δ = (0:2; 0:3; 0:5) (∆(r) = 0:2, ∆(p) = 0:3, ∆(s) = 0:5) I δ = (0:3; 0:4; 0:2) F I δ = (0:1; 1:2; −0:3) F I δ = (0:4; 0:4; 0:3) F I δ = (1:0; 0:0) F p I δ = (1:0; 0:0; 0:0) Game Theory for Linguists Overview Review: Session 1-3 Rationalizability, Beliefs & Best Response Signaling Games Beliefs Beliefs as Mixed Strategies I a mixed strategy δi of player i is a probability distribution over the set of the player’s actions Ai : δi 2 ∆(Ai ) I example: the mixed strategy δi = (0:3; 0:7) for the prisoner’s dilemma action set fC; Dg represents that player i chooses C with probability 0:3 and D with probability 0:7 I a mixed strategy δi can represent: I player i’s uncertainty how to act I player j’s belief about player i how to act I problem: actual behavior can only be represented by pure strategies, not by mixed strategies I but it is reasonable to represent beliefs by mixed strategies I where do such beliefs come from? Game Theory for Linguists Overview Review: Session 1-3 Rationalizability, Beliefs & Best Response Signaling Games Beliefs Expected Utility Definition Let G = (f1; 2g; A1;2; u1;2) be a two-player game and δi 2 ∆Ai a mixed strategy of player i. Then the expected utility EUi of player i for playing ai with a belief δj is given as: X EUi (ai jδj ) = δj (aj ) × ui (ai ; aj ) (1) aj 2Aj CD I Compute EU1(Cj(0:3; 0:7)): 0:6 C 2;2 0;3 I Compute EU1(Dj(0:1; 0:9)): 1:3 D 3;0 1;1 I Compute EU1(Cj(0:1; 0:9)): 0:2 pris. dilemma Game Theory for Linguists Overview Review: Session 1-3 Rationalizability, Beliefs & Best Response Signaling Games Beliefs Best Response Definition Let G = (f1; 2g; A1;2; u1;2) be a two-player game and δi 2 ∆Ai a mixed strategy of player i. Then the best response BRi of player i for a belief δj is given as: BRi (δj ) = arg max EUi (ai jδj ) (2) ai 2Ai BS Compute BR ((0:5; 0:5)): fBg I 1 B 3;2 1;1 I Compute BR1((0:3; 0:7)): fSg S 1;1 2;3 1 2 I Compute BR1(( 3 ; 3 )): fB; Sg lifted BoS Game Theory for Linguists Overview Review: Session 1-3 Rationalizability, Beliefs & Best Response Signaling Games Coordination & Signaling Coordination & Signaling RL aL aS R 1 0 tL 1 0 L 0 1 tS 0 1 Messages: One or two lanterns? tL m1 tL m1 tL m1 tL m1 s1: s2: s3: s4: m tS m2 tS m2 tS m2 tS 2 m1 aL m1 aL m1 aL m1 aL r1: r2: r3: r4: a m2 aS m2 aS m2 aS m2 S Game Theory for Linguists Overview Review: Session 1-3 Rationalizability, Beliefs & Best Response Signaling Games The Lewis Game The Lewis Game: Definition I a signaling game is a tuple SG = hfS; Rg; T ; Pr; M; A; Ui I a Lewis game is defined by: 1 if i = j T = ft ; t g I U(t ; a ) = I L S i j 0 else I M = fm1; m2g a a I A = faL; aSg L S tL 1 0 I Pr(tL) = Pr(tS) = :5 tS 0 1 Game Theory for Linguists Overview Review: Session 1-3 Rationalizability, Beliefs & Best Response Signaling Games The Lewis Game The Lewis Game: Extensive Form N tL :5 :5 tS S S m1 m2 m1 m2 R R R R aL aS aL aS aL aS aL aS 1 0 1 0 0 1 0 1 Abbildung: Extensive form of the Lewis game Game Theory for Linguists Overview Review: Session 1-3 Rationalizability, Beliefs & Best Response Signaling Games The Lewis Game Pure strategies Pure strategies are contingency plans, players act according to. I sender strategy: s : T ! M I receiver strategy: r : M ! A tL m1 tL m1 tL m1 tL m1 s1: s2: s3: s4: m tS m2 tS m2 tS m2 tS 2 m1 aL m1 aL m1 aL m1 aL r1: r2: r3: r4: a m2 aS m2 aS m2 aS m2 S Game Theory for Linguists Overview Review: Session 1-3 Rationalizability, Beliefs & Best Response Signaling Games The Lewis Game Signaling Systems I signaling systems are combinations of pure strategies. The Lewis game has two: L1 = hs1; r1i and L2 = hs2; r2i tL m1 aL tL m1 aL L1: L2: tS m2 aS tS m2 aS I signaling systems are strict Nash equilibria of the EU-table: r1 r2 r3 r4 s1 1 0 .5 .5 s2 0 1 .5 .5 s3 .5 .5 .5 .5 s4 .5 .5 .5 .5 I in signaling systems messages associate states and actions uniquely I signaling systems constitute evolutionary stable states Game Theory for Linguists Overview Review: Session 1-3 Rationalizability, Beliefs & Best Response Signaling Games The Lewis Game Summary & Outlook I Rationalizability I returns rationalizable actions I solely makes use of the standard assumptions I does not return a unique solution in most cases I Best Response BR(s) to a belief s I does return a unique solution in almost all cases I needs an additional assumption: a belief (mixed strategy) about the other player(s) I A Signaling Game is a dynamic/sequential game of imperfect information and models an act of communication I Outlook: signaling games and best response to a belief are fundamental concepts in game-theoretic Pragmatics Game Theory for Linguists.
Load more

Recommended publications
  • Use of Mixed Signaling Strategies in International Crisis Negotiations
    USE OF MIXED SIGNALING STRATEGIES IN INTERNATIONAL CRISIS NEGOTIATIONS DISSERTATION Presented in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in the Graduate School of The Ohio State University By Unislawa M. Wszolek, B.A., M.A. ***** The Ohio State University 2007 Dissertation Committee: Approved by Brian Pollins, Adviser Daniel Verdier Adviser Randall Schweller Graduate Program in Political Science ABSTRACT The assertion that clear signaling prevents unnecessary war drives much of the recent developments in research on international crises signaling, so much so that this work has aimed at identifying types of clear signals. But if clear signals are the only mechanism for preventing war, as the signaling literature claims, an important puzzle remains — why are signals that combine both carrot and stick components sent and why are signals that are partial or ambiguous sent. While these signals would seemingly work at cross-purposes undermining the signaler’s goals, actually, we observe them frequently in crises that not only end short of war but also that realize the signaler’s goals. Through a game theoretic model, this dissertation theorizes that because these alternatives to clear signals increase the attractiveness, and therefore the likelihood, of compliance they are a more cost-effective way to show resolve and avoid unnecessary conflict than clear signals. In addition to building a game theoretic model, an additional contribution of this thesis is to develop a method for observing mixed versus clear signaling strategies and use this method to test the linkage between signaling and crisis outcomes. Results of statistical analyses support theoretical expectations: clear signaling strategies might not always be the most effective way to secure peace, while mixed signaling strategies can be an effective deterrent.
    [Show full text]
  • Signaling Games
    Signaling Games Farhad Ghassemi Abstract - We give an overview of signaling games and their relevant so- lution concept, perfect Bayesian equilibrium. We introduce an example of signaling games and analyze it. 1 Introduction In the general framework of incomplete information or Bayesian games, it is usually assumed that information is equally distributed among players; i.e. there exists a commonly known probability distribution of the unknown parameter(s) of the game. However, very often in the real life, we are confronted with games in which players have asymmetric information about the unknown parameter of the game; i.e. they have different probability distributions of the unknown parameter. As an example, consider a game in which the unknown parameter of the game can be measured by the players but with different degrees of accuracy. Those players that have access to more accurate methods of measurement are definitely in an advantageous position. In extreme cases of asymmetric information games, one player has complete information about the unknown parameter of the game while others only know it by a probability distribution. In these games, the information is completely one-sided. The informed player, for instance, may be the only player in the game who can have different types and while he knows his type, other do not (e.g. a prospect job applicant knows if he has high or low skills for a job but the employer does not) or the informed player may know something about the state of the world that others do not (e.g. a car dealer knows the quality of the cars he sells but buyers do not).
    [Show full text]
  • Perfect Conditional E-Equilibria of Multi-Stage Games with Infinite Sets
    Perfect Conditional -Equilibria of Multi-Stage Games with Infinite Sets of Signals and Actions∗ Roger B. Myerson∗ and Philip J. Reny∗∗ *Department of Economics and Harris School of Public Policy **Department of Economics University of Chicago Abstract Abstract: We extend Kreps and Wilson’s concept of sequential equilibrium to games with infinite sets of signals and actions. A strategy profile is a conditional -equilibrium if, for any of a player’s positive probability signal events, his conditional expected util- ity is within of the best that he can achieve by deviating. With topologies on action sets, a conditional -equilibrium is full if strategies give every open set of actions pos- itive probability. Such full conditional -equilibria need not be subgame perfect, so we consider a non-topological approach. Perfect conditional -equilibria are defined by testing conditional -rationality along nets of small perturbations of the players’ strate- gies and of nature’s probability function that, for any action and for almost any state, make this action and state eventually (in the net) always have positive probability. Every perfect conditional -equilibrium is a subgame perfect -equilibrium, and, in fi- nite games, limits of perfect conditional -equilibria as 0 are sequential equilibrium strategy profiles. But limit strategies need not exist in→ infinite games so we consider instead the limit distributions over outcomes. We call such outcome distributions per- fect conditional equilibrium distributions and establish their existence for a large class of regular projective games. Nature’s perturbations can produce equilibria that seem unintuitive and so we augment the game with a net of permissible perturbations.
    [Show full text]
  • Signaling Games Y ECON 201B - Game Theory
    Notes on Signaling Games y ECON 201B - Game Theory Guillermo Ordoñez UCLA February 23, 2007 1 Understanding a Signaling Game Consider the following game. This is a typical signaling game that follows the classical "beer and quiche" structure. In these notes I will discuss the elements of this particular type of games, equilibrium concepts to use and how to solve for pooling, separating, hybrid and completely mixed sequential equilibria. 1.1 Elements of the game The game starts with a "decision" by Nature, which determines whether player 1 is of type I or II with a probability p = Pr(I) (in this example we assume 1 p = 2 ). Player 1, after learning his type, must decide whether to play L or R. Since player 1 knows his type, the action will be decided conditioning on it. 0 These notes were prepared as a back up material for TA session. If you have any questions or comments,y or notice any errors or typos, please drop me a line at [email protected] 1 After player 1 moves, player 2 is able to see the action taken by player 1 but not the type of player 1. Hence, conditional on the action observed she has to decide whether to play U or D. Hence, it’spossible to de…ne strategies for each player (i) as For player 1, a mapping from types to actions 1 : I aL + (1 a)R and II bL + (1 b)R ! ! For player 2, a mapping from player 1’sactions to her own actions 2 : L xU + (1 x)D and R yU + (1 y)D ! ! In this game there is no subgame since we cannot …nd any single node where a game completely separated from the rest of the tree starts.
    [Show full text]
  • Perfect Bidder Collusion Through Bribe and Request*
    Perfect bidder collusion through bribe and request* Jingfeng Lu† Zongwei Lu ‡ Christian Riis§ May 31, 2021 Abstract We study collusion in a second-price auction with two bidders in a dy- namic environment. One bidder can make a take-it-or-leave-it collusion pro- posal, which consists of both an offer and a request of bribes, to the opponent. We show that there always exists a robust equilibrium in which the collusion success probability is one. In the equilibrium, for each type of initiator the expected payoff is generally higher than the counterpart in any robust equi- libria of the single-option model (Eso¨ and Schummer(2004)) and any other separating equilibria in our model. Keywords: second-price auction, collusion, multidimensional signaling, bribe JEL codes: D44, D82 arXiv:1912.03607v2 [econ.TH] 28 May 2021 *We are grateful to the editors in charge and an anonymous reviewer for their insightful comments and suggestions, which greatly improved the quality of our paper. Any remaining errors are our own. †Department of Economics, National University of Singapore. Email: [email protected]. ‡School of Economics, Shandong University. Email: [email protected]. §Department of Economics, BI Norwegian Business School. Email: [email protected]. 1 1 Introduction Under standard assumptions, auctions are a simple yet effective economic insti- tution that allows the owner of a scarce resource to extract economic rents from buyers. Collusion among bidders, on the other hand, can ruin the rents and hence should be one of the main issues that are always kept in the minds of auction de- signers with a revenue-maximizing objective.
    [Show full text]
  • Selectionfree Predictions in Global Games with Endogenous
    Theoretical Economics 8 (2013), 883–938 1555-7561/20130883 Selection-free predictions in global games with endogenous information and multiple equilibria George-Marios Angeletos Department of Economics, Massachusetts Institute of Technology, and Department of Economics, University of Zurich Alessandro Pavan Department of Economics, Northwestern University Global games with endogenous information often exhibit multiple equilibria. In this paper, we show how one can nevertheless identify useful predictions that are robust across all equilibria and that cannot be delivered in the common- knowledge counterparts of these games. Our analysis is conducted within a flexi- ble family of games of regime change, which have been used to model, inter alia, speculative currency attacks, debt crises, and political change. The endogeneity of information originates in the signaling role of policy choices. A novel procedure of iterated elimination of nonequilibrium strategies is used to deliver probabilis- tic predictions that an outside observer—an econometrician—can form under ar- bitrary equilibrium selections. The sharpness of these predictions improves as the noise gets smaller, but disappears in the complete-information version of the model. Keywords. Global games, multiple equilibria, endogenous information, robust predictions. JEL classification. C7, D8, E5, E6, F3. 1. Introduction In the last 15 years, the global-games methodology has been used to study a variety of socio-economic phenomena, including currency attacks, bank runs, debt crises, polit- ical change, and party leadership.1 Most of the appeal of this methodology for applied George-Marios Angeletos: [email protected] Alessandro Pavan: [email protected] This paper grew out of prior joint work with Christian Hellwig and would not have been written without our earlier collaboration; we are grateful for his contribution during the early stages of the project.
    [Show full text]
  • Sequential Preference Revelation in Incomplete Information Settings”
    Online Appendix for “Sequential preference revelation in incomplete information settings” † James Schummer∗ and Rodrigo A. Velez May 6, 2019 1 Proof of Theorem 2 Theorem 2 is implied by the following result. Theorem. Let f be a strategy-proof, non-bossy SCF, and fix a reporting order Λ ∆(Π). Suppose that at least one of the following conditions holds. 2 1. The prior has Cartesian support (µ Cartesian) and Λ is deterministic. 2 M 2. The prior has symmetric Cartesian support (µ symm Cartesian) and f is weakly anonymous. 2 M − Then equilibria are preserved under deviations to truthful behavior: for any N (σ,β) SE Γ (Λ, f ), ,µ , 2 h U i (i) for each i N, τi is sequentially rational for i with respect to σ i and βi ; 2 − (ii) for each S N , there is a belief system such that β 0 ⊆ N ((σ S ,τS ),β 0) SE β 0(Λ, f ), ,µ . − 2 h U i Proof. Let f be strategy-proof and non-bossy, Λ ∆(Π), and µ Cartesian. Since the conditions of the two theorems are the same,2 we refer to2 arguments M ∗Department of Managerial Economics and Decision Sciences, Kellogg School of Manage- ment, Northwestern University, Evanston IL 60208; [email protected]. †Department of Economics, Texas A&M University, College Station, TX 77843; [email protected]. 1 made in the proof of Theorem 1. In particular all numbered equations refer- enced below appear in the paper. N Fix an equilibrium (σ,β) SE Γ (Λ, f ), ,µ .
    [Show full text]
  • SS364 Game Theory
    SS364 AY19-2 Syllabus LSN Date Topic/Event Required Reading Learning Objectives Assigned Problems Notes Block 1: Simple Game of Strategy 1. Understand what game theory is and where it is used. Complete Cadet 1 10-Jan Introduction to Game Theory Chapter 1, pages 3-16 2. Identify where games occur Information Sheet 1. Know the components of a game and game theory terminology. 2 14-Jan The Structure of Games Chapter 2, pages 17-41 2. Understand how to classify games. Chapter 2: U1-U4 3. Understand the underlying assumptions in game theory. 1. Understand the extensive form of a game and its components. 3 18-Jan Sequential Move Games 1 Chapter 3, pages 47-63 2. Understand how to solve games using backward induction ("rollback"). Chapter 3: U2-U5 3. Explain the difference between first- and second-mover advantage. 1. Understand the complexities that arise by adding more moves to a game. 4 23-Jan Sequential Move Games 2 Chapter 3, pages 63-81 Chapter 3: U7-U10 2. Explain the intermediate valuation function. 1. Understand the normal form of a game and its components. 5 25-Jan Simultaneous Move Games 1 Chapter 4, pages 91-108 2. Explain the concept of a Nash Equilibrium. Chapter 4: U1, U4, U6 3. Understand the process of iterated elimination of dominated strategies. 1. Understand coordination games. 6 29-Jan Simultaneous Move Games 2 Chapter 4, pages 108-120 Chapter 4: U10-U12 2. Explain what happens when there is no pure strategy equilibrium. 1. Calculate best-response rules used to solve games in continuous space.
    [Show full text]
  • Experimental Evaluation of a Pessimistic Equilibrium
    Renegotiation-proofness and Climate Agreements: Experimental Evidence Leif Helland 2,1 and Jon Hovi3,2 [email protected] [email protected] 1 Department of Public Governance, Norwegian School of Management (BI) Nydalsveien 37, 0442 Oslo. 2 CICERO Box 1129 Blindern, 0318 Oslo, Norway. 3 Department of Political Science, University of Oslo Box 1097 Blindern, 0317 Oslo, Norway. Acknowledgements We gratefully acknowledge financial support from the Research Council of Norway. Helpful comments were provided by Geir Asheim, Scott Barrett, Ernst Fehr, Urs Fischbacher, Michael Kosfeld and Lorenz Götte. Urs Fischbacher also produced practical help and advice in programming the experiment. Lynn A. P. Nygaard provided excellent editorial assistance. Colleagues at CICERO kindly participated in a pilot project, and provided useful advice afterwards. Renegotiation-proofness and Climate Agreements: Experimental Evidence Abstract The notion of renegotiation-proof equilibrium has become a cornerstone in non- cooperative models of international environmental agreements. Applying this solution concept to the infinitely repeated N-person Prisoners’ Dilemma generates predictions that contradict intuition as well as conventional wisdom about public goods provision. This paper reports the results of an experiment designed to test two such predictions. The first is that the higher the cost of making a contribution, the more cooperation will materialize. The second is that the number of cooperators is independent of group size. Although the experiment was designed
    [Show full text]
  • Dynamic Bayesian Games
    Preliminary Concepts Sequential Equilibrium Signaling Game Application: The Spence Model Application: Cheap Talk Introduction to Game Theory Lecture 8: Dynamic Bayesian Games Haifeng Huang University of California, Merced Shanghai, Summer 2011 Preliminary Concepts Sequential Equilibrium Signaling Game Application: The Spence Model Application: Cheap Talk Basic terminology • Now we study dynamic Bayesian games, or dynamic/extensive games of incomplete information, as opposed to the static (simultaneous-move) games of incomplete information in the last lecture note. • Incomplte information: a player does not know another player's characteristics (in particular, preferences); imperfect information: a player does not know what actions another player has taken. • Recall that in a dynamic game of perfect information, each player is perfectly informed of the history of what has happened so far, up to the point where it is her turn to move. Preliminary Concepts Sequential Equilibrium Signaling Game Application: The Spence Model Application: Cheap Talk Harsanyi Transformation • Following Harsanyi (1967), we can change a dynamic game of incomeplete information into a dynamic game of imperfect information, by making nature as a mover in the game. In such a game, nature chooses player i's type, but another player j is not perfectly informed about this choice. • But first, let's look at a dynamic game of complete but imperfect information. Preliminary Concepts Sequential Equilibrium Signaling Game Application: The Spence Model Application: Cheap Talk A dynamic game of complete but imperfect information • An entry game: the challenger may stay out, prepare for combat and enter (ready), or enter without making preparations (unready). Each player's preferences are common knowledge.
    [Show full text]
  • PSCI552 - Formal Theory (Graduate) Lecture Notes
    PSCI552 - Formal Theory (Graduate) Lecture Notes Dr. Jason S. Davis Spring 2020 Contents 1 Preliminaries 4 1.1 What is the role of theory in the social sciences? . .4 1.2 So why formalize that theory? And why take this course? . .4 2 Proofs 5 2.1 Introduction . .5 2.2 Logic . .5 2.3 What are we proving? . .6 2.4 Different proof strategies . .7 2.4.1 Direct . .7 2.4.2 Indirect/contradiction . .7 2.4.3 Induction . .8 3 Decision Theory 9 3.1 Preference Relations and Rationality . .9 3.2 Imposing Structure on Preferences . 11 3.3 Utility Functions . 13 3.4 Uncertainty, Expected Utility . 14 3.5 The Many Faces of Decreasing Returns . 15 3.5.1 Miscellaneous stuff . 17 3.6 Optimization . 17 3.7 Comparative Statics . 18 4 Game Theory 22 4.1 Preliminaries . 22 4.2 Static games of complete information . 23 4.3 The Concept of the Solution Concept . 24 4.3.1 Quick side note: Weak Dominance . 27 4.3.2 Quick side note: Weak Dominance . 27 4.4 Evaluating Outcomes/Normative Theory . 27 4.5 Best Response Correspondences . 28 4.6 Nash Equilibrium . 28 4.7 Mixed Strategies . 31 4.8 Extensive Form Games . 36 4.8.1 Introduction . 36 4.8.2 Imperfect Information . 39 4.8.3 Subgame Perfection . 40 4.8.4 Example Questions . 43 4.9 Static Games of Incomplete Information . 45 4.9.1 Learning . 45 4.9.2 Bayesian Nash Equilibrium . 46 4.10 Dynamic Games with Incomplete Information . 50 4.10.1 Perfect Bayesian Nash Equilibrium .
    [Show full text]
  • Notes for a Course in Game Theory Maxwell B. Stinchcombe
    Notes for a Course in Game Theory Maxwell B. Stinchcombe Fall Semester, 2008. Unique #34215 Contents Chapter 1. Organizational Stuff 5 Chapter 2. Some Hints About the Scope of Game Theory 7 1. Defining a Game 7 2. The Advantage of Being Small 7 3. The Need for Coordinated Actions 8 4. Correlated Hunting 9 5. Mixed Nash Equilibria 10 6. Inspection Games and Mixed Strategies 11 7. The Use of Deadly Force and Evolutionary Arguments 12 8. Games of chicken 13 9. In Best Response Terms 14 10. Two Prisoners 14 11. Tragedy of the commons 15 12. Cournot Competition and Some Dynamics 16 Chapter 3. Optimality? Who Told You the World is Optimal? 21 1. A Little Bit of Decision Theory 21 2. Generalities About 2 × 2 Games 21 3. Rescaling and the Strategic Equivalence of Games 22 4. The gap between equilibrium and Pareto rankings 24 5. Conclusions about Equilibrium and Pareto rankings 24 6. Risk dominance and Pareto rankings 25 7. Idle Threats 26 8. Spying and Coordination 27 9. Problems 28 Chapter 4. Monotone Comparative Statics for Decision Theory 31 1. Overview 31 2. The Implicit Function Approach 31 3. The simple supermodularity approach 33 4. POSETs and Lattices 35 5. Monotone comparative statics 36 6. Cones and Lattice Orderings 38 7. Quasi-supermodularity 40 8. More Practice with Orderings and Comparative Statics 41 1 Chapter 5. Monotone Comparative Statics and Related Dynamics for Game Theory 45 1. Some examples of supermodular games 45 2. A bit more about lattices 46 3. A bit more about solution concepts for games 46 4.
    [Show full text]