Decisions under Uncertainty. Logic and Decision Making Unit 1

Size: px
Start display at page:

Download "Decisions under Uncertainty. Logic and Decision Making Unit 1"

Transcription

1 Decisions under Uncertainty Logic and Decision Making Unit 1

2

3 Topics De7inition Principles and rules Examples Axiomatisation Deeper understanding

4 Uncertainty In an uncertain scenario, the decision maker knows what the alternatives are knows what outcomes the alternative result in is unable to assign any probability to the states The most part of our decisions are of this kind

5 Example We are in a restaurant, next to choosing a main course. We have only two optional courses: monk7ish (that, if badly cooked has a terrible taste) and hamburger (any chef can make it eatable) good chef bad chef monk7ish good monk7ish terrible monk7ish hamburger edible hamburger edible hamburger no main course hungry hungry

6 Initial de7initions Let s de7ine an ordinal function v: A S Values such that v(a i, s k ) = 1 means that the value of doing a i in the case the state of the world is s k is 1 Let s try to de7ine the function so that the qualitative outcomes are somehow respected (we need, at least, an ordinal scale) v(monk0ish, good chef) = 4 (the best outcome) v(monk0ish, bad chef) = 1 (the worst outcome) v(hamburger, good chef) = 3, and so on Then: good chef bad chef monk7ish good 4 monk7ish terrible 1 monk7ish hamburger edible 3 hamburger edible 3 hamburger no main course hungry 2 hungry 2

7 Initial de7initions Let s de7ine a relation between acts: a i a j iff it is more rational to perform act a i rather than act a j (and we will say: a i is more rational than a j ) a i a j iff it is at least as rational to perform act a i than act a j (and we will say: a i is more rational than a j ) a i a j iff act a i is equally rational than act a j (and we will say: a i is equally rational as a j ) Note that: a i a j means that (a i a j ) AND NOT(a j a i ) a i a j means that (a i a j ) AND (a j a i )

8 Dominance principle If v(a i, s) v(a j, s) for every state s we say that the act a i dominates the act a j Weak dominance principle: a i a j iff v(a i, s) v(a j, s) for every state s Strong dominance principle: a i a j iff v(a i, s m ) v(a j, s m ) for every state s m, and there is some state s n such that v(a i, s n ) > v(a j, s n ) What are their meanings? (?) It is irrational to choose a state dominated by other states

9 Examples s 1 s 2 a a a s 1 s 2 a a a Does any act dominate the others? (?) 1) v(a 2, s) v(a 3, s) for every state, and v(a 2, s 1 ) > v(a 3, s 1 ) a 2 a 3 2) v(a 1, s) v(a 2, s) for every s, and v(a 1, s 1 ) > v(a 2, s 1 ) a 1 a 2 thus a 1 strongly dominates the other options Does any act dominate the others? (?) a 2 strongly dominates a 3 What about a 1 and a 2? The main argument against the dominance principle: it can be rarely applied, as acts often have good outcomes in some states, bad in others

10 The Maximin principle Let min(a i ) be the value of the worst outcome of a i Maximin principle: a i a j iff min(a i ) min(a j ) Examples: a 3 a i for every other state a i all the states are equally good. What can we do?

11 The Leximin principle Let min 1 (a i ) be the worst value of a i, min 2 (a i ) be the second worst value of a i, and so on. In general, let min n (a i ) be the nth worst value of a i Leximin principle: a i a j iff there is some positive integer n such that min n (a i ) > min n (a j ) and min m (a i ) = min m (a j ) for all m < n Example: a 3 a i for every other state a i

12 The Maximax principle With maximin and leximin we focus on the worst outcomes, but what about the best ones? Let max(a i ) be the value of the best outcome of a i Maximax principle: a i a j iff max(a i ) max(a j ) s 1 s 2 s 3 s 4 a a a a 3 a i for every other state a i

13 Optimism- pessimism rule Is there a possibility to consider both the best and worst outcomes? Let min(a i ) and max(a i ) be the values of the worst and best outcomes of any a i Let the real number α [0, 1] be the degree of optimism (α=0 means maximal pessimism, α=1 means maximal optimism) Optimism- pessimism rule: a i a j iff α max(a i ) + (1 α) min(a i ) > α max(a j ) + (1 α) min(a j ) Note that if α=0 te rule collapses into the maximin rule, while if α=1 it collapses into the maximax rule

14 Improvements Some improvements have been introduced with the optimism- pessimism rule: We pay attention, at the same time, to both the best- case and the worst- case scenarios We have introduced an index (α) for describing the relative importance of outcomes The rule operates in an interval scale (while in the previous principles we needed only ordinal scales) A problem remains: what about the outcomes in between? Example:

15 The Minimax Regret Idea: minimising the maximum amount of regret Let max{r 1, r 2,, r n } be a function that returns the maximum value from the set of real numbers Let max(s i ) be the maximum outcome that is achievable through one of the alternative acts Given a state of the world, let s de7ine the regret as the difference between the outcome under the chosen act and the best outcome obtainable in such state Minimax Regret Principle: a i a j iff max{(v(a i,s 1 ) max(s 1 )), (v(a i,s 2 ) max(s 2 )), } > max{(v(a j,s 1 ) max(s 1 )), (v(a j,s 2 ) max(s 2 )), }

