Related papers: Who Can Win a Single-Elimination Tournament?
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…
Regular games form a well-established class of games for analysis and synthesis of reactive systems. They include coloured Muller games, McNaughton games, Muller games, Rabin games, and Streett games. These games are played on directed…
Given a graph $G = (V,E)$ where every vertex has a weak ranking over its neighbors, we consider the problem of computing an optimal matching as per agent preferences. Classical notions of optimality such as stability and its relaxation…
We show the convergence of finite state symmetric N-player differential games, where players control their transition rates from state to state, to a limiting dynamics given by a finite state Mean Field Game system made of two coupled…
We consider the problem of selecting a portfolio of entries of fixed cardinality for contests with top-heavy payoff structures, i.e. most of the winnings go to the top-ranked entries. This framework is general and can be used to model a…
We consider the problem of learning stable matchings with unknown preferences in a decentralized and uncoordinated manner, where "decentralized" means that players make decisions individually without the influence of a central platform, and…
We investigate a new tournament format that consists of a series of individual knockout tournaments; we call this new format a Serial Knockout Competition (SKC). This format has recently been adopted by the Professional Darts Corporation.…
We show that information on the first server influences the expected total number of games and margin in a tennis match under the standard assumption that each player's serve point win probability remains constant, and identify the exact…
In an election where $n$ voters rank $m$ candidates, a Condorcet winning set is a committee of $k$ candidates such that for any outside candidate, a majority of voters prefer some committee member. Condorcet's paradox shows that some…
Simple games cover voting systems in which a single alternative, such as a bill or an amendment, is pitted against the status quo. A simple game or a yes-no voting system is a set of rules that specifies exactly which collections of ``yea''…
In this paper we solve the three-player-game question. A three-player-game consists of a series of rounds. There are altogether three players. Two players participate in each round, at the end of the round the loser quits and the third…
This paper studies complexity theoretic aspects of quantum refereed games, which are abstract games between two competing players that send quantum states to a referee, who performs an efficiently implementable joint measurement on the two…
The study of evolutionary games with pairwise local interactions has been of interest to many different disciplines. Also local interactions with multiple opponents had been considered, although always for a fixed amount of players. In many…
An open problem posed by the first author is the complexity to decide whether a sequence of nonnegative integer numbers can be the final score of a football tournament. In this paper we propose polynomial time approximate and exponential…
The paper analyses how draw constraints influence the outcome of a knockout tournament. The research question is inspired by European club football competitions, where the organiser generally imposes an association constraint in the first…
Voting by sequential elimination is a low-communication voting protocol: voters play in sequence and eliminate one or more of the remaining candidates, until only one remains. While the fairness and efficiency of such protocols have been…
We present an extensive statistical analysis of the results of all sports competitions in five major sports leagues in England and the United States. We characterize the parity among teams by the variance in the winning fraction from…
Federated learning (FL) is an emerging paradigm for training machine learning models across distributed clients. Traditionally, in FL settings, a central server assigns training efforts (or strategies) to clients. However, from a…
In the well-studied metric distortion problem in social choice, we have voters and candidates located in a shared metric space, and the objective is to design a voting rule that selects a candidate with minimal total distance to the voters.…
We construct games of chance from simpler games of chance. We show that it may happen that the simpler games of chance are fair or unfavourable to a player andyet the new combined game is favourable -- this is a counter-intuitive…