Rational decisions. Chapter 16 1

Similar documents
Rational decisions. Chapter 16. Chapter 16 1

Rational decisions From predicting the effect to optimal intervention

Rational preferences. Rational decisions. Outline. Rational preferences contd. Maximizing expected utility. Preferences

Last update: April 15, Rational decisions. CMSC 421: Chapter 16. CMSC 421: Chapter 16 1

Decision. AI Slides (5e) c Lin

Introduction to Artificial Intelligence Belief networks

CS 380: ARTIFICIAL INTELLIGENCE UNCERTAINTY. Santiago Ontañón

Lecture 14: Introduction to Decision Making

CS Belief networks. Chapter

Bayesian networks. Chapter Chapter

Bayesian networks. Chapter Chapter Outline. Syntax Semantics Parameterized distributions. Chapter

Bayesian networks. Chapter AIMA2e Slides, Stuart Russell and Peter Norvig, Completed by Kazim Fouladi, Fall 2008 Chapter 14.

Bayesian networks: Modeling

Graphical Models - Part I

Outline } Conditional independence } Bayesian networks: syntax and semantics } Exact inference } Approximate inference AIMA Slides cstuart Russell and

Basic Probability and Decisions

Evaluation for Pacman. CS 188: Artificial Intelligence Fall Iterative Deepening. α-β Pruning Example. α-β Pruning Pseudocode.

CS 188: Artificial Intelligence Fall 2008

Belief networks Chapter 15.1í2. AIMA Slides cæstuart Russell and Peter Norvig, 1998 Chapter 15.1í2 1

p(x) p(x Z) = y p(y X, Z) = αp(x Y, Z)p(Y Z)

Graphical Models - Part II

Probabilistic Models Bayesian Networks Markov Random Fields Inference. Graphical Models. Foundations of Data Analysis

Probability and Decision Theory

Course Overview. Summary. Outline

Belief Networks for Probabilistic Inference

Example. Bayesian networks. Outline. Example. Bayesian networks. Example contd. Topology of network encodes conditional independence assertions:

Outline. Bayesian networks. Example. Bayesian networks. Example contd. Example. Syntax. Semantics Parameterized distributions. Chapter 14.

CSE 573: Artificial Intelligence

16.4 Multiattribute Utility Functions

CS 188: Artificial Intelligence Fall Recap: Inference Example

Bayesian networks. AIMA2e Chapter 14

Decision Theory Intro: Preferences and Utility

Local learning in probabilistic networks with hidden variables

4.1. Chapter 4. timing risk information utility

Expected Utility Framework

Choice under Uncertainty

Decision Making Under Uncertainty. First Masterclass

Bayesian network model selection using integer programming

Constraint-Based Querying for Bayesian Network Exploration

Uncertainty & Decision

CS 343: Artificial Intelligence

Weak* Axiom of Independence and the Non-Expected Utility Theory

Review of Probability, Expected Utility

Homework #6 (10/18/2017)

Engineering Decisions

Recitation 7: Uncertainty. Xincheng Qiu

Preference, Choice and Utility

14.12 Game Theory Lecture Notes Theory of Choice

2534 Lecture 2: Utility Theory

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

Ph.D. Preliminary Examination MICROECONOMIC THEORY Applied Economics Graduate Program June 2016

Towards the holy grail in machine learning

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

12735: Urban Systems Modeling. Loss and decisions. instructor: Matteo Pozzi. Lec : Urban Systems Modeling Lec. 11 Loss and decisions

Intro Utility theory Utility & Loss Functions Value of Information Summary. Decision Theory. (CIV Machine Learning for Civil Engineers)

Towards a Theory of Decision Making without Paradoxes

Msc Micro I exam. Lecturer: Todd Kaplan.

Consideration Sets. Mark Dean. Behavioral Economics G6943 Fall 2015

Utility and Decision Making 1

Confronting Theory with Experimental Data and vice versa. Lecture I Choice under risk. The Norwegian School of Economics Nov 7-11, 2011

CS 798: Multiagent Systems

Decision-making with belief functions

1 Uncertainty and Insurance

Range-Dependent Utility

Quantum Decision Theory

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

EE290O / IEOR 290 Lecture 05

ENGI 3423 Introduction to Probability; Sets & Venn Diagrams Page 3-01

Bounded Rationality I: Consideration Sets