16 Example 1) Max of each column (set {M j }) 2) Subtract M i from each v ij 3) Min of each act (set {m i }) 4) Max of the set {m i } (act a i ) s 1 s 2 s 3 s 4 M 1 =30 M 2 =15 M 3 =30 M 4 =20 Regret matrix m 1 = 18 m 2 = 20 m 3 = 9 m 4 = 11 max{ 18, 20, 9, 11}= 9 à a 3

17 Remarks The minimax regret rule urges to choose an alternative which minimises the maximum regret value The minimax regret rule is parallel to the maximin rule (both involve the same decision: minimising the maximum regret is equivalent to applying the maximin rule to the regret matrix) Objection: irrilevant alternatives may alter the choice between better alternatives. This can be problematic, but can also be disputed and accepted as rational or not?

18 Example a 5 has been added to the previous alternatives M 1 =30 M 2 =15 M 3 =30 M 4 =39

19 Principle of Insuf7icient Reason The rules considered so far focus on maximums and minimums while ignoring the intermediate values and the number of states A solution is to use the Principle of Insuf7icient Reason: if there is no reason to think that one state is more probable than the others, then all states should be considered equally probable and then calculate the expected value, i.e. Principle of Insuf@icient Reason: a i a j iff!!!!! 1!!!!,!! >!!!! 1!!!!,!!!

20 Remarks Is it really rational to assume equal probability between the states (without any other information)? For any set of alternatives? Simmetric acts seem to be required Is it rational to assign greater probability to one of the states?

21 Remarks Decision rules implement different approaches Decision rule Maximin Leximin Maximax pessimism Minimax Regret Insufficient Reason Character of the rule pessimism pessimism varies with index depends on

22 Axiomatic analysis Which rule is the best one? They yield con7licting prescriptions, coming from their different approaches Arguing that one rule is better by purely intuitive considerations seems not enough (intuitions may vary across agents) One possible answer: providing axiomatic justi7ication Formulation of a set of fundamental principles (having intuitive justi7ication) Derive the decision rule that satis7ies them

23 Randomised acts Instead of choosing one option, why not relying on chances? We could introduce a new act, obtained by averaging on the other acts. Example: a 3 would be chosen by? (in class exercise) maximin, leximin, minimax regret and also by optimism- pessimism if α > ½, hence it is the best option but what is its meaning?

24 Axioms Ordering: is transitive and complete transitivity: if a 1 a 2 and a 2 a 3 then a 1 a 3 completeness: any two acts can be ordered Symmetry: the ordering imposed by is independent of the labelling of acts Strict Dominance: better outcomes imply better ranking of one act Continuity: if one act weakly dominates another in a sequence of decision problems under ignorance, then this holds true also in the limit decision problem under ignorance Interval scale: the ordering imposed by remains unaffected by a positive linear transformation of the outcome values

25 Axioms Irrelevant alternatives: the ordering does not change if new alternatives are added Column linearity: if a constant is added to a column, the ordering imposed by remains Column duplication: the ordering imposed by remains if an identical state (column) is added Randomisation: if two acts are equally valuable, then every randomisation between the two acts is also equally valuable Special row adjunction: adding a weakly dominated act does not change the ordering of old acts.

26 Relation between axioms and rules Axioms with necessary and sufficient for the rule Axioms with are Axioms with are

Preference Orderings

Preference Orderings Preference Orderings Resnik xpy the agent prefers x to y ypx the agent prefers y to x xiy the agent is indifferent between x and y Strict preference: xpy just in case the agent prefers x to y and not vice

More information

DECISIONS UNDER UNCERTAINTY

DECISIONS UNDER UNCERTAINTY August 18, 2003 Aanund Hylland: # DECISIONS UNDER UNCERTAINTY Standard theory and alternatives 1. Introduction Individual decision making under uncertainty can be characterized as follows: The decision

More information

Decision Graphs - Influence Diagrams. Rudolf Kruse, Pascal Held Bayesian Networks 429

Decision Graphs - Influence Diagrams. Rudolf Kruse, Pascal Held Bayesian Networks 429 Decision Graphs - Influence Diagrams Rudolf Kruse, Pascal Held Bayesian Networks 429 Descriptive Decision Theory Descriptive Decision Theory tries to simulate human behavior in finding the right or best

More information

Engineering Decisions

Engineering Decisions GSOE9210 vicj@cse.unsw.edu.au www.cse.unsw.edu.au/~gs9210 1 Preferences to values Outline 1 Preferences to values Evaluating outcomes and actions Example (Bus or train?) Would Alice prefer to catch the

More information

Decision Making Under Uncertainty. First Masterclass

Decision Making Under Uncertainty. First Masterclass Decision Making Under Uncertainty First Masterclass 1 Outline A short history Decision problems Uncertainty The Ellsberg paradox Probability as a measure of uncertainty Ignorance 2 Probability Blaise Pascal

More information

Decision Analysis. An insightful study of the decision-making process under uncertainty and risk

Decision Analysis. An insightful study of the decision-making process under uncertainty and risk Decision Analysis An insightful study of the decision-making process under uncertainty and risk Decision Theory A philosophy, articulated by a set of logical axioms and a methodology, for analyzing the

More information

Decision-making with belief functions

