Recursive Smooth Ambiguity Preferences1
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Continuation-Passing Style
Continuation-Passing Style CS 6520, Spring 2002 1 Continuations and Accumulators In our exploration of machines for ISWIM, we saw how to explicitly track the current continuation for a computation (Chapter 8 of the notes). Roughly, the continuation reflects the control stack in a real machine, including virtual machines such as the JVM. However, accurately reflecting the \memory" use of textual ISWIM requires an implementation different that from that of languages like Java. The ISWIM machine must extend the continuation when evaluating an argument sub-expression, instead of when calling a function. In particular, function calls in tail position require no extension of the continuation. One result is that we can write \loops" using λ and application, instead of a special for form. In considering the implications of tail calls, we saw that some non-loop expressions can be converted to loops. For example, the Scheme program (define (sum n) (if (zero? n) 0 (+ n (sum (sub1 n))))) (sum 1000) requires a control stack of depth 1000 to handle the build-up of additions surrounding the recursive call to sum, but (define (sum2 n r) (if (zero? n) r (sum2 (sub1 n) (+ r n)))) (sum2 1000 0) computes the same result with a control stack of depth 1, because the result of a recursive call to sum2 produces the final result for the enclosing call to sum2 . Is this magic, or is sum somehow special? The sum function is slightly special: sum2 can keep an accumulated total, instead of waiting for all numbers before starting to add them, because addition is commutative. -
Denotational Semantics
Denotational Semantics CS 6520, Spring 2006 1 Denotations So far in class, we have studied operational semantics in depth. In operational semantics, we define a language by describing the way that it behaves. In a sense, no attempt is made to attach a “meaning” to terms, outside the way that they are evaluated. For example, the symbol ’elephant doesn’t mean anything in particular within the language; it’s up to a programmer to mentally associate meaning to the symbol while defining a program useful for zookeeppers. Similarly, the definition of a sort function has no inherent meaning in the operational view outside of a particular program. Nevertheless, the programmer knows that sort manipulates lists in a useful way: it makes animals in a list easier for a zookeeper to find. In denotational semantics, we define a language by assigning a mathematical meaning to functions; i.e., we say that each expression denotes a particular mathematical object. We might say, for example, that a sort implementation denotes the mathematical sort function, which has certain properties independent of the programming language used to implement it. In other words, operational semantics defines evaluation by sourceExpression1 −→ sourceExpression2 whereas denotational semantics defines evaluation by means means sourceExpression1 → mathematicalEntity1 = mathematicalEntity2 ← sourceExpression2 One advantage of the denotational approach is that we can exploit existing theories by mapping source expressions to mathematical objects in the theory. The denotation of expressions in a language is typically defined using a structurally-recursive definition over expressions. By convention, if e is a source expression, then [[e]] means “the denotation of e”, or “the mathematical object represented by e”. -
The Design of Ambiguous Mechanisms∗
The Design of Ambiguous Mechanisms∗ Alfredo Di Tillio y Nenad Kos z Matthias Messner x Bocconi University, Bocconi University, Bocconi University, IGIER IGIER IGIER, CESifo July 26, 2014 Abstract This paper explores the sale of an object to an ambiguity averse buyer. We show that the seller can increase his profit by using an ambiguous mechanism. That is, the seller can benefit from hiding certain features of the mechanism that he has committed to from the agent. We then characterize the profit maximizing mechanisms for the seller and characterize the conditions under which the seller can gain by employing an ambiguous mechanism. JEL Code: C72, D44, D82. Keywords: Optimal mechanism design, Ambiguity aversion, Incentive compatibility, In- dividual rationality. ∗We thank the editor and three anonymous referees for their insightful and constructive comments that have helped us to greatly improve the paper. For helpful discussions and comments we also thank Simone Cerreia- Vioglio, Eddie Dekel, Georgy Egorov, Eduardo Faingold, Itzhak Gilboa, Matthew Jackson, Alessandro Lizzeri, George Mailath, Massimo Marinacci, Stephen Morris, Frank Riedel, Larry Samuelson, Martin Schneider, Ilya Segal, seminar participants at Northwestern University, Universitat Autonoma de Barcelona, Universitat Pompeu Fabra, Yale University, participants of UECE Lisbon 2011, Workshop on Ambiguity Bonn 2011, and Arne Ryde Workshop on Dynamic Princing: A Mechanism Design Perspective 2011. yDept. of Econ. & IGIER, Bocconi University; e-mail: [email protected] zDept. -
Ambiguity and Social Interaction∗
Ambiguity and Social Interaction∗ J¨urgen Eichberger David Kelsey Alfred Weber Institut, Department of Economics, Universit¨at Heidelberg. University of Exeter. Burkhard C. Schipper† Department of Economics, University of California, Davis. 30th March 2007 Abstract We present a non-technical account of ambiguity in strategic games and show how it may be applied to economics and social sciences. Optimistic and pessimistic responses to ambiguity are formally modelled. We show that pessimism has the effect of increasing (de- creasing) equilibrium prices under Cournot (Bertrand) competition. In addition the effects of ambiguity on peace-making are examined. It is shown that ambiguity may select equilibria in coordination games with multiple equilibria. Some comparative statics results are derived for the impact of ambiguity in games with strategic complements. Keywords: Ambiguity, Optimism, Pessimism, Strategic Games, Oligopoly, Strategic Dele- gation, Peace-making, Strategic Complements, Choquet Expected Utility. JEL Classification: C72, D43, D62, D81. ∗Financial support by ESRC grant ES-000-22-0650 (David) and the DFG, SFB/TR 15 (Burkhard) is gratefully acknowledged. We thank Sujoy Mukerji, Jeffrey Kline, Simon Grant, Frank Milne, Wei Pang, Marzia Raybaudi- Massilia, Kirk McGrimmon, Peter Sinclair and Willy Spanjers as well as seminar participants at the Australian National University, the Universities of Alabama, Birmingham, Berlin (Humboldt), Edinburgh, Exeter, the Royal Economic Society and the EEA for helpful comments. †Corresponding author: Department of Economics, University of California, Davis, One Shields Avenue, Davis, CA 95616, USA, Tel: +1-530-752 6142, Fax: +1-530-752 9382, Email: [email protected] 1 Introduction The growing literature on ambiguity in strategic games lacks two important features: First, an elementary framework of ambiguity in games that can be easily understood and applied also by non-specialists, and second, the treatment of an optimistic attitude towards ambiguity in addition to ambiguity aversion or pessimism. -
A Descriptive Study of California Continuation High Schools
Issue Brief April 2008 Alternative Education Options: A Descriptive Study of California Continuation High Schools Jorge Ruiz de Velasco, Greg Austin, Don Dixon, Joseph Johnson, Milbrey McLaughlin, & Lynne Perez Continuation high schools and the students they serve are largely invisible to most Californians. Yet, state school authorities estimate This issue brief summarizes that over 115,000 California high school students will pass through one initial findings from a year- of the state’s 519 continuation high schools each year, either on their long descriptive study of way to a diploma, or to dropping out of school altogether (Austin & continuation high schools in 1 California. It is the first in a Dixon, 2008). Since 1965, state law has mandated that most school series of reports from the on- districts enrolling over 100 12th grade students make available a going California Alternative continuation program or school that provides an alternative route to Education Research Project the high school diploma for youth vulnerable to academic or conducted jointly by the John behavioral failure. The law provides for the creation of continuation W. Gardner Center at Stanford University, the schools ‚designed to meet the educational needs of each pupil, National Center for Urban including, but not limited to, independent study, regional occupation School Transformation at San programs, work study, career counseling, and job placement services.‛ Diego State University, and It contemplates more intensive services and accelerated credit accrual WestEd. strategies so that students whose achievement in comprehensive schools has lagged might have a renewed opportunity to ‚complete the This project was made required academic courses of instruction to graduate from high school.‛ 2 possible by a generous grant from the James Irvine Taken together, the size, scope and legislative design of the Foundation. -
Auction Choice for Ambiguity-Averse Sellers Facing Strategic Uncertainty
Games and Economic Behavior 62 (2008) 155–179 www.elsevier.com/locate/geb Auction choice for ambiguity-averse sellers facing strategic uncertainty Theodore L. Turocy Department of Economics, Texas A&M University, College Station, TX 77843, USA Received 20 December 2006 Available online 29 May 2007 Abstract The robustness of the Bayes–Nash equilibrium prediction for seller revenue in auctions is investigated. In a framework of interdependent valuations generated from independent signals, seller expected revenue may fall well below the equilibrium prediction, even though the individual payoff consequences of suboptimal bidding may be small for each individual bidder. This possibility would be relevant to a seller who models strategic uncertainty as ambiguity, and who is ambiguity-averse in the sense of Gilboa and Schmeidler. It is shown that the second-price auction is more exposed than the first-price auction to lost revenue from the introduction of bidder behavior with small payoff errors. © 2007 Elsevier Inc. All rights reserved. JEL classification: D44; D81 Keywords: Auctions; Strategic uncertainty; Ambiguity aversion; Robustness 1. Introduction Auctions play a multitude of roles within economics and related fields. In deference to their long and broad use as a method of selling or purchasing goods, auction games are presented as one theoretical framework for price formation. This theoretical study, in turn, has begotten the design of custom market mechanisms, which may be auctions in their own right, or which may incorporate an auction as a component. Finally, auctions represent a common ground on which the empirical study of natural markets, the experimental study of auction games in the laboratory and the field all appear. -
Model Uncertainty, Ambiguity Aversion and Implications For
Model Uncertainty, Ambiguity Aversion and Implications for Catastrophe Insurance Market Hua Chen Phone: (215) 204-5905 Email: [email protected] Tao Sun* Phone: (412) 918-6669 Email: [email protected] December 15, 2012 *Please address correspondence to: Tao Sun Department of Risk, Insurance, and Health Management Temple University 1801 Liacouras Walk, 625 Alter Hall Philadelphia, PA 19122 1 Model Uncertainty, Ambiguity Aversion and Implications for Catastrophe Insurance Market Abstract Uncertainty is the inherent nature of catastrophe models because people usually have incomplete knowledge or inaccurate information in regard to such rare events. In this paper we study the decision makers’ aversion to model uncertainty using various entropy measures proposed in microeconomic theory and statistical inferences theory. Under the multiplier utility preference framework and in a static Cournot competition setting, we show that reinsurers’ aversion to catastrophe model uncertainty induces a cost effect resulting in disequilibria, i.e., limited participation, an equilibrium price higher than the actuarially fair price, and possible market break-down in catastrophe reinsurance markets. We show that the tail behavior of catastrophic risks can be modeled by a generalized Pareto distribution through entropy minimization. A well- known fact about catastrophe-linked securities is that they have zero or low correlations with other assets. However, if investors’ aversion to model uncertainty is higher than some threshold level, adding heavy-tailed catastrophic risks into the risk portfolio will have a negative diversification effect. JEL Classification: C0, C1, D8, G0, G2 Key words: Model Uncertainty, Ambiguity Aversion, Catastrophe Insurance Market, Entropy, Generalized Pareto Distribution 2 1. Introduction Catastrophe risk refers to the low-frequency and high-severity risk due to natural catastrophic events, such as hurricane, earthquake and floods, or man-made catastrophic events, such as terrorism attacks. -
RELATIONAL PARAMETRICITY and CONTROL 1. Introduction the Λ
Logical Methods in Computer Science Vol. 2 (3:3) 2006, pp. 1–22 Submitted Dec. 16, 2005 www.lmcs-online.org Published Jul. 27, 2006 RELATIONAL PARAMETRICITY AND CONTROL MASAHITO HASEGAWA Research Institute for Mathematical Sciences, Kyoto University, Kyoto 606-8502 Japan, and PRESTO, Japan Science and Technology Agency e-mail address: [email protected] Abstract. We study the equational theory of Parigot’s second-order λµ-calculus in con- nection with a call-by-name continuation-passing style (CPS) translation into a fragment of the second-order λ-calculus. It is observed that the relational parametricity on the tar- get calculus induces a natural notion of equivalence on the λµ-terms. On the other hand, the unconstrained relational parametricity on the λµ-calculus turns out to be inconsis- tent. Following these facts, we propose to formulate the relational parametricity on the λµ-calculus in a constrained way, which might be called “focal parametricity”. Dedicated to Prof. Gordon Plotkin on the occasion of his sixtieth birthday 1. Introduction The λµ-calculus, introduced by Parigot [26], has been one of the representative term calculi for classical natural deduction, and widely studied from various aspects. Although it still is an active research subject, it can be said that we have some reasonable un- derstanding of the first-order propositional λµ-calculus: we have good reduction theories, well-established CPS semantics and the corresponding operational semantics, and also some canonical equational theories enjoying semantic completeness [16, 24, 25, 36, 39]. The last point cannot be overlooked, as such complete axiomatizations provide deep understand- ing of equivalences between proofs and also of the semantic structure behind the syntactic presentation. -
Continuation Calculus
Eindhoven University of Technology MASTER Continuation calculus Geron, B. Award date: 2013 Link to publication Disclaimer This document contains a student thesis (bachelor's or master's), as authored by a student at Eindhoven University of Technology. Student theses are made available in the TU/e repository upon obtaining the required degree. The grade received is not published on the document as presented in the repository. The required complexity or quality of research of student theses may vary by program, and the required minimum study period may vary in duration. General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain Continuation calculus Master’s thesis Bram Geron Supervised by Herman Geuvers Assessment committee: Herman Geuvers, Hans Zantema, Alexander Serebrenik Final version Contents 1 Introduction 3 1.1 Foreword . 3 1.2 The virtues of continuation calculus . 4 1.2.1 Modeling programs . 4 1.2.2 Ease of implementation . 5 1.2.3 Simplicity . 5 1.3 Acknowledgements . 6 2 The calculus 7 2.1 Introduction . 7 2.2 Definition of continuation calculus . 9 2.3 Categorization of terms . 10 2.4 Reasoning with CC terms . -
Ambiguity Aversion: Experimental Modeling, Evidence, and Implications for Pricing∗
Ambiguity aversion: experimental modeling, evidence, and implications for pricing∗ Jan Pieter Krahnen, Peter Ockenfels, and Christian Wildey August 14, 2013 Abstract This paper provides a systematic analysis of individual attitudes towards ambiguity, based on laboratory experiments. The design of the analysis captures different degrees of ambiguity in various settings, and it allows to disentangle attitudes towards risk and attitudes towards ambiguity. In addition to individual attitudes, the experiments also elicit expectations about other participants' attitudes, allowing us to relate own behav- ior to expectations about others. New measures are introduced for both, the degree of ambiguity in a situation and ambiguity aversion. Ambiguity is embedded in standard utility theory and a parameter of ambiguity aversion is estimated and contrasted to the parameter of risk aversion. The analysis provides a test of theoretical models of ambiguity aversion. The main findings are that ambiguity aversion on average is much more pro- nounced than human aversion against risk and that it is very different across individuals. Moreover, while most theoretical work on ambiguity builds on maxmin expected utility, our results provide evidence that MEU does not adequately capture individual attitudes towards ambiguity. JEL-Classification: D81, G02 Keywords: ambiguity, experimental economics ∗We thank Phelim Boyle and Julian Thimme for valuable comments. We also thank seminar participants at the 2010 annual meeting of Sozialwissenschaftlicher Ausschuss in Erfurt, the 2012 Economic Science Association European Conference in K¨oln,the 2012 Northern Finance Association Conference in Niagara Falls, and the 2012 German Finance Association Conference (DGF) in Hannover for helpful discussions. yCorrespondence: House of Finance, Goethe University Frankfurt, Gr¨uneburgplatz 1 (PF H29), 60323 Frankfurt am Main, Germany, Phone: +49 69 798 33699, E-mails: krahnen@finance.uni-frankfurt.de, ockenfels@finance.uni-frankfurt.de, wilde@finance.uni-frankfurt.de. -
6.5 a Continuation Machine
6.5. A CONTINUATION MACHINE 185 6.5 A Continuation Machine The natural semantics for Mini-ML presented in Chapter 2 is called a big-step semantics, since its only judgment relates an expression to its final value—a “big step”. There are a variety of properties of a programming language which are difficult or impossible to express as properties of a big-step semantics. One of the central ones is that “well-typed programs do not go wrong”. Type preservation, as proved in Section 2.6, does not capture this property, since it presumes that we are already given a complete evaluation of an expression e to a final value v and then relates the types of e and v. This means that despite the type preservation theorem, it is possible that an attempt to find a value of an expression e leads to an intermediate expression such as fst z which is ill-typed and to which no evaluation rule applies. Furthermore, a big-step semantics does not easily permit an analysis of non-terminating computations. An alternative style of language description is a small-step semantics.Themain judgment in a small-step operational semantics relates the state of an abstract machine (which includes the expression to be evaluated) to an immediate successor state. These small steps are chained together until a value is reached. This level of description is usually more complicated than a natural semantics, since the current state must embody enough information to determine the next and all remaining computation steps up to the final answer. -
Compositional Semantics for Composable Continuations from Abortive to Delimited Control
Compositional Semantics for Composable Continuations From Abortive to Delimited Control Paul Downen Zena M. Ariola University of Oregon fpdownen,[email protected] Abstract must fulfill. Of note, Sabry’s [28] theory of callcc makes use of Parigot’s λµ-calculus, a system for computational reasoning about continuation variables that have special properties and can only be classical proofs, serves as a foundation for control operations em- instantiated by callcc. As we will see, this not only greatly aids in bodied by operators like Scheme’s callcc. We demonstrate that the reasoning about terms with free variables, but also helps in relating call-by-value theory of the λµ-calculus contains a latent theory of the equational and operational interpretations of callcc. delimited control, and that a known variant of λµ which unshack- In another line of work, Parigot’s [25] λµ-calculus gives a sys- les the syntax yields a calculus of composable continuations from tem for computing with classical proofs. As opposed to the pre- the existing constructs and rules for classical control. To relate to vious theories based on the λ-calculus with additional primitive the various formulations of control effects, and to continuation- constants, the λµ-calculus begins with continuation variables in- passing style, we use a form of compositional program transforma- tegrated into its core, so that control abstractions and applications tions which preserves the underlying structure of equational the- have the same status as ordinary function abstraction. In this sense, ories, contexts, and substitution. Finally, we generalize the call- the λµ-calculus presents a native language of control.