Priority heuristic

http://dbpedia.org/resource/Priority_heuristic

The priority heuristic is a simple, lexicographic decision strategy that correctly predicts classic violations of expected utility theory such as the Allais paradox, the four-fold pattern, the certainty effect, the possibility effect, or intransitivities. The heuristic maps onto Rubinstein’s three-step model, according to which people first check dominance and stop if it is present, otherwise they check for dissimilarity. To highlight Rubinstein’s model consider the following choice problem: I: 50% chance to win 2,000 50% chance to win nothing II: 52% chance to win 1,000 48% chance to win nothing rdf:langString
rdf:langString Priority heuristic
xsd:integer 59998083
xsd:integer 1072877866
rdf:langString The priority heuristic is a simple, lexicographic decision strategy that correctly predicts classic violations of expected utility theory such as the Allais paradox, the four-fold pattern, the certainty effect, the possibility effect, or intransitivities. The heuristic maps onto Rubinstein’s three-step model, according to which people first check dominance and stop if it is present, otherwise they check for dissimilarity. To highlight Rubinstein’s model consider the following choice problem: I: 50% chance to win 2,000 50% chance to win nothing II: 52% chance to win 1,000 48% chance to win nothing Dominance is absent, and while chances are similar monetary outcomes are not. Rubinstein’s model predicts that people check for dissimilarity and consequently choose Gamble I. Unfortunately, dissimilarity checks are often not decisive, and Rubinstein suggested that people proceed to a third step that he left unspecified. The priority heuristic elaborates on Rubinstein’s framework by specifying this Step 3.
xsd:nonNegativeInteger 6408

data from the linked data cloud