Decision-making with belief functions Decision-making with belief functions Thierry Denœux Université de Technologie de Compiègne, France HEUDIASYC (UMR CNRS 7253) https://www.hds.utc.fr/ tdenoeux Fourth School on Belief Functions and their

More information

Axiomatic Decision Theory

Axiomatic Decision Theory Decision Theory Decision theory is about making choices It has a normative aspect what rational people should do... and a descriptive aspect what people do do Not surprisingly, it s been studied by economists,

More information

Decision Theory Final Exam Last name I term: (09:50) Instructor: M. Lewandowski, PhD

Decision Theory Final Exam Last name I term: (09:50) Instructor: M. Lewandowski, PhD Problem 1 [10p] Consider the probability density functions of the following six lotteries l1 l6: PDF l 1 l 2 l 3 l 4 l 5 l 6 2,00 0,00 0,10 0,00 0,50 0,50 0,00 0,00 0,50 0,00 0,50 0,00 0,00 0,90 3,00 0,00

More information

Engineering Decisions

Engineering Decisions GSOE9 vicj@cse.unsw.edu.au www.cse.unsw.edu.au/~gs9 Outline Decision problem classes Decision problems can be classiied based on an agent s epistemic state: Decisions under certainty: the agent knows the

More information

GSOE9210 Engineering Decisions

GSOE9210 Engineering Decisions Sutdent ID: Name: Signature: The University of New South Wales Session 2, 2017 GSOE9210 Engineering Decisions Sample mid-term test Instructions: Time allowed: 1 hour Reading time: 5 minutes This examination

More information

Dominance and Admissibility without Priors

Dominance and Admissibility without Priors Dominance and Admissibility without Priors Jörg Stoye Cornell University September 14, 2011 Abstract This note axiomatizes the incomplete preference ordering that reflects statewise dominance with respect

More information

Professors Blume, Halpern and Easley Econ 476/ December 2004 CIS 576. Final Exam

Professors Blume, Halpern and Easley Econ 476/ December 2004 CIS 576. Final Exam Professors Blume, Halpern and Easley Econ 476/676 10 December 2004 CIS 576 Final Exam INSTRUCTIONS, SCORING: The points for each question are specified at the beginning of the question. There are 160 points

More information

Lecture Notes 1: Decisions and Data. In these notes, I describe some basic ideas in decision theory. theory is constructed from

Lecture Notes 1: Decisions and Data. In these notes, I describe some basic ideas in decision theory. theory is constructed from Topics in Data Analysis Steven N. Durlauf University of Wisconsin Lecture Notes : Decisions and Data In these notes, I describe some basic ideas in decision theory. theory is constructed from The Data:

More information

Uncertain Prospects. How do you model this, so you can make a sensible choice?

Uncertain Prospects. How do you model this, so you can make a sensible choice? Uncertain Prospects Suppose you have to eat at a restaurant and your choices are: chicken quiche Normally you prefer chicken to quiche, but... Now you re uncertain as to whether the chicken has salmonella.

More information

7 INDIVIDUAL AND GROUP DECISION MAKING

7 INDIVIDUAL AND GROUP DECISION MAKING 93 7 INDIVIDUAL AND GROUP DECISION MAKING 7.1 INDIVIDUAL DECISION UNDER UNCERTAINTY Laplace Principle suggests choosing a strategy which is optimal in a situation where the opponent chooses all strategies

More information

arxiv: v1 [cs.ai] 16 Aug 2018

arxiv: v1 [cs.ai] 16 Aug 2018 Decision-Making with Belief Functions: a Review Thierry Denœux arxiv:1808.05322v1 [cs.ai] 16 Aug 2018 Université de Technologie de Compiègne, CNRS UMR 7253 Heudiasyc, Compiègne, France email: thierry.denoeux@utc.fr

More information

Can Everettian Interpretation Survive Continuous Spectrum?

Can Everettian Interpretation Survive Continuous Spectrum? Can Everettian Interpretation Survive Continuous Spectrum? Bryce M. Kim 2016/02/21 Abstract This paper raises a simple continuous spectrum issue in many-worlds interpretation of quantum mechanics, or Everettian

More information

Ranking Specific Sets of Objects

Ranking Specific Sets of Objects Ranking Specific Sets of Objects Jan Maly, Stefan Woltran PPI17 @ BTW 2017, Stuttgart March 7, 2017 Lifting rankings from objects to sets Given A set S A linear order < on S A family X P(S) \ { } of nonempty

More information

Great Expectations. Part I: On the Customizability of Generalized Expected Utility*

Great Expectations. Part I: On the Customizability of Generalized Expected Utility* Great Expectations. Part I: On the Customizability of Generalized Expected Utility* Francis C. Chu and Joseph Y. Halpern Department of Computer Science Cornell University Ithaca, NY 14853, U.S.A. Email:

More information

Uncertainty & Decision

Uncertainty & Decision Uncertainty & Decision von Neumann Morgenstern s Theorem Stéphane Airiau & Umberto Grandi ILLC - University of Amsterdam Stéphane Airiau & Umberto Grandi (ILLC) - Uncertainty & Decision von Neumann Morgenstern

More information

Towards Decision Making under Interval Uncertainty

