Analysing a built-in advantage in asymmetric darts contests using causal machine learning
We analyse a sequential contest with two players in darts where one of the contestants enjoys a technical advantage. Using methods from the causal machine learning literature, we analyse the built-in advantage, which is the first-mover having potentially more but never less moves. Our empirical findings suggest that the first-mover has an 8.6 percentage points higher probability to win the match induced by the technical advantage. Contestants with low performance measures and little experience have the highest built-in advantage. With regard to the fairness principle that contestants with equal abilities should have equal winning probabilities, this contest is ex-ante fair in the case of equal built-in advantages for both competitors and a randomized starting right. Nevertheless, the contest design produces unequal probabilities of winning for equally skilled contestants because of asymmetries in the built-in advantage associated with social pressure for contestants competing at home and away.
Code (0)
등록된 구현이 없습니다.
Tasks
BIG-bench Machine LearningFairnessSimilar Papers 제목 키워드 기반
Social Welfare in Search Games with Asymmetric Information
We consider games in which players search for a hidden prize, and they have asymmetric information about the prize location. We study the social payoff in equilibria of these games. We present sufficient conditions for t…
Contest in Multitasking: An Evidence from Chinese County Officials' Promotion Assessment
Real-world observed contests often take the form of multi-task contests rather than single-task contests, and existing theories are insufficient to explain the incentive for extending the task dimension. This paper propo…
CodeContests+: High-Quality Test Case Generation for Competitive Programming
Competitive programming, due to its high reasoning difficulty and precise correctness feedback, has become a key task for both training and evaluating the reasoning capabilities of large language models (LLMs). However, …
Reinforcement Learning (RL)iDARTS: Improving DARTS by Node Normalization and Decorrelation Discretization
Differentiable ARchiTecture Search (DARTS) uses a continuous relaxation of network representation and dramatically accelerates Neural Architecture Search (NAS) by almost thousands of times in GPU-day. However, the search…
GPUNeural Architecture SearchContests with sequential moves: An experimental study
We study experimentally contests in which players make investment decisions sequentially, and information on prior investments is revealed between stages. Using a between-subject design, we consider all possible sequence…