Constructing Multiattribute Utility Functions for Decision Analysis

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

Rationality and Uncertainty

Ordinal One-Switch Utility Functions

Choice under uncertainty

Chapter 1 - Preference and choice

Notes on Coursera s Game Theory

Almost essential: Consumption and Uncertainty Probability Distributions MICROECONOMICS

Lecture 04 Decision Making under Certainty: The Tradeoff Problem

ECON4510 Finance Theory Lecture 1

MATH 446/546 Homework 2: Due October 8th, 2014

Fusion of Domain Knowledge with Data for Structural Learning in Object Oriented Domains

Guilt in Games. P. Battigalli and M. Dufwenberg (AER, 2007) Presented by Luca Ferocino. March 21 st,2014

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

Problem Set 4 - Solution Hints

Where are we in CS 440?

Sequential Decisions

UNCERTAINTY. In which we see what an agent should do when not all is crystal-clear.

Recursive Ambiguity and Machina s Examples

Review Basic Probability Concept

Skewed Noise. David Dillenberger 1 Uzi Segal 2. 1 University of Pennsylvania 2 Boston College and WBS

ENGI 4421 Introduction to Probability; Sets & Venn Diagrams Page α 2 θ 1 u 3. wear coat. θ 2 = warm u 2 = sweaty! θ 1 = cold u 3 = brrr!

BAYESIAN NETWORKS AIMA2E CHAPTER (SOME TOPICS EXCLUDED) AIMA2e Chapter (some topics excluded) 1

2 About the value of information

Concepts for decision making under severe uncertainty with partial ordinal and partial cardinal preferences

Birgit Rudloff Operations Research and Financial Engineering, Princeton University

Winter Lecture 10. Convexity and Concavity

Microeconomics MSc. preference relations. Todd R. Kaplan. October University of Haifa. Kaplan (Haifa) micro October / 43

Preference Orderings

Undirected Graphical Models

Analysis of Algorithms. Unit 5 - Intractable Problems

Transcription:

Rational decisions Chapter 16 Chapter 16 1

Rational preferences Utilities Money Multiattribute utilities Decision networks Value of information Outline Chapter 16 2

Preferences An agent chooses among prizes (A, B, etc.) and lotteries, i.e., situations with uncertain prizes p L Lottery L = [p, A; (1 p), B] 1 p A B Notation: A B A preferred to B A B indifference between A and B A B B not preferred to A Chapter 16 3

Rational preferences Idea: preferences of a rational agent must obey constraints. Rational preferences behavior describable as maximization of expected utility Constraints: Orderability (A B) (B A) (A B) Transitivity (A B) (B C) (A C) Continuity A B C p [p, A; 1 p, C] B Substitutability A B [p, A; 1 p, C] [p, B; 1 p, C] Monotonicity A B (p q [p, A; 1 p, B] [q, A; 1 q, B]) Chapter 16 4

Rational preferences contd. Violating the constraints leads to self-evident irrationality For example: an agent with intransitive preferences can be induced to give away all its money If B C, then an agent who has C would pay (say) 1 cent to get B A 1c 1c If A B, then an agent who has B would pay (say) 1 cent to get A If C A, then an agent who has A would pay (say) 1 cent to get C B C 1c Chapter 16 5

Maximizing expected utility Theorem (Ramsey, 1931; von Neumann and Morgenstern, 1944): Given preferences satisfying the constraints there exists a real-valued function U such that U(A) U(B) A B U([p1, S1;... ; pn, Sn]) = Σi piu(si) MEU principle: Choose the action that maximizes expected utility Note: an agent can be entirely rational (consistent with MEU) without ever representing or manipulating utilities and probabilities E.g., a lookup table for perfect tictactoe Chapter 16 6

Utilities Utilities map states to real numbers. Which numbers? Standard approach to assessment of human utilities: compare a given state A to a standard lottery Lp that has best possible prize u with probability p worst possible catastrophe u with probability (1 p) adjust lottery probability p until A Lp pay $30 ~ 0.999999 L 0.000001 continue as before instant death Chapter 16 7

Utility scales Normalized utilities: u = 1.0, u = 0.0 Micromorts: one-millionth chance of death useful for Russian roulette, paying to reduce product risks, etc. QALYs: quality-adjusted life years useful for medical decisions involving substantial risk Note: behavior is invariant w.r.t. +ve linear transformation U (x) = k1u(x) + k2 where k1 > 0 With deterministic prizes only (no lottery choices), only ordinal utility can be determined, i.e., total order on prizes Chapter 16 8