Towards Decision Making under Interval Uncertainty Journal of Uncertain Systems Vol.1, No.3, pp.00-07, 018 Online at: www.us.org.uk Towards Decision Making under Interval Uncertainty Andrze Pownuk, Vladik Kreinovich Computational Science Program, University

More information

3 Intertemporal Risk Aversion

3 Intertemporal Risk Aversion 3 Intertemporal Risk Aversion 3. Axiomatic Characterization This section characterizes the invariant quantity found in proposition 2 axiomatically. The axiomatic characterization below is for a decision

More information

Lexicographic Refinements in the Context of Possibilistic Decision Theory

Lexicographic Refinements in the Context of Possibilistic Decision Theory Lexicographic Refinements in the Context of Possibilistic Decision Theory Lluis Godo IIIA - CSIC 08193 Bellaterra, Spain godo@iiia.csic.es Adriana Zapico Universidad Nacional de Río Cuarto - CONICET 5800

More information

Notes and Solutions #6 Meeting of 21 October 2008

Notes and Solutions #6 Meeting of 21 October 2008 HAVERFORD COLLEGE PROBLEM SOLVING GROUP 008-9 Notes and Solutions #6 Meeting of October 008 The Two Envelope Problem ( Box Problem ) An extremely wealthy intergalactic charitable institution has awarded

More information

Homework #6 (10/18/2017)

Homework #6 (10/18/2017) Homework #6 (0/8/207). Let G be the set of compound gambles over a finite set of deterministic payoffs {a, a 2,...a n } R +. A decision maker s preference relation over compound gambles can be represented

More information

19. Logic constraints, integer variables

19. Logic constraints, integer variables CS/ECE/ISyE 524 Introduction to Optimization Spring 2016 17 19. Logic constraints, integer variables If-then constraints Generalized assignment problems Logic constraints Modeling a restricted set of values

More information

Economics 201B Economic Theory (Spring 2017) Bargaining. Topics: the axiomatic approach (OR 15) and the strategic approach (OR 7).

Economics 201B Economic Theory (Spring 2017) Bargaining. Topics: the axiomatic approach (OR 15) and the strategic approach (OR 7). Economics 201B Economic Theory (Spring 2017) Bargaining Topics: the axiomatic approach (OR 15) and the strategic approach (OR 7). The axiomatic approach (OR 15) Nash s (1950) work is the starting point

More information

Lecture notes on statistical decision theory Econ 2110, fall 2013

Lecture notes on statistical decision theory Econ 2110, fall 2013 Lecture notes on statistical decision theory Econ 2110, fall 2013 Maximilian Kasy March 10, 2014 These lecture notes are roughly based on Robert, C. (2007). The Bayesian choice: from decision-theoretic

More information

Institute for Advanced Management Systems Research Department of Information Technologies Åbo Akademi University

Institute for Advanced Management Systems Research Department of Information Technologies Åbo Akademi University Institute for Advanced Management Systems Research Department of Information Technologies Åbo Akademi University Decision Making under Uncertainty - Tutorial Directory Robert Fullér Table of Contents Begin

More information

Decision Theory Intro: Preferences and Utility

Decision Theory Intro: Preferences and Utility Decision Theory Intro: Preferences and Utility CPSC 322 Lecture 29 March 22, 2006 Textbook 9.5 Decision Theory Intro: Preferences and Utility CPSC 322 Lecture 29, Slide 1 Lecture Overview Recap Decision

More information

The Simple Theory of Temptation and Self-Control

The Simple Theory of Temptation and Self-Control The Simple Theory of Temptation and Self-Control Faruk Gul and Wolfgang Pesendorfer Princeton University January 2006 Abstract We analyze a two period model of temptation in a finite choice setting. We

More information

Chapter 1 - Preference and choice

Chapter 1 - Preference and choice http://selod.ensae.net/m1 Paris School of Economics (selod@ens.fr) September 27, 2007 Notations Consider an individual (agent) facing a choice set X. Definition (Choice set, "Consumption set") X is a set

More information

Uncertainty. Michael Peters December 27, 2013

Uncertainty. Michael Peters December 27, 2013 Uncertainty Michael Peters December 27, 20 Lotteries In many problems in economics, people are forced to make decisions without knowing exactly what the consequences will be. For example, when you buy

More information

The Axiomatic Method in Social Choice Theory:

The Axiomatic Method in Social Choice Theory: The Axiomatic Method in Social Choice Theory: Preference Aggregation, Judgment Aggregation, Graph Aggregation Ulle Endriss Institute for Logic, Language and Computation University of Amsterdam Ulle Endriss

More information

Mathematical Reasoning & Proofs

Mathematical Reasoning & Proofs Mathematical Reasoning & Proofs MAT 1362 Fall 2018 Alistair Savage Department of Mathematics and Statistics University of Ottawa This work is licensed under a Creative Commons Attribution-ShareAlike 4.0

More information

Arrow s Impossibility Theorem and Experimental Tests of Preference Aggregation

Arrow s Impossibility Theorem and Experimental Tests of Preference Aggregation Arrow s Impossibility Theorem and Experimental Tests of Preference Aggregation Todd Davies Symbolic Systems Program Stanford University joint work with Raja Shah, Renee Trochet, and Katarina Ling Decision

More information

1 Uncertainty and Insurance

