Epistemic Game Theory∗

Total Page:16

File Type:pdf, Size:1020Kb

Epistemic Game Theory∗ Epistemic game theory∗ Eddie Dekel and Marciano Siniscalchi Tel Aviv and Northwestern University, and Northwestern University January 14, 2014 Contents 1 Introduction and Motivation2 1.1 Philosophy/Methodology.................................4 2 Main ingredients5 2.1 Notation...........................................5 2.2 Strategic-form games....................................5 2.3 Belief hierarchies......................................6 2.4 Type structures.......................................7 2.5 Rationality and belief...................................9 2.6 Discussion.......................................... 10 2.6.1 State dependence and non-expected utility................... 10 2.6.2 Elicitation...................................... 11 2.6.3 Introspective beliefs................................ 11 2.6.4 Semantic/syntactic models............................ 11 3 Strategic games of complete information 12 3.1 Rationality and Common Belief in Rationality..................... 12 3.2 Discussion.......................................... 14 3.3 ∆-rationalizability..................................... 14 4 Equilibrium Concepts 15 4.1 Introduction......................................... 15 4.2 Subjective Correlated Equilibrium............................ 16 4.3 Objective correlated equilibrium............................. 17 4.4 Nash Equilibrium...................................... 21 4.5 The book-of-play assumption............................... 22 4.6 Discussion.......................................... 23 4.6.1 Condition AI.................................... 23 4.6.2 Comparison with Aumann(1987)......................... 24 4.6.3 Nash equilibrium.................................. 24 ∗We thank Drew Fudenberg for his detailed comments, and Robert Molony and Luciano Pomatto for excellent research assistantship. We also thank Pierpaolo Battigalli, Adam Brandenburger, Yi-Chun Chen, Amanda Frieden- berg, Joe Halpern, Qingmin Liu, Andres Perea, two anonymous referees, and the editors, Peyton Young and Shmuel Zamir, for helpful feedback. Eddie Dekel gratefully acknowledges financial support from NSF grant SES-1227434. 1 5 Strategic-form refinements 25 6 Incomplete information 28 6.1 Introduction......................................... 28 6.2 Interim Correlated Rationalizability........................... 30 6.3 Interim Independent Rationalizability.......................... 32 6.4 Equilibrium concepts.................................... 35 6.5 ∆-rationalizability..................................... 36 6.6 Discussion.......................................... 37 7 Extensive-form games 38 7.1 Introduction......................................... 38 7.2 Basic ingredients...................................... 40 7.3 Initial CBR......................................... 43 7.4 Forward Induction..................................... 45 7.4.1 Strong Belief.................................... 45 7.4.2 Examples...................................... 46 7.4.3 RCSBR and Extensive-Form Rationalizability.................. 47 7.4.4 Discussion...................................... 50 7.5 Backward Induction.................................... 52 7.6 Equilibrium......................................... 52 7.7 Discussion.......................................... 54 Strategies...................................... 54 Incomplete information.............................. 55 8 Admissibility 55 8.1 Basics............................................ 56 8.2 Assumption and Mutual Assumption of Rationality................... 57 8.3 Characterization...................................... 57 8.4 Discussion.......................................... 59 8.4.1 Issues in the characterization of IA........................ 59 Relationship with Brandenburger, Friedenberg, and Keisler(2008)...... 59 Full-support beliefs................................. 59 Common vs. mutual assumption of admissibility................ 60 8.4.2 Extensive-form analysis and strategic-form refinements............. 60 LPSs and CPSs................................... 60 Strong belief and assumption........................... 61 Admissibility and sequential rationality..................... 61 1 Introduction and Motivation Epistemic game theory formalizes assumptions about rationality and mutual beliefs in a formal language, then studies their behavioral implications in games. Specifically, it asks: what do different notions of rationality and different assumptions about what players believe about ... what others believe about the rationality of players imply regarding play in a game? A well-known example is the equivalence between common belief in rationality and iterated deletion of dominated strategies. The reason why it is important to be formal and explicit is the standard one in economics. Solution concepts are often motivated intuitively in terms of players' beliefs and their rationality. 2 However, the epistemic analysis may show limitations in these intuitions, reveal what additional assumptions are hidden in the informal arguments, clarify the concepts or show how the intuitions can be generalized. We now consider a number of examples. Backwards induction was long thought to be obviously implied by \common knowledge of rationality." The epistemic analysis showed flaws in this intuition and it is now understood that the characterization is much more subtle (Sections 7.4.3 and 7.5). Next, consider the solution concept that deletes one round of weakly dominated strategies and then iteratively deletes strictly dominated strategies. This concept was first proposed because it is robust to payoff perturbations, which were interpreted as a way to perturb players' rationality. Subsequent epistemic analysis showed this concept is exactly equivalent to \almost common belief" of rationality and of full-support conjectures { an explicit robustness check of common belief in rationality (see Section5). Thus the epistemic analysis generalizes and formalizes the connection of this concept to robustness. The common-prior assumption (Section 4.3) is used to characterize Nash equilibrium with n > 2 players, but not needed for two-player games (compare Theorems5 and7). This result highlights the difference between the concept in these environments. Furthermore, the common-prior is known to be equivalent to no betting when uncertainty is exogenous. We argue that the interpretation of the common-prior assumption and its connection to no-betting results must be modified when uncertainty is endogenous, e.g, about players' strategies (see Example4). Finally, recent work has shown how forward induction and iterated deletion of weakly domi- nated strategies can be characterized. These results turn out to identify important, non-obvious, assumptions and require new notions of \beliefs." Moreover, they clarify the connection between these concepts. (See Section 7.4.4.) Epistemic game theory may also help provide a rationale, or ‘justification,’ for or against specific solution concepts. For instance, in Section6 we identify those cases where interim independent rationalizability is and is not a \suitable" solution concept for games of incomplete information. We view non-epistemic justifications for solution concepts as complementary to the epistemic approach. For some solution concepts, such as forward induction, we think the epistemic analysis is more insightful. For others, such as Nash equilibrium, learning theory may provide the more compelling justification. Indeed, we do not find the epistemic analysis of objective equilibrium notions (Section4) entirely satisfactory. This is because the epistemic assumptions needed are often very strong and hard to view as a justification of a solution concept. Moreover, except for special cases (e.g. pure-strategy Nash equilibrium), it is not really possible to provide necessary and sufficient epistemic conditions for equilibrium behavior (unless we take the view that mixed strategies are actually available to the players). Rather, the analysis constitutes a fleshing-out of the textbook interpretation of equilibrium as `rationality plus correct beliefs.' To us this suggests that equilibrium behavior cannot arise out of strategic reasoning alone. Thus, as discussed above, this epistemic analysis serves the role of identifying where alternative approaches are required to justify standard concepts. While most of the results we present are known from the literature, we sometimes present them differently, to emphasize how they fit within our particular view. We have tried to present a wide swath of the epistemic literature, analyzing simultaneous-move games as well as dynamic games, considering complete and incomplete information games, and exploring both equilibrium and non- equilibrium approaches. That said, our choice of specific topics and results is still quite selective and we admit that our selection is driven by the desire to demonstrate our approach (discussed next), as well as our interests and tastes. Several insightful and important papers could not be included because they did not fit within our narrative. More generally, we have ignored several literatures. The connection with the robustness literature mentioned above (see Kajii and Morris 3 (1997b) for a survey) is not developed. Nor do we study self-confirming based solution concepts (Fudenberg and Levine, 1993; Battigalli, 1987; Rubinstein and Wolinsky, 1994).1 Moreover, we do not discuss epistemics and k-level thinking (Crawford, Costa-Gomes, and Iriberri, 2012; Kets, 2012) or unawareness (see Schipper, 2013, for a comprehensive
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?
    [Show full text]
  • 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).
    [Show full text]
  • On Games of Strategic Experimentation Dinah Rosenberg, Antoine Salomon, Nicolas Vieille
    On Games of Strategic Experimentation Dinah Rosenberg, Antoine Salomon, Nicolas Vieille To cite this version: Dinah Rosenberg, Antoine Salomon, Nicolas Vieille. On Games of Strategic Experimentation. 2010. hal-00579613 HAL Id: hal-00579613 https://hal.archives-ouvertes.fr/hal-00579613 Preprint submitted on 24 Mar 2011 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. On Games of Strategic Experimentation Dinah Rosenberg∗, Antoine Salomon† and Nicolas Vieille‡ December 15, 2010 Abstract We focus on two-player, two-armed bandit games. We analyze the joint effect on the informational spillovers between the players of the correlation between the risky arms, and the extent to which one’s experimentation results are publicly disclosed. Our main results only depend on whethert informational shocks bring good or bad news. In the latter case, there is a sense in which the marginal value of these informational spillovers is zero. Strategic experimentation issues are prevalent in most situations of social learning. In such setups, an agent may learn useful information by experimenting himself, or possibly, by observ- ing other agents. Typical applications include dynamic R&D (see e.g. Moscarini and Squin- tani (2010), Malueg and Tsutsui (1997)), competition in an uncertain environment (MacLennan (1984)), financial contracting (Bergemann and Hege (2005) ), etc.
    [Show full text]
  • Best Experienced Payoff Dynamics and Cooperation in the Centipede Game
    Theoretical Economics 14 (2019), 1347–1385 1555-7561/20191347 Best experienced payoff dynamics and cooperation in the centipede game William H. Sandholm Department of Economics, University of Wisconsin Segismundo S. Izquierdo BioEcoUva, Department of Industrial Organization, Universidad de Valladolid Luis R. Izquierdo Department of Civil Engineering, Universidad de Burgos We study population game dynamics under which each revising agent tests each of his strategies a fixed number of times, with each play of each strategy being against a newly drawn opponent, and chooses the strategy whose total payoff was highest. In the centipede game, these best experienced payoff dynamics lead to co- operative play. When strategies are tested once, play at the almost globally stable state is concentrated on the last few nodes of the game, with the proportions of agents playing each strategy being largely independent of the length of the game. Testing strategies many times leads to cyclical play. Keywords. Evolutionary game theory, backward induction, centipede game, computational algebra. JEL classification. C72, C73. 1. Introduction The discrepancy between the conclusions of backward induction reasoning and ob- served behavior in certain canonical extensive form games is a basic puzzle of game the- ory. The centipede game (Rosenthal (1981)), the finitely repeated prisoner’s dilemma, and related examples can be viewed as models of relationships in which each partic- ipant has repeated opportunities to take costly actions that benefit his partner and in which there is a commonly known date at which the interaction will end. Experimen- tal and anecdotal evidence suggests that cooperative behavior may persist until close to William H.
    [Show full text]
  • The Econometric Society European Region Aide Mémoire
    The Econometric Society European Region Aide M´emoire March 22, 2021 1 European Standing Committee 2 1.1 Responsibilities . .2 1.2 Membership . .2 1.3 Procedures . .4 2 Econometric Society European Meeting (ESEM) 5 2.1 Timing and Format . .5 2.2 Invited Sessions . .6 2.3 Contributed Sessions . .7 2.4 Other Events . .8 3 European Winter Meeting (EWMES) 9 3.1 Scope of the Meeting . .9 3.2 Timing and Format . 10 3.3 Selection Process . 10 4 Appendices 11 4.1 Appendix A: Members of the Standing Committee . 11 4.2 Appendix B: Winter Meetings (since 2014) and Regional Consultants (2009-2013) . 27 4.3 Appendix C: ESEM Locations . 37 4.4 Appendix D: Programme Chairs ESEM & EEA . 38 4.5 Appendix E: Invited Speakers ESEM . 39 4.6 Appendix F: Winners of the ESEM Awards . 43 4.7 Appendix G: Countries in the Region Europe and Other Areas ........... 44 This Aide M´emoire contains a detailed description of the organisation and procedures of the Econometric Society within the European Region. It complements the Rules and Procedures of the Econometric Society. It is maintained and regularly updated by the Secretary of the European Standing Committee in accordance with the policies and decisions of the Committee. The Econometric Society { European Region { Aide Memoire´ 1 European Standing Committee 1.1 Responsibilities 1. The European Standing Committee is responsible for the organisation of the activities of the Econometric Society within the Region Europe and Other Areas.1 It should undertake the consideration of any activities in the Region that promote interaction among those interested in the objectives of the Society, as they are stated in its Constitution.
    [Show full text]
  • Hierarchies of Ambiguous Beliefs∗
    Hierarchies of Ambiguous Beliefs∗ David S. Ahny August 2006 Abstract We present a theory of interactive beliefs analogous to Mertens and Zamir [31] and Branden- burger and Dekel [10] that allows for hierarchies of ambiguity. Each agent is allowed a compact set of beliefs at each level, rather than just a single belief as in the standard model. We propose appropriate definitions of coherency and common knowledge for our types. Common knowledge of coherency closes the model, in the sense that each type homeomorphically encodes a compact set of beliefs over the others' types. This space universally embeds every implicit type space of ambiguous beliefs in a beliefs-preserving manner. An extension to ambiguous conditional probability systems [4] is presented. The standard universal type space and the universal space of compact continuous possibility structures are epistemically identified as subsets. JEL classification: C72; D81 Keywords: ambiguity, Knightian uncertainty, Bayesian games, universal type space 1 Introduction The idea of a player's type introduced by Harsanyi [19] provides a useful and compact represen- tation of the interactive belief structures that arise in a game, encoding a player's beliefs on some \primitive" parameter of uncertainty, her belief about the others' beliefs, their beliefs about her belief about their beliefs, and so on. Mertens and Zamir [31], hereafter MZ, constructed a universal type space encoding all internally consistent streams of beliefs, ensuring that Bayesian games with Harsanyi types lose no analytic generality.1 ∗NOTICE: this is the author's version of a work that was accepted for publication in Journal of Economic Theory.
    [Show full text]
  • Equilibrium Refinements
    Equilibrium Refinements Mihai Manea MIT Sequential Equilibrium I In many games information is imperfect and the only subgame is the original game. subgame perfect equilibrium = Nash equilibrium I Play starting at an information set can be analyzed as a separate subgame if we specify players’ beliefs about at which node they are. I Based on the beliefs, we can test whether continuation strategies form a Nash equilibrium. I Sequential equilibrium (Kreps and Wilson 1982): way to derive plausible beliefs at every information set. Mihai Manea (MIT) Equilibrium Refinements April 13, 2016 2 / 38 An Example with Incomplete Information Spence’s (1973) job market signaling game I The worker knows her ability (productivity) and chooses a level of education. I Education is more costly for low ability types. I Firm observes the worker’s education, but not her ability. I The firm decides what wage to offer her. In the spirit of subgame perfection, the optimal wage should depend on the firm’s beliefs about the worker’s ability given the observed education. An equilibrium needs to specify contingent actions and beliefs. Beliefs should follow Bayes’ rule on the equilibrium path. What about off-path beliefs? Mihai Manea (MIT) Equilibrium Refinements April 13, 2016 3 / 38 An Example with Imperfect Information Courtesy of The MIT Press. Used with permission. Figure: (L; A) is a subgame perfect equilibrium. Is it plausible that 2 plays A? Mihai Manea (MIT) Equilibrium Refinements April 13, 2016 4 / 38 Assessments and Sequential Rationality Focus on extensive-form games of perfect recall with finitely many nodes. An assessment is a pair (σ; µ) I σ: (behavior) strategy profile I µ = (µ(h) 2 ∆(h))h2H: system of beliefs ui(σjh; µ(h)): i’s payoff when play begins at a node in h randomly selected according to µ(h), and subsequent play specified by σ.
    [Show full text]
  • 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 ..................................
    [Show full text]
  • SEQUENTIAL GAMES with PERFECT INFORMATION Example
    SEQUENTIAL GAMES WITH PERFECT INFORMATION Example 4.9 (page 105) Consider the sequential game given in Figure 4.9. We want to apply backward induction to the tree. 0 Vertex B is owned by player two, P2. The payoffs for P2 are 1 and 3, with 3 > 1, so the player picks R . Thus, the payoffs at B become (0, 3). 00 Next, vertex C is also owned by P2 with payoffs 1 and 0. Since 1 > 0, P2 picks L , and the payoffs are (4, 1). Player one, P1, owns A; the choice of L gives a payoff of 0 and R gives a payoff of 4; 4 > 0, so P1 chooses R. The final payoffs are (4, 1). 0 00 We claim that this strategy profile, { R } for P1 and { R ,L } is a Nash equilibrium. Notice that the 0 00 strategy profile gives a choice at each vertex. For the strategy { R ,L } fixed for P2, P1 has a maximal payoff by choosing { R }, ( 0 00 0 00 π1(R, { R ,L }) = 4 π1(R, { R ,L }) = 4 ≥ 0 00 π1(L, { R ,L }) = 0. 0 00 In the same way, for the strategy { R } fixed for P1, P2 has a maximal payoff by choosing { R ,L }, ( 00 0 00 π2(R, {∗,L }) = 1 π2(R, { R ,L }) = 1 ≥ 00 π2(R, {∗,R }) = 0, where ∗ means choose either L0 or R0. Since no change of choice by a player can increase that players own payoff, the strategy profile is called a Nash equilibrium. Notice that the above strategy profile is also a Nash equilibrium on each branch of the game tree, mainly starting at either B or starting at C.
    [Show full text]
  • Topologies on Types
    Theoretical Economics 1 (2006), 275–309 1555-7561/20060275 Topologies on types 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 We define and analyze a “strategic topology” on types in the Harsanyi-Mertens- Zamir universal type space, where two types are close if their strategic behavior is similar in all strategic situations. For a fixed game and action define the dis- tance between a pair of types as the difference between the smallest " for which the action is " interim correlated rationalizable. We define a strategic topology in which a sequence of types converges if and only if this distance tends to zero for any action and game. Thus a sequence of types converges in the strategic topol- ogy if that smallest " does not jump either up or down in the limit. As applied to sequences, the upper-semicontinuity property is equivalent to convergence in the product topology, but the lower-semicontinuity property is a strictly stronger requirement, as shown by the electronic mail game. In the strategic topology, the set of “finite types” (types describable by finite type spaces) is dense but the set of finite common-prior types is not. KEYWORDS. Rationalizability, incomplete information, common knowledge, uni- versal type space, strategic topology. JEL CLASSIFICATION. C70, C72. 1. INTRODUCTION Harsanyi (1967–68) proposed, and Mertens and Zamir (1985) constructed, a universal type space into which (under some technical assumptions) any incomplete information about a strategic situation can be embedded. As a practical matter, applied researchers do not work with that type space but with smaller subsets of the universal type space.
    [Show full text]
  • Modeling Strategic Behavior1
    Modeling Strategic Behavior1 A Graduate Introduction to Game Theory and Mechanism Design George J. Mailath Department of Economics, University of Pennsylvania Research School of Economics, Australian National University 1September 16, 2020, copyright by George J. Mailath. World Scientific Press published the November 02, 2018 version. Any significant correc- tions or changes are listed at the back. To Loretta Preface These notes are based on my lecture notes for Economics 703, a first-year graduate course that I have been teaching at the Eco- nomics Department, University of Pennsylvania, for many years. It is impossible to understand modern economics without knowl- edge of the basic tools of game theory and mechanism design. My goal in the course (and this book) is to teach those basic tools so that students can understand and appreciate the corpus of modern economic thought, and so contribute to it. A key theme in the course is the interplay between the formal development of the tools and their use in applications. At the same time, extensions of the results that are beyond the course, but im- portant for context are (briefly) discussed. While I provide more background verbally on many of the exam- ples, I assume that students have seen some undergraduate game theory (such as covered in Osborne, 2004, Tadelis, 2013, and Wat- son, 2013). In addition, some exposure to intermediate microeco- nomics and decision making under uncertainty is helpful. Since these are lecture notes for an introductory course, I have not tried to attribute every result or model described. The result is a somewhat random pattern of citations and references.
    [Show full text]
  • How Three Beginning Social Studies Teachers Enact Personal Practical Theories
    UNDERSTANDING THE RELATIONSHIP BETWEEN BELIEFS ABOUT DEMOCRACY AND PRACTICE: HOW THREE BEGINNING SOCIAL STUDIES TEACHERS ENACT PERSONAL PRACTICAL THEORIES A dissertation submitted to the Kent State University College of Education, Health, and Human Services in partial fulfillment of the requirements for the degree of Doctor of Philosophy by Andrew L. Hostetler August 2012 © Copyright 2012, by Andrew L. Hostetler All Rights Reserved ii A dissertation written by Andrew L. Hostetler B.S., Kent State University, 2002 M.Ed., Ashland University, 2008 Ph.D., Kent State University, 2012 Approved by _________________________, Director, Doctoral Dissertation Committee Alicia R. Crowe _________________________, Member, Doctoral Dissertation Committee Todd S. Hawley _________________________, Member, Doctoral Dissertation Committee Susan V. Iverson Accepted by _________________________, Director, School of Teaching, Learning and Curriculum Alexa L. Sandmann Studies _________________________, Dean, College of Education, Health and Human Services Daniel F. Mahony iii HOSTETLER, ANDREW L., Ph.D., August 2012 TEACHING, LEARNING, AND CURRICULUM STUDIES UNDERSTANDING THE RELATIONSHIP BETWEEN BELIEFS ABOUT DEMOCRACY AND PRACTICE: HOW THREE BEGINNING SOCIAL STUDIES TEACHERS ENACT PERSONAL PRACTICAL THEORIES (332 pp.) Director of Dissertation: Alicia R. Crowe, Ph.D. This study addressed the gap between teacher beliefs studies that claim beliefs of teachers influence practice and the recommendations for democratic practice presented in much of the literature
    [Show full text]