Money Money does not behave as a utility function Given a lottery L with expected monetary value EMV (L), usually U(L) < U(EMV (L)), i.e., people are risk-averse Utility curve: for what probability p am I indifferent between a prize x and a lottery [p, $M; (1 p), $0] for large M? Typical empirical data, extrapolated with risk-prone behavior: +U o o o o o o o o o o o o +$ 150,000 o 800,000 o o Chapter 16 9

Student group utility For each x, adjust p until half the class votes for lottery (M=10,000) p 1.0 0.9 0.8 0.7 0.6 0.5 0.4 0.3 0.2 0.1 0.0 0 500 1000 2000 3000 4000 5000 6000 7000 8000 9000 10000 Chapter 16 10 $x

Decision networks Add action nodes and utility nodes to belief networks to enable rational decision making Airport Site Air Traffic Deaths Litigation Noise U Construction Cost Algorithm: For each value of action node compute expected value of utility node given action, evidence Return MEU action Chapter 16 11

Multiattribute utility How can we handle utility functions of many variables X1... Xn? E.g., what is U(Deaths, Noise, Cost)? How can complex utility functions be assessed from preference behaviour? Idea 1: identify conditions under which decisions can be made without complete identification of U(x1,..., xn) Idea 2: identify various types of independence in preferences and derive consequent canonical forms for U(x1,..., xn) Chapter 16 12

Strict dominance Typically define attributes such that U is monotonic in each Strict dominance: choice B strictly dominates choice A iff i Xi(B) Xi(A) (and hence U(B) U(A)) X 2 This region dominates A X 2 C B B A D A X 1 Deterministic attributes Uncertain attributes Strict dominance seldom holds in practice C X 1 Chapter 16 13

Chapter 16 14 If U is monotonic in x, then A1 with outcome distribution p1 stochastically dominates A2 with outcome distribution p2: p 1(x)U(x)dx p 2(x)U(x)dx Multiattribute case: stochastic dominance on all attributes optimal Distribution p1 stochastically dominates distribution p2 iff t t p 1(x)dx t p 2(t)dt 0-6 -5.5-5 -4.5-4 -3.5-3 -2.5-2 Negative cost 0-6 -5.5-5 -4.5-4 -3.5-3 -2.5-2 Negative cost 0.2 0.2 0.4 Probability S1 S2 0.4 0.6 Probability S1 S2 0.6 0.8 1 0.8 1.2 1 Stochastic dominance

Stochastic dominance contd. Stochastic dominance can often be determined without exact distributions using qualitative reasoning E.g., construction cost increases with distance from city S1 is closer to the city than S2 S1 stochastically dominates S2 on cost E.g., injury increases with collision speed x1, x2 x1 x2 P(Y x1, z) stochastically dominates P(Y x2, z) For every value z of Y s other parents Z X + Y (X positively influences Y ) means that Can annotate belief networks with stochastic dominance information: Chapter 16 15

Label the arcs + or SocioEcon Age GoodStudent Mileage RiskAversion SeniorTrain ExtraCar VehicleYear DrivingSkill MakeModel DrivingHist DrivQuality Antilock Airbag CarValue HomeBase AntiTheft Ruggedness Accident Theft OwnDamage Cushioning OtherCost OwnCost MedicalCost LiabilityCost PropertyCost Chapter 16 16

Label the arcs + or SocioEcon Age GoodStudent Mileage RiskAversion SeniorTrain ExtraCar VehicleYear DrivingSkill MakeModel + DrivingHist DrivQuality Antilock Airbag CarValue HomeBase AntiTheft Ruggedness Accident Theft OwnDamage Cushioning OtherCost OwnCost MedicalCost LiabilityCost PropertyCost Chapter 16 17

Label the arcs + or SocioEcon Age GoodStudent Mileage RiskAversion SeniorTrain + ExtraCar VehicleYear DrivingSkill MakeModel + DrivingHist DrivQuality Antilock Airbag CarValue HomeBase AntiTheft Ruggedness Accident Theft OwnDamage Cushioning OtherCost OwnCost MedicalCost LiabilityCost PropertyCost Chapter 16 18

