@inproceedings{Neth2004strai-28394,
  year={2004},
  title={You can't play straight TRACS and win : memory updates in a dynamic Task environment},
  isbn={0-8058-5464-9},
  address={Chicago},
  booktitle={CogSci 2004 proceedings : [proceedings of the twenty-sixth annual conference of the Cognitive Science Society, August 4 - 7, 2004, Chicago, Illinois, USA]},
  pages={1017--1022},
  editor={Cognitive Science Society},
  author={Neth, Hansjörg and Sims, Chris R. and Veksler, Vladislav D. and Gray, Wayne D.}
}

<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/28394">
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/28394/1/Neth_283943.pdf"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:creator>Neth, Hansjörg</dc:creator>
    <dc:contributor>Sims, Chris R.</dc:contributor>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/28394/1/Neth_283943.pdf"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2014-07-23T10:15:10Z</dcterms:available>
    <dcterms:issued>2004</dcterms:issued>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/43"/>
    <dcterms:abstract xml:lang="eng">To investigate people's ability to update memory in a dynamic task environment we use the experimental card game TRACSTM (Burns, 2001). In many card games card counting is a component of optimal performance. However, for TRACS, Burns (2002a) reported that players exhibited a base- line bias: rather than basing their choices on the actual num- ber of cards remaining in the deck, they chose cards based on the initial composition of the deck. Both a task analysis and computer simulation show that a perfectly executed memory update strategy has minimal value in the original game, suggesting that a baseline strategy is a rational adaptation to the demands of the original game. We then redesign the game to maximize the difference in performance between baseline and update strategies. An empirical study with the new game shows that players perform much better than could be achieved by a baseline strategy. Hence, we conclude that people will adopt a memory update strategy when the benefits outweigh the costs.</dcterms:abstract>
    <dc:language>eng</dc:language>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2014-07-23T10:15:10Z</dc:date>
    <dc:contributor>Neth, Hansjörg</dc:contributor>
    <dc:creator>Sims, Chris R.</dc:creator>
    <dcterms:bibliographicCitation>CogSci 2004 proceedings : [proceedings of the twenty-sixth annual conference of the Cognitive Science Society, August 4 - 7, 2004, Chicago, Illinois, USA] / Cognitive Science Society. - Chicago, Ill., 2004. - S. 1017-1022. - ISBN 0-8058-5464-9</dcterms:bibliographicCitation>
    <dcterms:title>You can't play straight TRACS and win : memory updates in a dynamic Task environment</dcterms:title>
    <dc:contributor>Veksler, Vladislav D.</dc:contributor>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/28394"/>
    <dc:contributor>Gray, Wayne D.</dc:contributor>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dc:creator>Veksler, Vladislav D.</dc:creator>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/43"/>
    <dc:creator>Gray, Wayne D.</dc:creator>
    <dc:rights>terms-of-use</dc:rights>
  </rdf:Description>
</rdf:RDF>