Multiple-elimination knockout tournaments with the fixed-win property
نویسنده
چکیده
We classify those triples (n, l,w) for which there exists a ‘knockout’ tournament for n players in which the winner always wins exactly w games and each loser loses exactly l games.
منابع مشابه
Optimal Seedings in Elimination Tournaments:
We study an elimination tournament with heterogenous contestants whose ability is common-knowledge. Each pair-wise match is modeled as an all-pay auction where the winner gets the right to compete at the next round. Equilibrium efforts are in mixed strategies, yielding rather complex play dynamics: the endogenous win probabilities in each match depend on the outcome of other matches through the...
متن کاملFixing Balanced Knockout and Double Elimination Tournaments
Balanced knockout tournaments are one of the most common formats for sports competitions, and are also used in elections and decision-making. We consider the computational problem of finding the optimal draw for a particular player in such a tournament. The problem has generated considerable research within AI in recent years. We prove that checking whether there exists a draw in which a player...
متن کامل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...
متن کاملPlayers with fixed resources in Elimination Tournaments
We consider T -round elimination tournaments where players have fixed resources instead of cost functions. We show that players always spend a higher share of their resources in early than in later rounds in a symmetric equilibrium. Equal resource allocation across T rounds takes place only in the winner-take-all case. Applications for career paths, elections, and sports are discussed.
متن کاملOn the Agenda Control Problem for Knockout Tournaments
Knockout tournaments are very common in practice for various settings such as sport events and sequential pairwise elimination elections. In this paper, we investigate the computational aspect of tournament agenda control, i.e., finding the agenda that maximizes the chances of a target player winning the tournament. We consider several modelings of the problem based on different constraints tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 290 شماره
صفحات -
تاریخ انتشار 2005