Tournaments with a Standard
We study tournaments where winning a rank-dependent prize requires passing a minimum performance standard. We show that, for any prize allocation, the optimal standard is always at a mode of performance that is weakly higher than the global mode and identify a necessary and sufficient condition for it to be at the global mode. When the prize scheme can be designed as well, the winner-take-all prize scheme is optimal for noise distributions with an increasing failure rate; and awarding equal prizes to all qualifying agents is optimal for noise distributions with a decreasing failure rate. For distributions with monotone likelihood ratios -- log-concave and log-convex, respectively -- these pay schemes are also optimal in a larger class of anonymous, monotone contracts that may depend on cardinal performance.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
A Theory of Tournament Representations
Real world tournaments are almost always intransitive. Recent works have noted that parametric models which assume $d$ dimensional node representations can effectively model intransitive tournaments. However, nothing is …
ARCRegularization, sparse recovery, and median-of-means tournaments
A regularized risk minimization procedure for regression function estimation is introduced that achieves near optimal accuracy and confidence under general conditions, including heavy-tailed predictor and response variab…
regressionInvestigating Non-Transitivity in LLM-as-a-Judge
Automatic evaluation methods based on large language models (LLMs) are emerging as the standard tool for assessing the instruction-following abilities of LLM-based agents. The most common method in this paradigm, pairwis…
ChatbotComputational EfficiencyInstruction FollowingCATArena: Evaluating Evolutionary Capabilities of Code Agents via Iterative Tournaments
Current evaluation for Large Language Model (LLM) code agents predominantly focus on generating functional code in single-turn scenarios, which fails to evaluate the agent's capability for continuous code optimization an…
Empirical Evaluation of Real World Tournaments
Computational Social Choice (ComSoc) is a rapidly developing field at the intersection of computer science, economics, social choice, and political science. The study of tournaments is fundamental to ComSoc and many resu…