Optimal Compensation for Data-Sharing in Registration Processes
研究注册程序中数据共享时，模仿者应向创新者支付的最优补偿方案，基于合作博弈的纳什解提出新方案，并与沙普利值和核心进行比较。
Data-sharing is suggested or required in various registration procedures to avoid parallel testing of possibly dangerous substances. The question arises what the optimal compensation of an imitator to the innovator would be under such conditions. In a first arbitration award a scheme to determine the compensation is given. We develop another scheme on the basis of the Nash-solution for cooperative games. This is discussed with respect to the Shapley value and the core of the game.