Related papers: Approximately Strategyproof Tournament Rules in th…
In each round of a Swiss-system tournament, players of similar score are paired against each other. An intentional early loss therefore might lead to weaker opponents in later rounds and thus to a better final tournament result - a…
The organisers of major sports competitions use different policies with respect to constraints in the group draw. Our paper aims to rationalise these choices by analysing the trade-off between attractiveness (the number of games played by…
Ranking the participants of a tournament has applications in voting, paired comparisons analysis, sports and other domains. In this paper we introduce bipartite tournaments, which model situations in which two different kinds of entity…
We study the complexity of solving two-player infinite duration games played on a fixed finite graph, where the control of a node is not predetermined but rather assigned randomly. In classic random-turn games, control of each node is…
We consider the classic Multi-Armed Bandit setting to understand the exploration/exploitation tradeoffs made by different search heuristics. Since many search heuristics work by comparing different options (in evolutionary algorithms called…
Scheduling a sports tournament is a complex optimization problem, which requires a large number of hard constraints to satisfy. Despite the availability of several such constraints in the literature, there remains a gap since most of the…
By relaxing the dominating set in three ways (e.g., from "each member beats every non-member" to "each member beats or ties every non-member, with an additional requirement that at least one member beat every non-member"), we propose a new…
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 results have been…
Condorcet's paradox is a fundamental result in social choice theory which states that there exist elections in which, no matter which candidate wins, a majority of voters prefer a different candidate. In fact, even if we can select any $k$…
We study best-arm identification in stochastic dueling bandits under the sole assumption that a Condorcet winner exists, i.e., an arm that wins each noisy pairwise comparison with probability at least $1/2$. We introduce a new…
Classification of matches played in the last rounds of sports competitions is a well-established tool for evaluating tournament designs. Both deterministic and probabilistic approaches are available for this purpose. Our paper offers the…
The draw of some knockout tournaments requires finding a perfect matching in a balanced bipartite graph. The problem becomes challenging with draw constraints: the two draw procedures used in sports are known to be non-uniformly distributed…
In this paper, we study the metric distortion of deterministic social choice rules that choose a winning candidate from a set of candidates based on voter preferences. Voters and candidates are located in an underlying metric space. A voter…
Determining how close a winner of an election is to becoming a loser, or distinguishing between different possible winners of an election, are major problems in computational social choice. We tackle these problems for so-called weighted…
We introduce a new measure to capture fairness of a schedule in a single round robin (SRR) tournament when participants are ranked by strength. To prevent distortion of the outcome of an SRR tournament as well as to guarantee equal…
We study the phenomenon of intransitivity in models of dice and voting. First, we follow a recent thread of research for $n$-sided dice with pairwise ordering induced by the probability, relative to $1/2$, that a throw from one die is…
Tournament solutions are standard tools for identifying winners based on pairwise comparisons between competing alternatives. The recently studied notion of margin of victory (MoV) offers a general method for refining the winner set of any…
A directed graph where there is exactly one edge between every pair of vertices is called a {\em tournament}. Finding the "best" set of vertices of a tournament is a well studied problem in social choice theory. A {\em tournament solution}…
This article deals with ranking methods. We study the situation where a tournament between $n$ players $P_1$, $P_2$, \ldots $P_n$ gives the ranking $P_1 \succ P_2 \succ \cdots \succ P_n$, but, if the results of $P_n$ are no longer taken…
We study a stochastic process that mimics single-game elimination tournaments. In our model, the outcome of each match is stochastic: the weaker player wins with upset probability q<=1/2, and the stronger player wins with probability 1-q.…