Complexity effects on the children's gambling task
File version
Author(s)
Andrews, Glenda
Halford, Graeme S
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Deanna Kuhn
Date
Size
26147 bytes
80855 bytes
File type(s)
text/plain
application/pdf
Location
License
Abstract
The Children's Gambling Task (CGT, Kerr & Zelazo, 2004) involves integrating information about losses and gains to maximize winnings when selecting cards from two decks. Both Cognitive Complexity and Control (CCC) theory and Relational Complexity (RC) theory attribute younger children's difficulty to task complexity. In CCC theory, identification of the advantageous deck requires formulation of a higher-order rule so that gains and losses can be considered in contradistinction. According to RC theory, it entails processing the ternary relation linking three variables (deck, magnitude of gain, magnitude of loss). We designed two less complex binary-relational versions in which either loss or gain varied across decks, with the other held constant. The three closely matched versions were administered to 3-, 4-, and 5-year-olds. Consistent with complexity explanations, children in all age groups selected cards from the advantageous deck in the binary-relational versions, but only 5-year-olds did so on the ternary-relational CGT.
Journal Title
Cognitive Development
Conference Title
Book Title
Edition
Volume
22
Issue
3
Thesis Type
Degree Program
School
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
© 2007 Elsevier. Please refer to the journal's website for access to the definitive, published version.
Item Access Status
Note
Access the data
Related item(s)
Subject
Cognitive and computational psychology