Optimal Feedback in Contests

Abstract We obtain optimal dynamic contests for environments where the designer monitors effort through coarse, binary signals—Poisson successes—and aims to elicit maximum effort, ideally in the least amount of time possible, given a fixed prize. The designer has a vast set of contests to choose fro...

Full description

Saved in:
Bibliographic Details
Published in:The Review of economic studies 2023-09, Vol.90 (5), p.2370-2394
Main Authors: Ely, Jeffrey C, Georgiadis, George, Khorasani, Sina, Rayo, Luis
Format: Article
Language:English
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c330t-4d302e1a23572f66bf0c1e87319509e58444b26b297ec991102ff5f73785ab9c3
cites cdi_FETCH-LOGICAL-c330t-4d302e1a23572f66bf0c1e87319509e58444b26b297ec991102ff5f73785ab9c3
container_end_page 2394
container_issue 5
container_start_page 2370
container_title The Review of economic studies
container_volume 90
creator Ely, Jeffrey C
Georgiadis, George
Khorasani, Sina
Rayo, Luis
description Abstract We obtain optimal dynamic contests for environments where the designer monitors effort through coarse, binary signals—Poisson successes—and aims to elicit maximum effort, ideally in the least amount of time possible, given a fixed prize. The designer has a vast set of contests to choose from, featuring termination and prize-allocation rules together with real-time feedback for the contestants. Every effort-maximizing contest (which also maximizes total expected successes) has a history-dependent termination rule, a feedback policy that keeps agents fully apprised of their own success, and a prize-allocation rule that grants them, in expectation, a time-invariant share of the prize if they succeed. Any contest that achieves this effort in the shortest possible time must in addition be what we call second chance: once a pre-specified number of successes arrive, the contest enters a countdown phase where contestants are given one last chance to succeed.
doi_str_mv 10.1093/restud/rdac074
format article
fullrecord <record><control><sourceid>oup_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1093_restud_rdac074</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><oup_id>10.1093/restud/rdac074</oup_id><sourcerecordid>10.1093/restud/rdac074</sourcerecordid><originalsourceid>FETCH-LOGICAL-c330t-4d302e1a23572f66bf0c1e87319509e58444b26b297ec991102ff5f73785ab9c3</originalsourceid><addsrcrecordid>eNqFjz1PwzAURS0EEqGwMjFkZXD7nj9ie0QRLUiVuoDEZtmOLRVKE9npwL8nKN2Z7nLv0T2E3CMsEQxf5VjGU7fKnQugxAWpUDSKGq4-LkkFwAVtJFPX5KaUTwBArVVFHnbDuP92h3odY-dd-Kr3x7rtj-MEK7fkKrlDiXfnXJD39fNb-0K3u81r-7SlgXMYqeg4sIiOcalYahqfIGDUiqORYKLUQgjPGs-MisEYRGApyaS40tJ5E_iCLGduyH0pOSY75OlU_rEI9s_Nzm727DYNHudBfxr-6_4C3qBRAA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Optimal Feedback in Contests</title><source>Business Source Ultimate</source><source>EBSCOhost Econlit with Full Text</source><source>Oxford Journals Online</source><creator>Ely, Jeffrey C ; Georgiadis, George ; Khorasani, Sina ; Rayo, Luis</creator><creatorcontrib>Ely, Jeffrey C ; Georgiadis, George ; Khorasani, Sina ; Rayo, Luis</creatorcontrib><description>Abstract We obtain optimal dynamic contests for environments where the designer monitors effort through coarse, binary signals—Poisson successes—and aims to elicit maximum effort, ideally in the least amount of time possible, given a fixed prize. The designer has a vast set of contests to choose from, featuring termination and prize-allocation rules together with real-time feedback for the contestants. Every effort-maximizing contest (which also maximizes total expected successes) has a history-dependent termination rule, a feedback policy that keeps agents fully apprised of their own success, and a prize-allocation rule that grants them, in expectation, a time-invariant share of the prize if they succeed. Any contest that achieves this effort in the shortest possible time must in addition be what we call second chance: once a pre-specified number of successes arrive, the contest enters a countdown phase where contestants are given one last chance to succeed.</description><identifier>ISSN: 0034-6527</identifier><identifier>EISSN: 1467-937X</identifier><identifier>DOI: 10.1093/restud/rdac074</identifier><language>eng</language><publisher>US: Oxford University Press</publisher><ispartof>The Review of economic studies, 2023-09, Vol.90 (5), p.2370-2394</ispartof><rights>The Author(s) 2022. Published by Oxford University Press on behalf of The Review of Economic Studies Limited. 2022</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c330t-4d302e1a23572f66bf0c1e87319509e58444b26b297ec991102ff5f73785ab9c3</citedby><cites>FETCH-LOGICAL-c330t-4d302e1a23572f66bf0c1e87319509e58444b26b297ec991102ff5f73785ab9c3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids></links><search><creatorcontrib>Ely, Jeffrey C</creatorcontrib><creatorcontrib>Georgiadis, George</creatorcontrib><creatorcontrib>Khorasani, Sina</creatorcontrib><creatorcontrib>Rayo, Luis</creatorcontrib><title>Optimal Feedback in Contests</title><title>The Review of economic studies</title><description>Abstract We obtain optimal dynamic contests for environments where the designer monitors effort through coarse, binary signals—Poisson successes—and aims to elicit maximum effort, ideally in the least amount of time possible, given a fixed prize. The designer has a vast set of contests to choose from, featuring termination and prize-allocation rules together with real-time feedback for the contestants. Every effort-maximizing contest (which also maximizes total expected successes) has a history-dependent termination rule, a feedback policy that keeps agents fully apprised of their own success, and a prize-allocation rule that grants them, in expectation, a time-invariant share of the prize if they succeed. Any contest that achieves this effort in the shortest possible time must in addition be what we call second chance: once a pre-specified number of successes arrive, the contest enters a countdown phase where contestants are given one last chance to succeed.</description><issn>0034-6527</issn><issn>1467-937X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><recordid>eNqFjz1PwzAURS0EEqGwMjFkZXD7nj9ie0QRLUiVuoDEZtmOLRVKE9npwL8nKN2Z7nLv0T2E3CMsEQxf5VjGU7fKnQugxAWpUDSKGq4-LkkFwAVtJFPX5KaUTwBArVVFHnbDuP92h3odY-dd-Kr3x7rtj-MEK7fkKrlDiXfnXJD39fNb-0K3u81r-7SlgXMYqeg4sIiOcalYahqfIGDUiqORYKLUQgjPGs-MisEYRGApyaS40tJ5E_iCLGduyH0pOSY75OlU_rEI9s_Nzm727DYNHudBfxr-6_4C3qBRAA</recordid><startdate>20230905</startdate><enddate>20230905</enddate><creator>Ely, Jeffrey C</creator><creator>Georgiadis, George</creator><creator>Khorasani, Sina</creator><creator>Rayo, Luis</creator><general>Oxford University Press</general><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20230905</creationdate><title>Optimal Feedback in Contests</title><author>Ely, Jeffrey C ; Georgiadis, George ; Khorasani, Sina ; Rayo, Luis</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c330t-4d302e1a23572f66bf0c1e87319509e58444b26b297ec991102ff5f73785ab9c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ely, Jeffrey C</creatorcontrib><creatorcontrib>Georgiadis, George</creatorcontrib><creatorcontrib>Khorasani, Sina</creatorcontrib><creatorcontrib>Rayo, Luis</creatorcontrib><collection>CrossRef</collection><jtitle>The Review of economic studies</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ely, Jeffrey C</au><au>Georgiadis, George</au><au>Khorasani, Sina</au><au>Rayo, Luis</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Optimal Feedback in Contests</atitle><jtitle>The Review of economic studies</jtitle><date>2023-09-05</date><risdate>2023</risdate><volume>90</volume><issue>5</issue><spage>2370</spage><epage>2394</epage><pages>2370-2394</pages><issn>0034-6527</issn><eissn>1467-937X</eissn><abstract>Abstract We obtain optimal dynamic contests for environments where the designer monitors effort through coarse, binary signals—Poisson successes—and aims to elicit maximum effort, ideally in the least amount of time possible, given a fixed prize. The designer has a vast set of contests to choose from, featuring termination and prize-allocation rules together with real-time feedback for the contestants. Every effort-maximizing contest (which also maximizes total expected successes) has a history-dependent termination rule, a feedback policy that keeps agents fully apprised of their own success, and a prize-allocation rule that grants them, in expectation, a time-invariant share of the prize if they succeed. Any contest that achieves this effort in the shortest possible time must in addition be what we call second chance: once a pre-specified number of successes arrive, the contest enters a countdown phase where contestants are given one last chance to succeed.</abstract><cop>US</cop><pub>Oxford University Press</pub><doi>10.1093/restud/rdac074</doi><tpages>25</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0034-6527
ispartof The Review of economic studies, 2023-09, Vol.90 (5), p.2370-2394
issn 0034-6527
1467-937X
language eng
recordid cdi_crossref_primary_10_1093_restud_rdac074
source Business Source Ultimate; EBSCOhost Econlit with Full Text; Oxford Journals Online
title Optimal Feedback in Contests
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-02T01%3A44%3A07IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-oup_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Optimal%20Feedback%20in%20Contests&rft.jtitle=The%20Review%20of%20economic%20studies&rft.au=Ely,%20Jeffrey%20C&rft.date=2023-09-05&rft.volume=90&rft.issue=5&rft.spage=2370&rft.epage=2394&rft.pages=2370-2394&rft.issn=0034-6527&rft.eissn=1467-937X&rft_id=info:doi/10.1093/restud/rdac074&rft_dat=%3Coup_cross%3E10.1093/restud/rdac074%3C/oup_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c330t-4d302e1a23572f66bf0c1e87319509e58444b26b297ec991102ff5f73785ab9c3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_oup_id=10.1093/restud/rdac074&rfr_iscdi=true