A new tool is presented for measuring beliefs/likelihoods under uncertainty. It will simplify:  preference axiomatizations;  quantitative measurements;

Slides:



Advertisements
Similar presentations
Brief Introduction to Logic. Outline Historical View Propositional Logic : Syntax Propositional Logic : Semantics Satisfiability Natural Deduction : Proofs.
Advertisements

6.896: Topics in Algorithmic Game Theory Lecture 20 Yang Cai.
Argumentation Based on the material due to P. M. Dung, R.A. Kowalski et al.
Copyright © Cengage Learning. All rights reserved.
Bayesian inference “Very much lies in the posterior distribution” Bayesian definition of sufficiency: A statistic T (x 1, …, x n ) is sufficient for 
Chapter 6 Linear Programming: The Simplex Method
Ch 4: Difference Measurement. Difference Measurement In Ch 3 we saw the kind of representation you can get with a concatenation operation on an ordered.
Imperfect commitment Santiago Truffa. Agenda 1.“Authority and communication in Organizations” Wouter Dessein, RES “Contracting for information.
Helsinki University of Technology Systems Analysis Laboratory 1 Dynamic Portfolio Selection under Uncertainty – Theory and Its Applications to R&D valuation.
Certainty Equivalent and Stochastic Preferences June 2006 FUR 2006, Rome Pavlo Blavatskyy Wolfgang Köhler IEW, University of Zürich.
Lecture 4 on Individual Optimization Risk Aversion
Using Prospect Theory to Study Unknown Probabilities ("Ambiguity") by Peter P. Wakker, Econ. Dept., Erasmus Univ. Rotterdam (joint with Mohammed Abdellaoui.
Making Rank-Dependent Utility Tractable for the Study of Ambiguity Peter P. Wakker, June 16, 2005 MSE, Université de Paris I Aim:Make rank-dependent utility.
The Identification Problem Question: Given a set of observed outcomes and covariates, can you estimate a unique set of parameters ? Answer: In general,
1 Empirical Similarity and Objective Probabilities Joint works of subsets of A. Billot, G. Gayer, I. Gilboa, O. Lieberman, A. Postlewaite, D. Samet, D.
Utilitarianism for Agents Who Like Equity, but Dislike Decreases in Income Peter P. Wakker (& Veronika Köbberling)
Ambiguity will concern Dow Jones & Nikkei indexes today: Topic: Quantitative measurement of capacities under ambiguity. Question: How do people perceive.
On Dow Jones & Nikkei indexes today: Peter P. Wakker & Enrico Diecidue & Marcel Zeelenberg This file will be on my homepage on coming Monday. Domain: Decisions.
Combining Bayesian Beliefs and Willingness to Bet to Analyze Attitudes towards Uncertainty by Peter P. Wakker, Econ. Dept., Erasmus Univ. Rotterdam (joint.
Foundations of Measurement Ch 3 & 4 April 4, 2011 presented by Tucker Lentz April 4, 2011 presented by Tucker Lentz.
Uncertainty RUD, June 28, 2006, Peter P. Wakker Paper: Chapter for New Palgrave. Its didactical beginning is not optimal for this specialized audience.
Adapting de Finetti's Proper Scoring Rules for Measuring Subjective Beliefs to Modern Decision Theories of Ambiguity Gijs van de Kuilen, Theo Offerman,
The Byzantine Generals Strike Again Danny Dolev. Introduction We’ll build on the LSP presentation. Prove a necessary and sufficient condition on the network.
Making Choquet Expected Utility Tractable for the Study of Ambiguity Peter P. Wakker, December 20, 2005 Tel-Aviv University Aim:Make Choquet-expected utility,
The problem of sampling error in psychological research We previously noted that sampling error is problematic in psychological research because differences.
On the relationship between Keynes’s conception of evidential weight and the Ellsberg paradox Alberto Feduzi University of Cambridge and University of.
Combining Bayesian Beliefs and Willingness to Bet to Analyze Attitudes towards Uncertainty by Peter P. Wakker, Econ. Dept., Erasmus Univ. Rotterdam (joint.
Behavior in the loss domain : an experiment using the probability trade-off consistency condition Olivier L’Haridon GRID, ESTP-ENSAM.
All of Statistics Chapter 5: Convergence of Random Variables Nick Schafer.
STOCHASTIC DOMINANCE APPROACH TO PORTFOLIO OPTIMIZATION Nesrin Alptekin Anadolu University, TURKEY.
Auction Seminar Optimal Mechanism Presentation by: Alon Resler Supervised by: Amos Fiat.
Math 3121 Abstract Algebra I Section 0: Sets. The axiomatic approach to Mathematics The notion of definition - from the text: "It is impossible to define.
1 A Theoretical Framework for Association Mining based on the Boolean Retrieval Model on the Boolean Retrieval Model Peter Bollmann-Sdorra.
Adapting de Finetti's Proper Scoring Rules for Measuring Bayesian Subjective Probabilities when Those Probabilities Are not Bayesian Peter P. Wakker (&
On the smooth ambiguity model and Machina’s reflection example Robert Nau Fuqua School of Business Duke University.
Basics of Probability. A Bit Math A Probability Space is a triple, where  is the sample space: a non-empty set of possible outcomes; F is an algebra.
Week 15 - Wednesday.  What did we talk about last time?  Review first third of course.
1 Lecture 3 (part 3) Functions – Cardinality Reading: Epp Chp 7.6.
Extending the Definition of Exponents © Math As A Second Language All Rights Reserved next #10 Taking the Fear out of Math 2 -8.
1 Sections 1.5 & 3.1 Methods of Proof / Proof Strategy.
5.3 Geometric Introduction to the Simplex Method The geometric method of the previous section is limited in that it is only useful for problems involving.
1 TABLE OF CONTENTS PROBABILITY THEORY Lecture – 1Basics Lecture – 2 Independence and Bernoulli Trials Lecture – 3Random Variables Lecture – 4 Binomial.
Ambiguity Made Operational by Peter P. Wakker, Econ. Dept., Erasmus Univ. Rotterdam (joint with Mohammed Abdellaoui & Aurélien Baillon) ESA, Tucson, Oct.
Week 11 What is Probability? Quantification of uncertainty. Mathematical model for things that occur randomly. Random – not haphazard, don’t know what.
Ellsberg’s paradoxes: Problems for rank- dependent utility explanations Cherng-Horng Lan & Nigel Harvey Department of Psychology University College London.
12. Consumer Theory Econ 494 Spring 2013.
Lecture 3 on Individual Optimization Uncertainty Up until now we have been treating bidders as expected wealth maximizers, and in that way treating their.
Week 6 - Friday.  What did we talk about last time?  Solving recurrence relations.
Naïve Set Theory. Basic Definitions Naïve set theory is the non-axiomatic treatment of set theory. In the axiomatic treatment, which we will only allude.
Defining Liveness by Bowen Alpern and Fred B. Schneider Presented by Joe Melnyk.
Axiomatic Theory of Probabilistic Decision Making under Risk Pavlo R. Blavatskyy University of Zurich April 21st, 2007.
Savage State-Dependent Expected Utility Lecture IV.
6.853: Topics in Algorithmic Game Theory Fall 2011 Constantinos Daskalakis Lecture 22.
Stat 31, Section 1, Last Time Big Rules of Probability –The not rule –The or rule –The and rule P{A & B} = P{A|B}P{B} = P{B|A}P{A} Bayes Rule (turn around.
Transient Unterdetermination and the Miracle Argument Paul Hoyningen-Huene Leibniz Universität Hannover Center for Philosophy and Ethics of Science (ZEWW)
Inequalities for Stochastic Linear Programming Problems By Albert Madansky Presented by Kevin Byrnes.
Basic probability Sep. 16, Introduction Our formal study of probability will base on Set theory Axiomatic approach (base for all our further studies.
How Should Presidents Be Elected? E. Maskin Institute for Advanced Study.
Negotiating Socially Optimal Allocations of Resources U. Endriss, N. Maudet, F. Sadri, and F. Toni Presented by: Marcus Shea.
Decision Theory Lecture 4. Decision Theory – the foundation of modern economics Individual decision making – under Certainty Choice functions Revelead.
Basic Probability. Introduction Our formal study of probability will base on Set theory Axiomatic approach (base for all our further studies of probability)
1 Decision Analysis Without Consequences, Bayesianism Without Probabilities Robert Nau Fuqua School of Business Duke University Presentation for RUD 2005.
Lecture 9: Query Complexity Tuesday, January 30, 2001.
Probability and statistics - overview Introduction Basics of probability theory Events, probability, different types of probability Random variable, probability.
Von Neumann-Morgenstern Lecture II. Utility and different views of risk Knightian – Frank Knight Risk – known probabilities of events Uncertainty – unknown.
What is Probability? Quantification of uncertainty.
What properties would we expect preferences to exhibit?
Ascertaining certain certainties in choices under uncertainty
Peter P. Wakker & Enrico Diecidue & Marcel Zeelenberg
Risk Chapter 11.
Presentation transcript:

A new tool is presented for measuring beliefs/likelihoods under uncertainty. It will simplify:  preference axiomatizations;  quantitative measurements;  testing and characterizing qualitative properties. A Purely Uncertainty-Oriented Approach to Subjective Expected Utility and its Extensions Peter P. Wakker (& Mohammed Abdellaoui) July 1, 2004; FUR 11, Cachan, France This lecture will be on my homepage on July 8; paper is there already now.

1. Introduction and History Savage (1954): First full-blown decision model for uncertainty (restricted to SEU). Savage‘54 is uncertainty-oriented: - measurement of uncertainty/beliefs was central; - richness (continuity) imposed on state space; - measurement of utility is by-product. Following Debreu (1959) and Arrow (1963), most modern analyses of uncertainty are outcome-oriented: - measurement of utility is first (cf. micro-economics); - richness (continuity) imposed on outcome space; - measurement of uncertainty is indirect. No surprise because:Savage was statistician. Most formal-decision theorists today are economist. 2

3 Uncertainty-oriented references: 1.Expected utility: Savage ‘54, von Neumann-Morgenstern ‘44 (+ Herstein & Milnor ‘53 + Jensen ‘67). 2.Nonexpected utility: - Uncertainty: Gilboa ‘87, Jaffray ‘89, Machina & Schmeidler ’92, Karni ’93, Grant ’95, Epstein & Zhang ’01, Ergin & Gul ’04, Kopylov ‘04 - Risk: Abdellaoui ‘02, Nakamura ‘95.

4 For uncertainty (risk and "ambiguity"): uncertainty-oriented is most natural. We do it systematically. Most general, and simplest, axioms you ever saw! Extra, mathematical, reason for simplicity + generality: It naturally exploits set-theoretic structure on the state space. The idea of our “revealed-likelihood” method can be recognized in Gilboa’s (’87) axiom P2*; our work builds on it, and aims to give intuition to it.

5 2. Notation A AcAc   event A Act, yielding  under A,  under A c. complementary event A c outcome  outcome  Convention:  is a good outcome,  a bad one,   .

6 A AcAc   Act, yielding  under A,  under A c. '' '' Act, yielding  ' under A,  ' under A c. Using one matrix to denote several acts:

7 3. The Basic Idea, Uncertainty- Oriented Measurements

8 Savage/de Finetti revealed likelihood orderings between events, through gambles on these events. Point of departure is outcome level . A AcAc   B BcBc   = ? (remember:    )  Def. If stict preference  for left gamble then: A  b B; Def. If indifference ~ then: A ~ b B; ~ Def. If stict preference  for right gamble then: A  b B.    Gamble on A   Gamble on B Quantifiers: We formally define A  b B if there exist    such that... etc. Choose between two improvements. A is revealed more likely than B (in a basic sense)

9 Under subjective expected utility (SEU): SEU-gain is P(A) ( U(  ) – U(  ) ) SEU-gain is P(B) ( U(  ) – U(  ) ) SEU: A  b B  P(A) > P(B) A ~ b B  P(A) = P(B) A  b B  P(A) < P(B) A AcAc   B BcBc   =     Conclusion: Basic revealed likelihood relations elicit probability orderings.

10 You don’t want contradictions in your measurements: Savage's P4 excludes them for  b. We rename (and weaken) P4 as basic likelihood consistency: NOT [A ~ b B and A  b B] In preferences, for all    and  '   ': A AcAc B BcBc     =     ~ '' '' '' '' = '' '' '' ''  and NOT

11 Obviously: Lemma. SEU  basic likelihood consistency.  Many other models imply basic likelihood consistency also.

Not identity, but equivalence, as point of departure. ? 12 An extension now. A AcAc   B BcBc   =  Def. If indifference ~ then: A ~ B; ~ Def. If stict preference  for right gamble then: A  B.  Under B c not , but any outcomes of any act g result. f ~ g We require ~ (instead of =) as point of departure. Under A c not , but any outcomes of any act f result. f  g  Quantifiers: there exist   , f, g, such that... etc. Def. If stict preference  for left gamble then: A  B; A is revealed more likely than B I hope these defs have some first-sight plausibility …

13 Will definitions always reveal a sensible likelihood ordering? Or will they reveal contradictions (and then signal problems)? Let us try, work on them, and see where they take us.

SEU-gain is P(A)(U(  )–U(  )) SEU-gain is P(A)(U(  )–U(  )) SEU-gain is P(B)(U(  )–U(  )) Preceding (basic) elicitation: A AcAc   B BcBc   = ?     14 Comparison of new with preceding revelation method. Stict preference  for left gamble then: A  B; etc. SEU-gain is P(B)(U(  )–U(  )) ? A AcAc   B BcBc   = f ~ g f  g  New elicitation: A  b B  P(A) > P(B) A ~ b B  P(A) = P(B) A  b B  P(A) < P(B) SEU: Conclusion: Revealed likelihood orderings  elicit probability orderings, as do the basic orderings  b. Also if we drop the subscripts b. Stict preference  for left gamble then: A  b B; etc.

15 Under SEU, revealed likelihood orderings give desirable results. Let us now investigate a general criterion, the analog of Savage’s P4, that revealed likelihood orderings should not run into contradictions.

A AcAc B BcBc  f  g, ~  f  ~ '' f 'f ' '' g', ~ '' f 'f ' '' g'  and 16 Likelihood consistency: NOT [A ~ B and A  B] Same as basic likelihood consistency (  P4), but with subscript b dropped. Directly in terms of preferences: For all   ,  '   ', f, f ', g, g‘, NOT

17 Lemma. SEU  likelihood consistency. General question: When, besides SEU, is revealed likelihood free of contradictions; i.e., when is our measurement instrument OK? Questions to the audience: We assume “usual things,” - weak ordering, - monotonicity on outcomes/events as much as you want. - continuity on outcomes/events as much as you want. Then: how strong is likelihood consistency? Does it imply more than Savage’s P4? If so, what?

18 Hypothesis 1. Likelihood consistency  P4. (No addition; implies no more than dominance.) Hypothesis 2. Likelihood consistency  probabilistic sophistication. (Implies compatibility with disjoint unions.) Hypothesis 3. Likelihood consistency  Choquet expected utility. (Implies compatibility within cumulative events.) Hypothesis 4. Likelihood consistency  Subjective expected utility. go to next slide

A AcAc B BcBc  f  g, ~  f  ~ '' f 'f ' '' g', ~ '' f 'f ' '' g'  and Likelihood consistency: NOT [A ~ B and A  B] Same as basic likelihood consistency (  P4), but with subscript b dropped. Directly in terms of preferences: For all   ,  '   ', f, f ', g, g‘, NOT 19

20 Answer: Hypothesis 4 is correct! Likelihood consistency  subjective expected utility. ( Bayesians: Good news! A new foundation of Bayesianism! Non-Bayesians: Disappointing? Instrument doesn’t bring anything interesting? Please wait. NonEU will result from natural modifications. Comes later. ) For now, we get very simple axiomatization of SEU! To state it, we turn to technical axioms. Here uncertainty-orientedness also gives improvements.

Richness assumed on state space through solvability (as in Gilboa ’87): 21 D f A  L f  g D f A  L f  If ~ D f AA  L f AA  direction of increa- sing preference then ~ holds for some partition A ,A  of A: both preferences  hold, “If improving on the whole event is too much to get ~, then you can improve on a subevent.”

Archimedeanity: If     , and    A  (A “nonnull”), and 22     …    …  A R E 1 … E i  1 E i E i+1 … L     …    …  ~ for all i, then the sequence E i must be finite. Archimedean axiom: The can be no infinite sequences of equally likely disjoint nonnull events. ~ A R E 1 … E i  1 E i E i+1 … L     …    …      …    …  ~     …    …      …    …  we see that E i ~ E i+1 for all i. Clarification: From

23 Monotonicity: f  g if f(s)  g(s) for each state s. Only weak form needed! That’s all. Outcomes can be general; only richness on state space.

24 Theorem [generalizing Savage ’54]. Assume “nondegeneracy“ and solvability, with acts measurable w.r.t. a general algebra of events. Then Subjective expected utility holds if and only if: (i) Weak ordering; (ii) Monotonicity; (iii) Archimedeanity; (iv) Likelihood consistency. Further, P is unique; U is unique up to unit and origin.

25 More general than Savage in a structural sense: Every structure satisfying Savage’s axioms also satisfies our axioms. Not vice versa. We can handle: general algebras (Kopylov earlier & more general here). Equally-likely finite state spaces (with atoms); and no richness in outcomes contrary to Chew & Karni’94, Grodal’76/’03, Gul’92, Wakker’84.. If atomless, then still no convex-rangedness of P. We are not more general in a “logical” sense. Savage’s theorem is not a corollary of ours. Axioms per se are logically independent.

26 Strange thing: Where did cardinality get in??? Outcome-oriented approaches always have to do something extra (linearity, mixtures, midpoints, tradeoffs,...) to get cardinality in. We didn’t. Likelihood consistency seems to concern only ordinal comparisons of likelihood. How come?? Explanation: Likelihood consistency is the dual version of tradeoff consistency for outcomes. The latter concerned differences of utility. Our condition concerns differences of probabilities (or, later, capacities). Those can be restricted to nested events, after which the differences reduce to decision weights, i.e. singular empirical concepts.

27 How use likelihood revelations for nonEU? For those of you who like nonEU: Every violation of SEU can be signaled through a contradictory likelihood revelation. We can classify the contradictions, exclude the ones we don’t like (say the comonotonic violations) and allow for others and, thus, get characterizations and measurements of all those models. So, for generalizing SEU: we have to restrict the permitted likelihood revelations.

28 4. Violations of Likelihood Consistency and Rank-Dependence Yet another axiomatization of rank-dependence!? Well-known; so novelty of our general measurement instrument for uncertainty will be clearer. You can judge it on its didactical merits, i.e. how easy it is. If you don’t know rank-dependence yet: A very simple explanation is coming up. We replace comonotonicity restrictions by “ranking position” conditions.

29 Example. Ellsberg paradox. Urn: $ $ 0   B Y R $ 0 0 R Y B 30 R $1+  $ 0 $ $ 0  ~ B Y R $1+  0 0 $ 0 0 R Y B We can get  >0 s.t.: Reveals Y  Y. Signals that there is a problem! This and Y ~ Y: likelihood consistency is violated. Signals that SEU is violated. 60 B/Y (unknown proportion)

30 We investigate more closely what is going on, from perspective of rank-dependence. Familiar to many of you. Therefore, suited to demonstrate the applicability of revealed likelihood, and uncertainty-orientedness.

31 30 R 60 B/Y $ $ 0   B Y R $ 0 0 R Y B Left acts: Y ranked worse than B. Right acts: Y ranked worse than R. Decision weight of Y depends on ranking position. Y “adds” more to B (giving known probability) than to R. This may explain why Y is weighted more for left acts than for right acts. Basic idea of rank-dependence: the weight of an event can depend on its “ranking position,” i.e. the event yielding better outcomes. Notation: Y B  Y R.

32 In general: Because weight of A depends on its ranking position, we should specify ranking position and write A D instead of A. A D is ranked event. Let us reconsider revealed likelihoods from this perspective.

33 ? ~  Def. If indifference ~ then: A D ~ B D’ ; ~ Def. If stict preference  for right gamble then: A D  B D’.  Def. If stict preference  for left gamble then: A D  B D’ ; A D is revealed more likely than B D’. Again, the concept of study should be ranked events A D, and not just events. Our relation directly reveals decision-weight orderings of ranked events! D A L f  f f  f D’ B L’ g  g g  g increasingly preferred outcomes

34 Ellsberg is fine now. Contradictory Y  Y has been replaced by noncontradictory Y B  Y R ;  (Y B ) >  (Y R ). Lemma. Under Choquet expected utility: A D  B D’   (A D ) >  (B D' ), i.e. || || W(A  D) > W(B  D') – – W(D) W(D') A D ~ B D’   (A D ) =  (B D' ) A D  B D’   (A D ) <  (B D' )  Let us reconsider likelihood consistency, now for ranked events.

g’  ’ g’ f’  ’ f’  increasingly preferred outcomes 35 likelihood consistency: [A ~ B and A  B ] cannot be. Necessary for expected utility. Directly in terms of preferences: For all   ,  '   ', f, f ', g, g‘, Rank-dependent D’ D D increasingly preferred outcomes f  f ~ g  g g  g D A L f  f D' B L' ~ g’  ’ g’f’  ’ f’ ~ Choquet NOT

Further, P is unique; U is unique up to unit and origin. Theorem [generalizing Savage ’54]. Assume “nondegeneracy“ and solvability, with acts measurable w.r.t. a general algebra of events. Then Subjective expected utility holds if and only if: 36 (i) Weak ordering; (ii) Monotonicity; (iii) Archimedeanity; (iv) likelihood consistency. Gilboa ‘87 Choquet Rank-dependent W

More general than Savage in structural sense and also in logical sense: His assumptions and axioms directly imply ours. 37 Gilboa ‘87 Not vice versa. We can handle: general algebras (Kopylov earlier & more general here). Equally-spaced finite state spaces (with atoms). If no atoms, then still no convex-rangedness of P. We are not more general in a “logical” sense. Savage’s theorem is not a corollary of ours. Axioms per se are logically independent. W Likelihood consistency aims to popularize Gilboa's P2*.

Applications for Rank-Dependent Models Rank-dependent revealed likelihood directly observes orderings of decision weights, and is, therefore, a useful tool for analyzing properties of Choquet expected utility. Better-suited than earlier tools because uncertainty- oriented. Quantitative measurements of capacity W: Take "equally likely" partition A 1,...,A n such that A i A 1  …  A i-1 ~ A 1 b for all i. All have decision weight 1/n. Such equally likely ("uniform") partitions could not be defined easily heretofore. 38

Testing qualitative properties of capacity W: Convexity of W falsified if A D  A D  E. Characterizing qualitative properties of W: W is convex iff never A D  A D  E. W 2 more convex/pessimistic/amb.av. than W 1 if (A  F) D ~ 1 A D  E  (A  F) D  2 A D  E ; etc. 39

Applications to Other Studies of Ambiguity Machina & Schmeidler '92, probabilistic sophistication. Let   . 40 A B R B A R   h  A B R B A R  '  ' h'    h ~  '  ' h' ~ Not: A  ms BA  ms B

Epstein & Zhang 2001: T is linearly unambiguous if, for all   , 41  g  f  T R  g  f  NOT: T  T I.e., NOT: Same for T c T A B R   h    h  NOT: Epstein & Zhang 2001: T is unambiguous if, for   , T  T if measured under … specify the restrictions such and such … I.e., not: Same for T c

Conclusion For studying uncertainty, uncertainty orientedness seems to be optimal. Revealed likelihoods: general tool for measuring uncertainty. Everything becomes nicer:  preference axiomatizations;  quantitative measurements;  testing and characterizing qualitative properties; etc. We showed some applications:  Generalizing and simplifying Savage’s ’54 SEU.  Generalizing and simplifying Gilboa’s ’87 CEU.  Quantitative measurements of capacities.  Transparent characterization of convex capacities and more-convex-than.  New interpretations of probabilistic sophistication of M&S’92, unambiguity of E&Z’01. 42