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

大型竞赛中的成功函数

Success functions in large contests

Yaron Azrieli, Christopher P. Chambers

AI总结:

本文公理化了连续统参与者竞赛中的成功函数,刻画一般表示与可加结构所需条件,并用以重新审视经典竞赛问题。

摘要:

我们考虑具有大量(连续统)参与者的竞赛,并对竞赛成功函数进行公理化。这些函数出现在绩效由努力和随机因素共同构成,且获胜者是绩效超过由市场出清条件所决定的临界值的情形中。在一般情况下,一种协同单调性性质基本上就是获得表示所需的全部条件;但要获得可加结构,则必须满足显著更强的条件。我们通过重新审视竞赛文献中的一些经典问题,说明该框架的有用性。

英文摘要:

We consider contests with a large set (continuum) of participants and axiomatize contest success functions that arise when performance is composed of both effort and a random element, and when winners are those whose performance exceeds a cutoff determined by a market clearing condition. A co-monotonicity property is essentially all that is needed for a representation in the general case, but significantly stronger conditions must hold to obtain an additive structure. We illustrate the usefulness of this framework by revisiting some of the classic questions in the contests literature.

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

↑