1965
DOI: 10.1037/h0021597
|View full text |Cite
|
Sign up to set email alerts
|

Sequential patterns and maximizing.

Abstract: Most Ss in probability-learning experiments do not maximize, perhaps because they expect sequential patterns. The purpose of this experiment was to determine whether or not the elimination of the objective tenability of sequential dependencies would increase the proportion of maximizing responses. 21 Ss in the experimental condition controlled the random generation of events by the throw of a die so that sequential dependencies were objectively unreasonable. 21 control Ss were presented prearranged sequences, … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

2
32
1

Year Published

1968
1968
2016
2016

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 51 publications
(35 citation statements)
references
References 3 publications
2
32
1
Order By: Relevance
“…Recent research has applied more descriptive versions of repeated choice problems that disclose the relevant outcome probabilities (and sometimes the outcome-generating process) to participants prior to the task-for example, by asking participants to predict the outcomes of repeated rolls of a fair die (Gal & Baron, 1996;James & Koehler, 2011;Newell & Rakow, 2007;Peterson & Ulehla, 1965). Probability matching is typically observed in both variants, but it tends to occur less when the probabilities are known from the start (Fantino & Esfandiari, 2002) and/or when the generating process can be identified as random (Morse & Runquist, 1960;Peterson & Ulehla, 1965).…”
Section: Discussionmentioning
confidence: 99%
See 2 more Smart Citations
“…Recent research has applied more descriptive versions of repeated choice problems that disclose the relevant outcome probabilities (and sometimes the outcome-generating process) to participants prior to the task-for example, by asking participants to predict the outcomes of repeated rolls of a fair die (Gal & Baron, 1996;James & Koehler, 2011;Newell & Rakow, 2007;Peterson & Ulehla, 1965). Probability matching is typically observed in both variants, but it tends to occur less when the probabilities are known from the start (Fantino & Esfandiari, 2002) and/or when the generating process can be identified as random (Morse & Runquist, 1960;Peterson & Ulehla, 1965).…”
Section: Discussionmentioning
confidence: 99%
“…Yet this finding is surprising only if one assumes that people really believe the structure of the sequential choice task to be simple and the outcome sequence to be random. If they do not believe that the outcomes are statistically independent-which seems a reasonable assumption, in light of everyday experiences of repeated events (see, e.g., Ayton & Fischer, 2004)-they might attempt to outperform the static maximizing strategy by finding a predictable pattern in the outcome sequence (Gaissmaier & Schooler, 2008;Peterson & Ulehla, 1965). Because any predictable pattern must match the outcome frequencies, probability matching would occur as a by-product of such an elaborate search, rather than as a strategy per se.…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…As an example, consider the probabilistic contingency experiment, which has many versions in psychology (Fantino & Esfandiari, 2002;Gal & Baron, 1996;Peterson & Ulehla, 1965;Shanks, Tunney, & McCarthy, 2002;Tversky & Edwards, 1966). In one version, the participant sits in front of two lights (one red and one blue) and is told that he or she is to predict which of the lights will be flashed on each trial and that there will be several dozen such trials (participants are often paid money for correct predictions).…”
mentioning
confidence: 99%
“…Peterson & Ulehla (1965) discouraged search for sequential dependencies by having one group of Ss generate the random sequences of events themselves. These Ss showed a significantly greater proportion of maximizing responses than a control group who responded to the same sequences without prior knowledge of their generating source.…”
Section: Dependent Measuresmentioning
confidence: 99%