Show simple item record

dc.contributor.authorLoewenstein, Yonatan
dc.contributor.authorPrelec, Drazen
dc.contributor.authorSeung, H. Sebastian
dc.date.accessioned2011-01-19T13:59:45Z
dc.date.available2011-01-19T13:59:45Z
dc.date.issued2009-09
dc.identifier.issn0899-7667
dc.identifier.issn1530-888X
dc.identifier.urihttp://hdl.handle.net/1721.1/60661
dc.description.abstractOver the past several decades, economists, psychologists, and neuroscientists have conducted experiments in which a subject, human or animal, repeatedly chooses between alternative actions and is rewarded based on choice history. While individual choices are unpredictable, aggregate behavior typically follows Herrnstein's matching law: the average reward per choice is equal for all chosen alternatives. In general, matching behavior does not maximize the overall reward delivered to the subject, and therefore matching appears inconsistent with the principle of utility maximization. Here we show that matching can be made consistent with maximization by regarding the choices of a single subject as being made by a sequence of multiple selves—one for each instant of time. If each self is blind to the state of the world and discounts future rewards completely, then the resulting game has at least one Nash equilibrium that satisfies both Herrnstein's matching law and the unpredictability of individual choices. This equilibrium is, in general, Pareto suboptimal, and can be understood as a mutual defection of the multiple selves in an intertemporal prisoner's dilemma.en_US
dc.description.sponsorshipHoward Hughes Medical Instituteen_US
dc.description.sponsorshipIsrael Science Foundation (grant no. 868/08)en_US
dc.language.isoen_US
dc.publisherMIT Pressen_US
dc.relation.isversionofhttp://dx.doi.org/10.1162/neco.2009.09-08-854en_US
dc.rightsArticle is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.en_US
dc.sourceMIT web domainen_US
dc.titleOperant Matching as a Nash Equilibrium of an Intertemporal Gameen_US
dc.typeArticleen_US
dc.identifier.citationLoewenstein, Yonatan, Drazen Prelec, and H. Sebastian Seung. “Operant Matching as a Nash Equilibrium of an Intertemporal Game.” Neural Computation 21.10 (2009): 2755-2773. © 2011 The MIT Pressen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Brain and Cognitive Sciencesen_US
dc.contributor.departmentSloan School of Managementen_US
dc.contributor.approverSeung, H. Sebastian
dc.contributor.mitauthorPrelec, Drazen
dc.contributor.mitauthorSeung, H. Sebastian
dc.relation.journalNeural Computationen_US
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dspace.orderedauthorsLoewenstein, Yonatan; Prelec, Drazen; Seung, H. Sebastianen
dc.identifier.orcidhttps://orcid.org/0000-0002-9507-5368
mit.licensePUBLISHER_POLICYen_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record