重新激励发现:研究中部分进展分享的机制

Siddhartha Banerjee, Ashish Goel, A. Krishnaswamy
{"title":"重新激励发现:研究中部分进展分享的机制","authors":"Siddhartha Banerjee, Ashish Goel, A. Krishnaswamy","doi":"10.1145/2600057.2602888","DOIUrl":null,"url":null,"abstract":"An essential primitive for an efficient research ecosystem is partial-progress sharing (PPS) -- whereby a researcher shares information immediately upon making a breakthrough. This helps prevent duplication of work; however there is evidence that existing reward structures in research discourage partial-progress sharing. Ensuring PPS is especially important for new online collaborative-research platforms, which involve many researchers working on large, multi-stage problems. We study the problem of incentivizing information-sharing in research, under a stylized model: non-identical agents work independently on subtasks of a large project, with dependencies between subtasks captured via an acyclic subtask-network. Each subtask carries a reward, given to the first agent who publicly shares its solution. Agents can choose which subtasks to work on, and more importantly, when to reveal solutions to completed subtasks. Under this model, we uncover the strategic rationale behind certain anecdotal phenomena. Moreover, for any acyclic subtask-network, and under a general model of agent-subtask completion times, we give sufficient conditions that ensure PPS is incentive-compatible for all agents. One surprising finding is that rewards which are approximately proportional to perceived task-difficulties, are sufficient to ensure PPS in all acyclic subtask-networks. The fact that there is no tension between local fairness and global information-sharing in multi-stage projects is encouraging, as it suggests practical mechanisms for real-world settings. Finally, we also characterize the efficiency of PPS -- we show that PPS is necessary, and in many cases, sufficient, to ensure a high rate of progress in research.","PeriodicalId":203155,"journal":{"name":"Proceedings of the fifteenth ACM conference on Economics and computation","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"Re-incentivizing discovery: mechanisms for partial-progress sharing in research\",\"authors\":\"Siddhartha Banerjee, Ashish Goel, A. Krishnaswamy\",\"doi\":\"10.1145/2600057.2602888\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An essential primitive for an efficient research ecosystem is partial-progress sharing (PPS) -- whereby a researcher shares information immediately upon making a breakthrough. This helps prevent duplication of work; however there is evidence that existing reward structures in research discourage partial-progress sharing. Ensuring PPS is especially important for new online collaborative-research platforms, which involve many researchers working on large, multi-stage problems. We study the problem of incentivizing information-sharing in research, under a stylized model: non-identical agents work independently on subtasks of a large project, with dependencies between subtasks captured via an acyclic subtask-network. Each subtask carries a reward, given to the first agent who publicly shares its solution. Agents can choose which subtasks to work on, and more importantly, when to reveal solutions to completed subtasks. Under this model, we uncover the strategic rationale behind certain anecdotal phenomena. Moreover, for any acyclic subtask-network, and under a general model of agent-subtask completion times, we give sufficient conditions that ensure PPS is incentive-compatible for all agents. One surprising finding is that rewards which are approximately proportional to perceived task-difficulties, are sufficient to ensure PPS in all acyclic subtask-networks. The fact that there is no tension between local fairness and global information-sharing in multi-stage projects is encouraging, as it suggests practical mechanisms for real-world settings. Finally, we also characterize the efficiency of PPS -- we show that PPS is necessary, and in many cases, sufficient, to ensure a high rate of progress in research.\",\"PeriodicalId\":203155,\"journal\":{\"name\":\"Proceedings of the fifteenth ACM conference on Economics and computation\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the fifteenth ACM conference on Economics and computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2600057.2602888\",\"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 fifteenth ACM conference on Economics and computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2600057.2602888","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

摘要

高效研究生态系统的基本要素是部分进展共享(PPS),即研究人员在取得突破后立即共享信息。这有助于防止重复工作;然而,有证据表明,现有的研究奖励结构阻碍了部分进展的分享。确保PPS对于新的在线合作研究平台尤其重要,因为这些平台涉及许多研究人员在大型、多阶段的问题上工作。我们研究了在研究中激励信息共享的问题,在一个程式化的模型下:不相同的代理独立地在一个大型项目的子任务上工作,子任务之间的依赖关系通过一个非循环子任务网络捕获。每个子任务都有奖励,奖励给第一个公开分享其解决方案的代理。代理可以选择处理哪些子任务,更重要的是,何时显示已完成子任务的解决方案。在这个模型下,我们揭示了某些轶事现象背后的战略原理。此外,对于任意非循环子任务网络,在agent-子任务完成时间的一般模型下,我们给出了保证PPS对所有agent是激励相容的充分条件。一个令人惊讶的发现是,与感知任务难度大致成比例的奖励,足以确保所有非循环子任务网络中的PPS。在多阶段项目中,本地公平和全球信息共享之间没有紧张关系,这一事实令人鼓舞,因为它为现实世界的设置提供了实用的机制。最后,我们还描述了PPS的效率——我们表明PPS是必要的,在许多情况下,是足够的,以确保研究的高进展速度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Re-incentivizing discovery: mechanisms for partial-progress sharing in research
An essential primitive for an efficient research ecosystem is partial-progress sharing (PPS) -- whereby a researcher shares information immediately upon making a breakthrough. This helps prevent duplication of work; however there is evidence that existing reward structures in research discourage partial-progress sharing. Ensuring PPS is especially important for new online collaborative-research platforms, which involve many researchers working on large, multi-stage problems. We study the problem of incentivizing information-sharing in research, under a stylized model: non-identical agents work independently on subtasks of a large project, with dependencies between subtasks captured via an acyclic subtask-network. Each subtask carries a reward, given to the first agent who publicly shares its solution. Agents can choose which subtasks to work on, and more importantly, when to reveal solutions to completed subtasks. Under this model, we uncover the strategic rationale behind certain anecdotal phenomena. Moreover, for any acyclic subtask-network, and under a general model of agent-subtask completion times, we give sufficient conditions that ensure PPS is incentive-compatible for all agents. One surprising finding is that rewards which are approximately proportional to perceived task-difficulties, are sufficient to ensure PPS in all acyclic subtask-networks. The fact that there is no tension between local fairness and global information-sharing in multi-stage projects is encouraging, as it suggests practical mechanisms for real-world settings. Finally, we also characterize the efficiency of PPS -- we show that PPS is necessary, and in many cases, sufficient, to ensure a high rate of progress in research.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信