arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2601.19331econ.TH
收藏

极值点与大规模竞赛

Optimal Large-Contest Design

University of Fribourg(弗里堡大学)

Giovanni Valvassori Bolgè

AI总结:

本文研究了多维单调函数的极值点,并将其应用于大规模竞赛中,提供了一种在广泛分布偏好下最优分配规则的表示方法。

摘要:

在本文中,我们刻画了一类多维单调函数的极值点。这一结果随后应用于大规模竞赛,其中它为竞赛设计者在广泛分布偏好类别的最优分配规则提供了有用的表示。在信息完全的竞赛中,这种表示显著简化了均衡特征的刻画。

英文摘要:

In this paper, we provide a theoretical framework to analyze the optimal design of large contests, such as university admissions and research funding. Under a broad class of distributional preferences, the optimal allocation rules are step functions with at most two steps, thus rationalizing several real-world examples. From a methodological perspective, we leverage the mathematics of extreme points to characterize optimal allocation rules in environments where the distribution of efforts can be endogenous. When the designer wants to maximize aggregate effort, the optimal allocation rule sets a performance threshold and it awards prizes at random above it, provided noise is sufficiently small. When noise is larger, awarding prizes to the best performers becomes optimal.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