1 Uncertainty and Insurance Uncertainty and Insurance Reading: Some fundamental basics are in Varians intermediate micro textbook (Chapter 2). A good (advanced, but still rather accessible) treatment is in Kreps A Course in Microeconomic

More information

Game Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India August 2012

Game Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India August 2012 Game Theory Lecture Notes By Y. Narahari Department of Computer Science and Automation Indian Institute of Science Bangalore, India August 2012 Chapter 7: Von Neumann - Morgenstern Utilities Note: This

More information

Lecture 14: Introduction to Decision Making

Lecture 14: Introduction to Decision Making Lecture 14: Introduction to Decision Making Preferences Utility functions Maximizing exected utility Value of information Actions and consequences So far, we have focused on ways of modeling a stochastic,

More information

Minimax and the Value of Information

Minimax and the Value of Information Minimax and the Value of Information Evan Sadler April 4, 2014 Abstract In his discussion of minimax decision rules, Savage (1954, p. 170) presents an example purporting to show that minimax applied to

More information

5 ProbabilisticAnalysisandRandomized Algorithms

5 ProbabilisticAnalysisandRandomized Algorithms 5 ProbabilisticAnalysisandRandomized Algorithms This chapter introduces probabilistic analysis and randomized algorithms. If you are unfamiliar with the basics of probability theory, you should read Appendix

More information

Qualitative decision making with bipolar information

Qualitative decision making with bipolar information Qualitative decision making with bipolar information Didier Dubois, Hélène Fargier IRIT 118 route de Narbonne 31062 Toulouse Cedex 9, France {dubois,fargier}@irit.fr Abstract Decisions can be evaluated

More information

Decision Theory Without Acts

Decision Theory Without Acts Decision Theory Without Acts Larry Blume Joint work with David Easley & Joe Halpern Decision Theory Without Acts p.1/26 ambiguity / Ambiguity ambiguity: 1. Subjectively: Wavering of opinion; hesitation,

More information

Solution Homework 1 - EconS 501

Solution Homework 1 - EconS 501 Solution Homework 1 - EconS 501 1. [Checking properties of preference relations-i]. Moana and Maui need to find the magical fish hook. Maui lost this weapon after stealing the heart of Te Fiti and his

More information

Choosing the two finalists

Choosing the two finalists Choosing the two finalists Economic Theory ISSN 0938-2259 Volume 46 Number 2 Econ Theory (2010) 46:211-219 DOI 10.1007/ s00199-009-0516-3 1 23 Your article is protected by copyright and all rights are

More information

Computing Minmax; Dominance

Computing Minmax; Dominance Computing Minmax; Dominance CPSC 532A Lecture 5 Computing Minmax; Dominance CPSC 532A Lecture 5, Slide 1 Lecture Overview 1 Recap 2 Linear Programming 3 Computational Problems Involving Maxmin 4 Domination

More information

Learning from Observations. Chapter 18, Sections 1 3 1

Learning from Observations. Chapter 18, Sections 1 3 1 Learning from Observations Chapter 18, Sections 1 3 Chapter 18, Sections 1 3 1 Outline Learning agents Inductive learning Decision tree learning Measuring learning performance Chapter 18, Sections 1 3

More information

CS 380: ARTIFICIAL INTELLIGENCE

CS 380: ARTIFICIAL INTELLIGENCE CS 380: ARTIFICIAL INTELLIGENCE MACHINE LEARNING 11/11/2013 Santiago Ontañón santi@cs.drexel.edu https://www.cs.drexel.edu/~santi/teaching/2013/cs380/intro.html Summary so far: Rational Agents Problem

More information

Basic Math Review for CS1340

Basic Math Review for CS1340 Basic Math Review for CS1340 Dr. Mihail January 15, 2015 (Dr. Mihail) Math Review for CS1340 January 15, 2015 1 / 34 Sets Definition of a set A set is a collection of distinct objects, considered as an

More information

Computations Under Time Constraints: Algorithms Developed for Fuzzy Computations can Help

Computations Under Time Constraints: Algorithms Developed for Fuzzy Computations can Help Journal of Uncertain Systems Vol.6, No.2, pp.138-145, 2012 Online at: www.jus.org.uk Computations Under Time Constraints: Algorithms Developed for Fuzzy Computations can Help Karen Villaverde 1, Olga Kosheleva

More information

Sequential Decisions

Sequential Decisions Sequential Decisions A Basic Theorem of (Bayesian) Expected Utility Theory: If you can postpone a terminal decision in order to observe, cost free, an experiment whose outcome might change your terminal

More information

Preference for Commitment

Preference for Commitment Preference for Commitment Mark Dean Behavioral Economics G6943 Fall 2016 Introduction In order to discuss preference for commitment we need to be able to discuss preferences over menus Interpretation:

More information

Mechanism Design for Resource Bounded Agents

Mechanism Design for Resource Bounded Agents Mechanism Design for Resource Bounded Agents International Conference on Multi-Agent Systems, ICMAS 2000 Noa E. Kfir-Dahav Dov Monderer Moshe Tennenholtz Faculty of Industrial Engineering and Management

More information

Reasoning About Rationality

Reasoning About Rationality Reasoning About Rationality Adam Bjorndahl, Joseph Y. Halpern, Rafael Pass September 22, 2017 Abstract We provide a sound and complete axiomatization for a class of logics appropriate for reasoning about

