Loading…

Learning to Allocate Limited Time to Decisions with Different Expected Outcomes

The goal of this article is to investigate how human participants allocate their limited time to decisions with different properties. We report the results of two behavioral experiments. In each trial of the experiments, the participant must accumulate noisy information to make a decision. The parti...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2016-07
Main Authors: Khodadadi, Arash, Fakhari, Pegah, Busemeyer, Jerome R
Format: Article
Language:English
Subjects:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Khodadadi, Arash
Fakhari, Pegah
Busemeyer, Jerome R
description The goal of this article is to investigate how human participants allocate their limited time to decisions with different properties. We report the results of two behavioral experiments. In each trial of the experiments, the participant must accumulate noisy information to make a decision. The participants received positive and negative rewards for their correct and incorrect decisions, respectively. The stimulus was designed such that decisions based on more accumulated information were more accurate but took longer. Therefore, the total outcome that a participant could achieve during the limited experiments' time depended on her "decision threshold", the amount of information she needed to make a decision. In the first experiment, two types of trials were intermixed randomly: hard and easy. Crucially, the hard trials were associated with smaller positive and negative rewards than the easy trials. A cue presented at the beginning of each trial would indicate the type of the upcoming trial. The optimal strategy was to adopt a small decision threshold for hard trials. The results showed that several of the participants did not learn this simple strategy. We then investigated how the participants adjusted their decision threshold based on the feedback they received in each trial. To this end, we developed and compared 10 computational models for adjusting the decision threshold. The models differ in their assumptions on the shape of the decision thresholds and the way the feedback is used to adjust the decision thresholds. The results of Bayesian model comparison showed that a model with time-varying thresholds whose parameters are updated by a reinforcement learning algorithm is the most likely model.
format article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2079796177</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2079796177</sourcerecordid><originalsourceid>FETCH-proquest_journals_20797961773</originalsourceid><addsrcrecordid>eNqNykELgjAYgOERBEn5Hwadhbmly2Ok0UHw4l1kfdYnutk2qZ9fQj-g03t43hUJuBBxdDxwviGhcz1jjKeSJ4kISFVCazXqO_WGnobBqNYDLXFEDzda4wgL5KDQodGOvtA_aI5dBxa0p8V7ArWc1eyVGcHtyLprBwfhr1uyvxT1-RpN1jxncL7pzWz1lxrOZCazNJZS_Hd9AOwTPmk</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2079796177</pqid></control><display><type>article</type><title>Learning to Allocate Limited Time to Decisions with Different Expected Outcomes</title><source>Publicly Available Content Database (Proquest) (PQ_SDU_P3)</source><creator>Khodadadi, Arash ; Fakhari, Pegah ; Busemeyer, Jerome R</creator><creatorcontrib>Khodadadi, Arash ; Fakhari, Pegah ; Busemeyer, Jerome R</creatorcontrib><description>The goal of this article is to investigate how human participants allocate their limited time to decisions with different properties. We report the results of two behavioral experiments. In each trial of the experiments, the participant must accumulate noisy information to make a decision. The participants received positive and negative rewards for their correct and incorrect decisions, respectively. The stimulus was designed such that decisions based on more accumulated information were more accurate but took longer. Therefore, the total outcome that a participant could achieve during the limited experiments' time depended on her "decision threshold", the amount of information she needed to make a decision. In the first experiment, two types of trials were intermixed randomly: hard and easy. Crucially, the hard trials were associated with smaller positive and negative rewards than the easy trials. A cue presented at the beginning of each trial would indicate the type of the upcoming trial. The optimal strategy was to adopt a small decision threshold for hard trials. The results showed that several of the participants did not learn this simple strategy. We then investigated how the participants adjusted their decision threshold based on the feedback they received in each trial. To this end, we developed and compared 10 computational models for adjusting the decision threshold. The models differ in their assumptions on the shape of the decision thresholds and the way the feedback is used to adjust the decision thresholds. The results of Bayesian model comparison showed that a model with time-varying thresholds whose parameters are updated by a reinforcement learning algorithm is the most likely model.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Bayesian analysis ; Decisions ; Experiments ; Feedback ; Machine learning ; Mathematical models ; Thresholds</subject><ispartof>arXiv.org, 2016-07</ispartof><rights>2016. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/2079796177?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>780,784,25753,37012,44590</link.rule.ids></links><search><creatorcontrib>Khodadadi, Arash</creatorcontrib><creatorcontrib>Fakhari, Pegah</creatorcontrib><creatorcontrib>Busemeyer, Jerome R</creatorcontrib><title>Learning to Allocate Limited Time to Decisions with Different Expected Outcomes</title><title>arXiv.org</title><description>The goal of this article is to investigate how human participants allocate their limited time to decisions with different properties. We report the results of two behavioral experiments. In each trial of the experiments, the participant must accumulate noisy information to make a decision. The participants received positive and negative rewards for their correct and incorrect decisions, respectively. The stimulus was designed such that decisions based on more accumulated information were more accurate but took longer. Therefore, the total outcome that a participant could achieve during the limited experiments' time depended on her "decision threshold", the amount of information she needed to make a decision. In the first experiment, two types of trials were intermixed randomly: hard and easy. Crucially, the hard trials were associated with smaller positive and negative rewards than the easy trials. A cue presented at the beginning of each trial would indicate the type of the upcoming trial. The optimal strategy was to adopt a small decision threshold for hard trials. The results showed that several of the participants did not learn this simple strategy. We then investigated how the participants adjusted their decision threshold based on the feedback they received in each trial. To this end, we developed and compared 10 computational models for adjusting the decision threshold. The models differ in their assumptions on the shape of the decision thresholds and the way the feedback is used to adjust the decision thresholds. The results of Bayesian model comparison showed that a model with time-varying thresholds whose parameters are updated by a reinforcement learning algorithm is the most likely model.</description><subject>Algorithms</subject><subject>Bayesian analysis</subject><subject>Decisions</subject><subject>Experiments</subject><subject>Feedback</subject><subject>Machine learning</subject><subject>Mathematical models</subject><subject>Thresholds</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNqNykELgjAYgOERBEn5Hwadhbmly2Ok0UHw4l1kfdYnutk2qZ9fQj-g03t43hUJuBBxdDxwviGhcz1jjKeSJ4kISFVCazXqO_WGnobBqNYDLXFEDzda4wgL5KDQodGOvtA_aI5dBxa0p8V7ArWc1eyVGcHtyLprBwfhr1uyvxT1-RpN1jxncL7pzWz1lxrOZCazNJZS_Hd9AOwTPmk</recordid><startdate>20160718</startdate><enddate>20160718</enddate><creator>Khodadadi, Arash</creator><creator>Fakhari, Pegah</creator><creator>Busemeyer, Jerome R</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20160718</creationdate><title>Learning to Allocate Limited Time to Decisions with Different Expected Outcomes</title><author>Khodadadi, Arash ; Fakhari, Pegah ; Busemeyer, Jerome R</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_20797961773</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Algorithms</topic><topic>Bayesian analysis</topic><topic>Decisions</topic><topic>Experiments</topic><topic>Feedback</topic><topic>Machine learning</topic><topic>Mathematical models</topic><topic>Thresholds</topic><toplevel>online_resources</toplevel><creatorcontrib>Khodadadi, Arash</creatorcontrib><creatorcontrib>Fakhari, Pegah</creatorcontrib><creatorcontrib>Busemeyer, Jerome R</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>SciTech Premium Collection (Proquest) (PQ_SDU_P3)</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database (Proquest) (PQ_SDU_P3)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Khodadadi, Arash</au><au>Fakhari, Pegah</au><au>Busemeyer, Jerome R</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Learning to Allocate Limited Time to Decisions with Different Expected Outcomes</atitle><jtitle>arXiv.org</jtitle><date>2016-07-18</date><risdate>2016</risdate><eissn>2331-8422</eissn><abstract>The goal of this article is to investigate how human participants allocate their limited time to decisions with different properties. We report the results of two behavioral experiments. In each trial of the experiments, the participant must accumulate noisy information to make a decision. The participants received positive and negative rewards for their correct and incorrect decisions, respectively. The stimulus was designed such that decisions based on more accumulated information were more accurate but took longer. Therefore, the total outcome that a participant could achieve during the limited experiments' time depended on her "decision threshold", the amount of information she needed to make a decision. In the first experiment, two types of trials were intermixed randomly: hard and easy. Crucially, the hard trials were associated with smaller positive and negative rewards than the easy trials. A cue presented at the beginning of each trial would indicate the type of the upcoming trial. The optimal strategy was to adopt a small decision threshold for hard trials. The results showed that several of the participants did not learn this simple strategy. We then investigated how the participants adjusted their decision threshold based on the feedback they received in each trial. To this end, we developed and compared 10 computational models for adjusting the decision threshold. The models differ in their assumptions on the shape of the decision thresholds and the way the feedback is used to adjust the decision thresholds. The results of Bayesian model comparison showed that a model with time-varying thresholds whose parameters are updated by a reinforcement learning algorithm is the most likely model.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2016-07
issn 2331-8422
language eng
recordid cdi_proquest_journals_2079796177
source Publicly Available Content Database (Proquest) (PQ_SDU_P3)
subjects Algorithms
Bayesian analysis
Decisions
Experiments
Feedback
Machine learning
Mathematical models
Thresholds
title Learning to Allocate Limited Time to Decisions with Different Expected Outcomes
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-30T14%3A33%3A21IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Learning%20to%20Allocate%20Limited%20Time%20to%20Decisions%20with%20Different%20Expected%20Outcomes&rft.jtitle=arXiv.org&rft.au=Khodadadi,%20Arash&rft.date=2016-07-18&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2079796177%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-proquest_journals_20797961773%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2079796177&rft_id=info:pmid/&rfr_iscdi=true