Label the arcs + or SocioEcon Age GoodStudent Mileage RiskAversion SeniorTrain + ExtraCar VehicleYear DrivingSkill MakeModel + DrivingHist Antilock DrivQuality Airbag CarValue HomeBase AntiTheft Ruggedness Accident Theft OwnDamage Cushioning OtherCost OwnCost MedicalCost LiabilityCost PropertyCost Chapter 16 19

Label the arcs + or SocioEcon Age GoodStudent Mileage RiskAversion SeniorTrain + ExtraCar VehicleYear DrivingSkill MakeModel + DrivingHist Antilock DrivQuality Airbag CarValue HomeBase AntiTheft Ruggedness Accident Theft OwnDamage Cushioning OtherCost OwnCost MedicalCost LiabilityCost PropertyCost Chapter 16 20

Label the arcs + or SocioEcon Age GoodStudent Mileage RiskAversion SeniorTrain + ExtraCar VehicleYear DrivingSkill MakeModel + DrivingHist Antilock DrivQuality Airbag CarValue HomeBase AntiTheft Ruggedness Accident Theft OwnDamage Cushioning OtherCost OwnCost MedicalCost LiabilityCost PropertyCost Chapter 16 21

Preference structure: Deterministic X1 and X2 preferentially independent of X3 iff preference between x1, x2, x3 and x 1, x 2, x3 does not depend on x3 E.g., Noise, Cost, Safety : 20,000 suffer, $4.6 billion, 0.06 deaths/mpm vs. 70,000 suffer, $4.2 billion, 0.06 deaths/mpm Theorem (Leontief, 1947): if every pair of attributes is P.I. of its complement, then every subset of attributes is P.I of its complement: mutual P.I.. Theorem (Debreu, 1960): mutual P.I. additive value function: V (S) = ΣiVi(Xi(S)) Hence assess n single-attribute functions; often a good approximation Chapter 16 22

Preference structure: Stochastic Need to consider preferences over lotteries: X is utility-independent of Y iff preferences over lotteries in X do not depend on y Mutual U.I.: each subset is U.I of its complement multiplicative utility function: U = k1u1 + k2u2 + k3u3 + k1k2u1u2 + k2k3u2u3 + k3k1u3u1 + k1k2k3u1u2u3 Routine procedures and software packages for generating preference tests to identify various canonical families of utility functions Chapter 16 23

Value of information Idea: compute value of acquiring each possible piece of evidence Can be done directly from decision network Example: buying oil drilling rights Two blocks A and B, exactly one has oil, worth k Prior probabilities 0.5 each, mutually exclusive Current price of each block is k/2 Consultant offers accurate survey of A. Fair price? Solution: compute expected value of information = expected value of best action given the information minus expected value of best action without information Survey may say oil in A or no oil in A, prob. 0.5 each (given!) = [0.5 value of buy A given oil in A + 0.5 value of buy B given no oil in A ] 0 = (0.5 k/2) + (0.5 k/2) 0 = k/2 Chapter 16 24

General formula Current evidence E, current best action α Possible action outcomes Si, potential new evidence Ej EU(α E) = max a Σi U(Si) P (Si E, a) Suppose we knew Ej = ejk, then we would choose αe jk s.t. EU(αe jk E, Ej = ejk) = max a Σi U(Si) P (Si E, a, Ej = ejk) Ej is a random variable whose value is currently unknown must compute expected gain over all possible values: V P IE(Ej) = ( Σk P (Ej = ejk E)EU(αe jk E, Ej = ejk) ) EU(α E) (VPI = value of perfect information) Chapter 16 25

Properties of VPI Nonnegative in expectation, not post hoc j, E V P IE(Ej) 0 Nonadditive consider, e.g., obtaining Ej twice V P IE(Ej, Ek) V P IE(Ej) + V P IE(Ek) Order-independent V P IE(Ej, Ek) = V P IE(Ej) + V P IE,Ej (E k) = V P IE(Ek) + V P IE,E k (Ej) Note: when more than one piece of evidence can be gathered, maximizing VPI for each to select one is not always optimal evidence-gathering becomes a sequential decision problem Chapter 16 26

Qualitative behaviors a) Choice is obvious, information worth little b) Choice is nonobvious, information worth a lot c) Choice is nonobvious, information worth little P ( U E j ) P ( U E j ) P ( U E j ) U U U U 2 U 1 U 2 U 1 U 2 U 1 (a) (b) (c) Chapter 16 27