More information

Basic Math Review for CS4830

Basic Math Review for CS4830 Basic Math Review for CS4830 Dr. Mihail August 18, 2016 (Dr. Mihail) Math Review for CS4830 August 18, 2016 1 / 35 Sets Definition of a set A set is a collection of distinct objects, considered as an object

More information

Revealed Preferences and Utility Functions

Revealed Preferences and Utility Functions Revealed Preferences and Utility Functions Lecture 2, 1 September Econ 2100 Fall 2017 Outline 1 Weak Axiom of Revealed Preference 2 Equivalence between Axioms and Rationalizable Choices. 3 An Application:

More information

Zero-Sum Games Public Strategies Minimax Theorem and Nash Equilibria Appendix. Zero-Sum Games. Algorithmic Game Theory.

Zero-Sum Games Public Strategies Minimax Theorem and Nash Equilibria Appendix. Zero-Sum Games. Algorithmic Game Theory. Public Strategies Minimax Theorem and Nash Equilibria Appendix 2013 Public Strategies Minimax Theorem and Nash Equilibria Appendix Definition Definition A zero-sum game is a strategic game, in which for

More information

Recursive Ambiguity and Machina s Examples

Recursive Ambiguity and Machina s Examples Recursive Ambiguity and Machina s Examples David Dillenberger Uzi Segal May 0, 0 Abstract Machina (009, 0) lists a number of situations where standard models of ambiguity aversion are unable to capture

More information

MULTIPLE CHOICE QUESTIONS DECISION SCIENCE

MULTIPLE CHOICE QUESTIONS DECISION SCIENCE MULTIPLE CHOICE QUESTIONS DECISION SCIENCE 1. Decision Science approach is a. Multi-disciplinary b. Scientific c. Intuitive 2. For analyzing a problem, decision-makers should study a. Its qualitative aspects

More information

Preference for Commitment

Preference for Commitment Preference for Commitment Mark Dean Behavioral Economics Spring 2017 Introduction In order to discuss preference for commitment we need to be able to discuss people s preferences over menus Interpretation:

More information

Evidence with Uncertain Likelihoods

Evidence with Uncertain Likelihoods Evidence with Uncertain Likelihoods Joseph Y. Halpern Cornell University Ithaca, NY 14853 USA halpern@cs.cornell.edu Riccardo Pucella Cornell University Ithaca, NY 14853 USA riccardo@cs.cornell.edu Abstract

More information

Best Guaranteed Result Principle and Decision Making in Operations with Stochastic Factors and Uncertainty

Best Guaranteed Result Principle and Decision Making in Operations with Stochastic Factors and Uncertainty Stochastics and uncertainty underlie all the processes of the Universe. N.N.Moiseev Best Guaranteed Result Principle and Decision Making in Operations with Stochastic Factors and Uncertainty by Iouldouz

More information

Decision Making under Uncertainty using Imprecise Probabilities

Decision Making under Uncertainty using Imprecise Probabilities Matthias C. M. Troffaes. Decision making under uncertainty using imprecise probabilities. International Journal of Approximate Reasoning, 45:17-29, 2007. Decision Making under Uncertainty using Imprecise

More information

Section Summary. Proof by Cases Existence Proofs

Section Summary. Proof by Cases Existence Proofs Section 1.8 1 Section Summary Proof by Cases Existence Proofs Constructive Nonconstructive Disproof by Counterexample Uniqueness Proofs Proving Universally Quantified Assertions Proof Strategies sum up

More information

Analyzing Games with Ambiguous Player Types Using the MINthenMAX Decision Model

Analyzing Games with Ambiguous Player Types Using the MINthenMAX Decision Model Analyzing Games with Ambiguous Player Types Using the MINthenMAX Decision Model (work in progress) Ilan Nehama Tel-Aviv University ilan.nehama@mail.huji.ac.il April 2017 Abstract In many common interactive

More information

Preference Elicitation for Sequential Decision Problems

Preference Elicitation for Sequential Decision Problems Preference Elicitation for Sequential Decision Problems Kevin Regan University of Toronto Introduction 2 Motivation Focus: Computational approaches to sequential decision making under uncertainty These

More information

Sets are one of the basic building blocks for the types of objects considered in discrete mathematics.

Sets are one of the basic building blocks for the types of objects considered in discrete mathematics. Section 2.1 Introduction Sets are one of the basic building blocks for the types of objects considered in discrete mathematics. Important for counting. Programming languages have set operations. Set theory

More information

2534 Lecture 2: Utility Theory

2534 Lecture 2: Utility Theory 2534 Lecture 2: Utility Theory Tutorial on Bayesian Networks: Weds, Sept.17, 5-6PM, PT266 LECTURE ORDERING: Game Theory before MDPs? Or vice versa? Preference orderings Decision making under strict uncertainty

More information

CMU Social choice: Advanced manipulation. Teachers: Avrim Blum Ariel Procaccia (this time)

CMU Social choice: Advanced manipulation. Teachers: Avrim Blum Ariel Procaccia (this time) CMU 15-896 Social choice: Advanced manipulation Teachers: Avrim Blum Ariel Procaccia (this time) Recap A Complexity-theoretic barrier to manipulation Polynomial-time greedy alg can successfully decide

