PSYC 221 Lecture Notes - Lecture 13: Availability Heuristic, Representativeness Heuristic, Anchoring

• School: Simon Fraser University
• Department: Psychology
• Course: PSYC 221
• Professor: richard wright

Document Summary

We do(cid:374)"t te(cid:374)d to use pro(cid:271)a(cid:271)ilit(cid:455) (cid:449)he(cid:374) (cid:449)e (cid:373)ake de(cid:272)isio(cid:374)s. The dating game how to use probability when dating: pool of 100 men and they all love you, must reject a man before dating next one, opti(cid:373)al strateg(cid:455) . Date a s(cid:373)all sa(cid:373)ple of the (cid:373)e(cid:374) first: then, the best men in that sample, are an outline of the rest, do(cid:374)"t date a(cid:374)(cid:455)o(cid:374)e (cid:449)ho"s less the(cid:374) the highest of the s(cid:373)all pool. The risks: dating sample might be too small- lead to so(cid:373)eo(cid:374)e (cid:449)ho"s (cid:374)ot the (cid:271)est, might be too large- maybe the best has already passed. Optimal number of sample dates is 36. How we make decisions if we base them only on probability. Help us make decisions sufficiently without extra thought. Denial kahneman = came up with these. Using heuristics, it is faster (cid:271)ut so(cid:373)eti(cid:373)es lead us astra(cid:455) Availability heuristic used to judge the frequency of events.