相关论文: How to Design a Stable Serial Knockout Competition
The study aims to compare different designs for the World Men's Handball Championships. This event, organised in every two years, has adopted four hybrid formats consisting of knockout and round-robin stages in recent decades, including a…
A tournament is said to have the $S_k$-property if, for any set of $k$ players, there is another player who beats them all. Minimum tournaments having this property have been explored very well in the 1960's and the early 1970's. In this…
This paper explores a novel way for analyzing the tournament structures to find a best suitable one for the tournament under consideration. It concerns about three aspects such as tournament conducting cost, competitiveness development and…
A single-elimination (SE) tournament is a popular way to select a winner in both sports competitions and in elections. A natural and well-studied question is the tournament fixing problem (TFP): given the set of all pairwise match outcomes,…
We investigate multi-round team competitions between two teams, where each team selects one of its players simultaneously in each round and each player can play at most once. The competition defines an extensive-form game with perfect…
Poker is a family of card games that includes many variations. We hypothesize that most poker games can be solved as a pattern matching problem, and propose creating a strong poker playing system based on a unified poker representation. Our…
We consider the manipulability of tournament rules for round-robin tournaments of $n$ competitors. Specifically, $n$ competitors are competing for a prize, and a tournament rule $r$ maps the result of all $\binom{n}{2}$ pairwise matches…
We study how stability can be maintained even after any set of at most k players leave their groups, in the context of hedonic games. While stability properties ensure an outcome to be robust against players' deviations, it has not been…
The game of darts has enjoyed great growth over the past decade with the perception of darts moving from that of a pub game to a game that is regularly scheduled on prime-time television in many countries including the U.K., Germany, the…
We introduce a natural variant of weighted voting games, which we refer to as k-Prize Weighted Voting Games. Such games consist of n players with weights, and k prizes, of possibly differing values. The players form coalitions, and the i-th…
The response to a knockout of a node is a characteristic feature of a networked dynamical system. Knockout resilience in the dynamics of the remaining nodes is a sign of robustness. Here we study the effect of knockouts for binary state…
The determinant of a tournament $T$ is defined as the determinant of the skew-adjacency matrix of $T$. For a positive odd integer $k$, let $\mathcal{D}_k$ be the set of tournaments whose all subtournaments have determinant at most $k^2$.…
We propose a systematic methodology for defining tournament solutions as extensions of maximality. The central concepts of this methodology are maximal qualified subsets and minimal stable sets. We thus obtain an infinite hierarchy of…
Sharding is used to improve the scalability and performance of blockchain systems. We investigate the stability of blockchain sharding, where transactions are continuously generated by an adversarial model. The system consists of $n$…
Understanding and predicting how individuals perform in high-pressure situations is of importance in designing and managing workplaces, but also in other areas of society such as disaster management or professional sports. For simple effort…
Consider a cyclically ordered collection of $r$ equinumerous agent sets with strict preferences of every agent over the agents from the next agent set. A weakly stable cyclic matching is a partition of the set of agents into disjoint union…
We investigate the hot hand hypothesis in professional darts in a near-ideal setting with minimal to no interaction between players. Considering almost one year of tournament data, corresponding to 167,492 dart throws in total, we use…
Negative dependence in tournaments has received attention in the literature. The property of negative orthant dependence (NOD) was proved for different tournament models with a special proof for each model. For general round-robin…
A set of $2^n$ candidates is presented to a commission. At every round, each member of this commission votes by pairwise comparison, and one-half of the candidates is deleted from the tournament, the remaining ones proceeding to the next…
For professional basketball, finding valuable and suitable players is the key to building a winning team. To deal with such challenges, basketball managers, scouts and coaches are increasingly turning to analytics. Objective evaluation of…