More information

This corresponds to a within-subject experiment: see same subject make choices from different menus.

This corresponds to a within-subject experiment: see same subject make choices from different menus. Testing Revealed Preference Theory, I: Methodology The revealed preference theory developed last time applied to a single agent. This corresponds to a within-subject experiment: see same subject make choices

More information

Refinements - change set of equilibria to find "better" set of equilibria by eliminating some that are less plausible

Refinements - change set of equilibria to find better set of equilibria by eliminating some that are less plausible efinements efinements - change set of equilibria to find "better" set of equilibria by eliminating some that are less plausible Strategic Form Eliminate Weakly Dominated Strategies - Purpose - throwing

More information

Working Papers / Documents de travail. Conditional Expected Utility Criteria for Decision Making under Ignorance or Objective Ambiguity

Working Papers / Documents de travail. Conditional Expected Utility Criteria for Decision Making under Ignorance or Objective Ambiguity Working Papers / Documents de travail Conditional Expected Utility Criteria for Decision Making under Ignorance or Objective Ambiguity Nicolas Gravel Thierry Marchant Arunava Sen WP 2016 - Nr 14 Conditional

More information

Significance Testing with Incompletely Randomised Cases Cannot Possibly Work

Significance Testing with Incompletely Randomised Cases Cannot Possibly Work Human Journals Short Communication December 2018 Vol.:11, Issue:2 All rights are reserved by Stephen Gorard FRSA FAcSS Significance Testing with Incompletely Randomised Cases Cannot Possibly Work Keywords:

More information

Econ 2148, spring 2019 Statistical decision theory

Econ 2148, spring 2019 Statistical decision theory Econ 2148, spring 2019 Statistical decision theory Maximilian Kasy Department of Economics, Harvard University 1 / 53 Takeaways for this part of class 1. A general framework to think about what makes a

More information

Lecture 7. Intro to Statistical Decision Analysis. Example. A numerical measures of outcomes. Today: Valuing outcomes - Utility.

Lecture 7. Intro to Statistical Decision Analysis. Example. A numerical measures of outcomes. Today: Valuing outcomes - Utility. Lecture 7 Professor Scott Schmidler Duke University Today: Valuing outcomes -. Stat 340 TuTh 11:45-1:00 Fall 2016 Reference: Lectures draw heavily from Lindley Making Decisions, 2nd ed. Textbook reading:

More information

Basic Proof Techniques

Basic Proof Techniques Basic Proof Techniques Joshua Wilde, revised by Isabel Tecu, Takeshi Suzuki and María José Boccardi August 13, 2013 1 Basic Notation The following is standard notation for proofs: A B. A implies B. A B.

More information

Maximum likelihood with coarse data. robust optimisation

Maximum likelihood with coarse data. robust optimisation based on robust optimisation Romain Guillaume, Inés Couso, Didier Dubois IRIT, Université Toulouse, France, Universidad de Oviedo, Gijon (Spain) July 10, 2017 Contents Introduction 1 Introduction 2 3 4

More information

13 Social choice B = 2 X X. is the collection of all binary relations on X. R = { X X : is complete and transitive}

13 Social choice B = 2 X X. is the collection of all binary relations on X. R = { X X : is complete and transitive} 13 Social choice So far, all of our models involved a single decision maker. An important, perhaps the important, question for economics is whether the desires and wants of various agents can be rationally

More information

Discrete Mathematics for CS Fall 2003 Wagner Lecture 3. Strong induction

Discrete Mathematics for CS Fall 2003 Wagner Lecture 3. Strong induction CS 70 Discrete Mathematics for CS Fall 2003 Wagner Lecture 3 This lecture covers further variants of induction, including strong induction and the closely related wellordering axiom. We then apply these

More information

An Axiomatic Approach to ``Preference for Freedom of Choice'' 1

An Axiomatic Approach to ``Preference for Freedom of Choice'' 1 journal of economic theory 68, 174199 (1996) article no. 0009 An Axiomatic Approach to ``Preference for Freedom of Choice'' 1 Clemens Puppe Institut fu r Wirtschaftswissenschaften, Universita t Wien, Hohenstaufengasse

More information

Answering. Question Answering: Result. Application of the Theorem Prover: Question. Overview. Question Answering: Example.

Answering. Question Answering: Result. Application of the Theorem Prover: Question. Overview. Question Answering: Example. ! &0/ $% &) &% &0/ $% &) &% 5 % 4! pplication of the Theorem rover: Question nswering iven a database of facts (ground instances) and axioms we can pose questions in predicate calculus and answer them

More information

Lecture 12 November 3

Lecture 12 November 3 STATS 300A: Theory of Statistics Fall 2015 Lecture 12 November 3 Lecturer: Lester Mackey Scribe: Jae Hyuck Park, Christian Fong Warning: These notes may contain factual and/or typographic errors. 12.1

More information

Strategies under Strategic Uncertainty

Strategies under Strategic Uncertainty Discussion Paper No. 18-055 Strategies under Strategic Uncertainty Helene Mass Discussion Paper No. 18-055 Strategies under Strategic Uncertainty Helene Mass Download this ZEW Discussion Paper from our

More information

Judgment Aggregation: June 2018 Project

