Selecting the Best? Spillover and Shadows in Elimination Tournaments
نویسندگان
چکیده
We consider how past, current, and future competition within an elimination tournament a§ect the probability that the stronger player wins. We present a two-stage model that yields the following main results: (1) a shadow e§ectóthe stronger the expected future competitor, the lower the probability that the stronger player wins in the current stage and (2) an e§ort spillover e§ectóprevious e§ort reduces the probability that the stronger player wins in the current stage. We test our theory predictions using data from high-stakes tournaments. Empirical results suggest that shadow and spillover e§ects ináuence match outcomes and have been already been priced into betting markets.
منابع مشابه
Three prominent tournament formats: predictive power and costs∗
We analyze tournaments of heterogeneous players from an organizer’s perspective. Using a simple model of a noisy tournament, we demonstrate how the likelihood of selecting the best player, here termed the “predictive power” of a tournament, depends on the tournament format, the distribution of players’ types, and the overall noise level. We formalize the organizer’s decision problem for varying...
متن کاملTournaments for Selecting the Best Under Adversarial Errors
We present a family of adaptive pairwise tournaments which are provably robust against large error fractions when used to determine the largest element in a set. These tournaments use nk pairwise comparisons but have only O(k + log n) depth where n is the number of players and k is a robustness parameter (for reasonable values of n and k). We show how these tournaments can be used to prove mult...
متن کاملt-Pancyclic Arcs in Tournaments
Let $T$ be a non-trivial tournament. An arc is emph{$t$-pancyclic} in $T$, if it is contained in a cycle of length $ell$ for every $tleq ell leq |V(T)|$. Let $p^t(T)$ denote the number of $t$-pancyclic arcs in $T$ and $h^t(T)$ the maximum number of $t$-pancyclic arcs contained in the same Hamiltonian cycle of $T$. Moon ({em J. Combin. Inform. System Sci.}, {bf 19} (1994), 207-214) showed that $...
متن کاملBayesian locally-optimal design of knockout tournaments
The elimination or knockout format is one of the most common designs for pairing competitors in tournaments and leagues. In each round of a knockout tournament, the losers are eliminated while the winners advance to the next round. Typically, the goal of such a design is to identify the overall best player. Using a common probability model for expressing relative player strengths, we develop an...
متن کاملRemoving car shadows in video images using entropy and Euclidean distance features
Detecting car motion in video frames is one of the key subjects in computer vision society. In recent years, different approaches have been proposed to address this issue. One of the main challenges of developed image processing systems for car detection is their shadows. Car shadows change the appearance of them in a way that they might seem stitched to other neighboring cars. This study aims ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Management Science
دوره 60 شماره
صفحات -
تاریخ انتشار 2014