空格(标点符号)
可靠性
竞赛
经验法则
计算机科学
班级(哲学)
启发式
过程(计算)
业务
营销
运筹学
数学
政治学
人工智能
法学
算法
操作系统
作者
Sanjiv Erat,Vish Krishnan
出处
期刊:Management Science
[Institute for Operations Research and the Management Sciences]
日期:2011-09-21
卷期号:58 (3): 606-623
被引量:132
标识
DOI:10.1287/mnsc.1110.1418
摘要
Organizations increasingly seek solutions to their open-ended design problems by employing a contest approach in which search over a solution space is delegated to outside agents. We study this new class of problems, which are costly to specify, pose credibility issues for the focal firm, and require finely tuned awards for meeting the firm's needs. Through an analytical model, we examine the relationship between problem specification, award structure, and breadth of solution space searched by outside agents toward characterizing how a firm should effectively manage such open-ended design contests. Our results independently establish and offer a causal explanation for an interesting phenomenon observed in design contests—clustering of searchers in specific regions of the solution space. The analysis also yields a cautionary finding—although the breadth of search increases with number of searchers, the relationship is strongly sublinear (logarithmic). Finally, from the practical perspective of managing the delegated search process, our results offer rules of thumb on how many and what size awards should be offered, as well as the extent to which firms should undertake problem specification, contingent on the nature (open-endedness and uncertainty) of the design problem solution being delegated to outside agents. This paper was accepted by Kamalini Ramdas, entrepreneurship and innovation.
科研通智能强力驱动
Strongly Powered by AbleSci AI