设计动态竞赛

K. Bimpikis, S. Ehsani, Mohamed Mostagir
{"title":"设计动态竞赛","authors":"K. Bimpikis, S. Ehsani, Mohamed Mostagir","doi":"10.1145/2764468.2764473","DOIUrl":null,"url":null,"abstract":"Innovation contests have emerged as a viable alternative to the standard research and development process. They are particularly suited for settings that feature a high degree of uncertainty regarding the actual feasibility of the end goal. The objective of the contest designer is to maximize the probability of reaching the innovation goal while minimizing the time it takes to complete the project. Obviously here the important question is how to best design these contests. This paper departs from prior literature through three key modeling features. First, in our model, an agent's progress towards the goal is not a deterministic function of effort. As is typically the case in real-world settings, progress is positively correlated with effort but the mapping involves a stochastic component. Secondly and quite importantly, it is possible that the innovation in question is not attainable, either because the goal is actually infeasible or because it requires too much effort and resources that it makes little economic sense to pursue. We model such a scenario by having an underlying state of the world (whether the innovation is attainable or not) over which participants have some prior belief. Taken together, these two features imply that an agent's lack of progress may be attributed to either an undesirable underlying state (the innovation is not attainable) or simply to the fact that the agent was unlucky in how her effort was stochastically mapped to progress. Thirdly, we consider a dynamic framework that captures how competition between agents evolves over time and incorporates the fact that agents learn from each other's partial progress to discern the underlying reason for their own lack of progress. In particular, our modeling setup includes well-defined intermediate milestones that constitute partial progress towards the end goal.","PeriodicalId":376992,"journal":{"name":"Proceedings of the Sixteenth ACM Conference on Economics and Computation","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"86","resultStr":"{\"title\":\"Designing Dynamic Contests\",\"authors\":\"K. Bimpikis, S. Ehsani, Mohamed Mostagir\",\"doi\":\"10.1145/2764468.2764473\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Innovation contests have emerged as a viable alternative to the standard research and development process. They are particularly suited for settings that feature a high degree of uncertainty regarding the actual feasibility of the end goal. The objective of the contest designer is to maximize the probability of reaching the innovation goal while minimizing the time it takes to complete the project. Obviously here the important question is how to best design these contests. This paper departs from prior literature through three key modeling features. First, in our model, an agent's progress towards the goal is not a deterministic function of effort. As is typically the case in real-world settings, progress is positively correlated with effort but the mapping involves a stochastic component. Secondly and quite importantly, it is possible that the innovation in question is not attainable, either because the goal is actually infeasible or because it requires too much effort and resources that it makes little economic sense to pursue. We model such a scenario by having an underlying state of the world (whether the innovation is attainable or not) over which participants have some prior belief. Taken together, these two features imply that an agent's lack of progress may be attributed to either an undesirable underlying state (the innovation is not attainable) or simply to the fact that the agent was unlucky in how her effort was stochastically mapped to progress. Thirdly, we consider a dynamic framework that captures how competition between agents evolves over time and incorporates the fact that agents learn from each other's partial progress to discern the underlying reason for their own lack of progress. In particular, our modeling setup includes well-defined intermediate milestones that constitute partial progress towards the end goal.\",\"PeriodicalId\":376992,\"journal\":{\"name\":\"Proceedings of the Sixteenth ACM Conference on Economics and Computation\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-06-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"86\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Sixteenth ACM Conference on Economics and Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2764468.2764473\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Sixteenth ACM Conference on Economics and Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2764468.2764473","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 86

摘要

创新竞赛已经成为标准研发过程的可行替代方案。它们特别适合于对最终目标的实际可行性具有高度不确定性的设置。竞赛设计者的目标是最大化实现创新目标的可能性,同时最小化完成项目所需的时间。显然,这里的重要问题是如何最好地设计这些竞赛。本文通过三个关键的建模特征与以往文献有所不同。首先,在我们的模型中,智能体朝着目标的进展不是努力的确定性函数。就像在现实世界中的典型情况一样,进度与努力呈正相关,但映射包含随机成分。其次,也是非常重要的一点,我们所讨论的创新可能无法实现,要么是因为目标实际上不可行,要么是因为它需要太多的努力和资源,而追求这些努力和资源在经济上几乎没有意义。我们通过拥有世界的潜在状态(无论创新是否可以实现)来模拟这样的场景,参与者对此有一些先验的信念。综上所述,这两个特征表明,代理缺乏进展可能归因于不受欢迎的潜在状态(创新无法实现),或者仅仅是因为代理不走运,因为她的努力被随机地映射到进展中。第三,我们考虑了一个动态框架,该框架捕捉了智能体之间的竞争如何随着时间的推移而演变,并结合了智能体从彼此的部分进步中学习的事实,以辨别自身缺乏进步的潜在原因。特别是,我们的建模设置包括定义良好的中间里程碑,这些中间里程碑构成了朝向最终目标的部分进展。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Designing Dynamic Contests
Innovation contests have emerged as a viable alternative to the standard research and development process. They are particularly suited for settings that feature a high degree of uncertainty regarding the actual feasibility of the end goal. The objective of the contest designer is to maximize the probability of reaching the innovation goal while minimizing the time it takes to complete the project. Obviously here the important question is how to best design these contests. This paper departs from prior literature through three key modeling features. First, in our model, an agent's progress towards the goal is not a deterministic function of effort. As is typically the case in real-world settings, progress is positively correlated with effort but the mapping involves a stochastic component. Secondly and quite importantly, it is possible that the innovation in question is not attainable, either because the goal is actually infeasible or because it requires too much effort and resources that it makes little economic sense to pursue. We model such a scenario by having an underlying state of the world (whether the innovation is attainable or not) over which participants have some prior belief. Taken together, these two features imply that an agent's lack of progress may be attributed to either an undesirable underlying state (the innovation is not attainable) or simply to the fact that the agent was unlucky in how her effort was stochastically mapped to progress. Thirdly, we consider a dynamic framework that captures how competition between agents evolves over time and incorporates the fact that agents learn from each other's partial progress to discern the underlying reason for their own lack of progress. In particular, our modeling setup includes well-defined intermediate milestones that constitute partial progress towards the end goal.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信