Judgment Aggregation: June 2018 Project Judgment Aggregation: June 2018 Project Sirin Botan Institute for Logic, Language and Computation University of Amsterdam June 5, 2018 Judgment Aggregation, June 2018: Lecture 2 Sirin Botan 1 / 21 Plan

More information

a + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c.

a + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c. Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called

More information

Properties of the Integers

Properties of the Integers Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called

More information

An axiomatic characterization of the prudent order preference function

An axiomatic characterization of the prudent order preference function An axiomatic characterization of the prudent order preference function Claude Lamboray Abstract In this paper, we are interested in a preference function that associates to a profile of linear orders the

More information

Prentice Hall Mathematics, Geometry 2009 Correlated to: Connecticut Mathematics Curriculum Framework Companion, 2005 (Grades 9-12 Core and Extended)

Prentice Hall Mathematics, Geometry 2009 Correlated to: Connecticut Mathematics Curriculum Framework Companion, 2005 (Grades 9-12 Core and Extended) Grades 9-12 CORE Algebraic Reasoning: Patterns And Functions GEOMETRY 2009 Patterns and functional relationships can be represented and analyzed using a variety of strategies, tools and technologies. 1.1

More information

Lecture 4 : Conditional Probability and Bayes Theorem 0/ 26

Lecture 4 : Conditional Probability and Bayes Theorem 0/ 26 0/ 26 The conditional sample space Motivating examples 1. Roll a fair die once 1 2 3 S = 4 5 6 Let A = 6 appears B = an even number appears So P(A) = 1 6 P(B) = 1 2 1/ 26 Now what about P ( 6 appears given

More information

Preference, Choice and Utility

Preference, Choice and Utility Preference, Choice and Utility Eric Pacuit January 2, 205 Relations Suppose that X is a non-empty set. The set X X is the cross-product of X with itself. That is, it is the set of all pairs of elements

More information

Relative Benefit Equilibrating Bargaining Solution and the Ordinal Interpretation of Gauthier s Arbitration Scheme

Relative Benefit Equilibrating Bargaining Solution and the Ordinal Interpretation of Gauthier s Arbitration Scheme Relative Benefit Equilibrating Bargaining Solution and the Ordinal Interpretation of Gauthier s Arbitration Scheme Mantas Radzvilas July 2017 Abstract In 1986 David Gauthier proposed an arbitration scheme

More information

In this article, we show that total act utilitarianism can be derived

In this article, we show that total act utilitarianism can be derived consequentialism to utilitarianism 403 FROM CONSEQUENTIALISM TO UTILITARIANISM* In this article, we show that total act utilitarianism can be derived from a set of axioms that are (or ought to be) acceptable

More information

Intertemporal Risk Aversion, Stationarity, and Discounting

Intertemporal Risk Aversion, Stationarity, and Discounting Traeger, CES ifo 10 p. 1 Intertemporal Risk Aversion, Stationarity, and Discounting Christian Traeger Department of Agricultural & Resource Economics, UC Berkeley Introduce a more general preference representation

More information

Hypothetical Bargaining and Equilibrium Refinement in Non-Cooperative Games

Hypothetical Bargaining and Equilibrium Refinement in Non-Cooperative Games Hypothetical Bargaining and Equilibrium Refinement in Non-Cooperative Games Mantas Radzvilas December 2016 Abstract Virtual bargaining theory suggests that social agents aim to resolve non-cooperative

More information

1 Uncertainty. These notes correspond to chapter 2 of Jehle and Reny.

1 Uncertainty. These notes correspond to chapter 2 of Jehle and Reny. These notes correspond to chapter of Jehle and Reny. Uncertainty Until now we have considered our consumer s making decisions in a world with perfect certainty. However, we can extend the consumer theory

More information

Econ 101A Problem Set 6 Solutions Due on Monday Dec. 9. No late Problem Sets accepted, sorry!

Econ 101A Problem Set 6 Solutions Due on Monday Dec. 9. No late Problem Sets accepted, sorry! Econ 0A Problem Set 6 Solutions Due on Monday Dec. 9. No late Problem Sets accepted, sry! This Problem set tests the knowledge that you accumulated mainly in lectures 2 to 26. The problem set is focused

More information

Rationality and Uncertainty

Rationality and Uncertainty Rationality and Uncertainty Based on papers by Itzhak Gilboa, Massimo Marinacci, Andy Postlewaite, and David Schmeidler Warwick Aug 23, 2013 Risk and Uncertainty Dual use of probability: empirical frequencies

More information

Individual decision-making under certainty

Individual decision-making under certainty Individual decision-making under certainty Objects of inquiry Our study begins with individual decision-making under certainty Items of interest include: Feasible set Objective function (Feasible set R)

More information

ZEROS OF POLYNOMIAL FUNCTIONS ALL I HAVE TO KNOW ABOUT POLYNOMIAL FUNCTIONS

ZEROS OF POLYNOMIAL FUNCTIONS ALL I HAVE TO KNOW ABOUT POLYNOMIAL FUNCTIONS ZEROS OF POLYNOMIAL FUNCTIONS ALL I HAVE TO KNOW ABOUT POLYNOMIAL FUNCTIONS TOOLS IN FINDING ZEROS OF POLYNOMIAL FUNCTIONS Synthetic Division and Remainder Theorem (Compressed Synthetic Division) Fundamental

More information