Related papers: Adaptive Manipulation for Coalitions in Knockout T…
Single-elimination (SE) tournaments are a popular format used in competitive environments and decision making. Algorithms for SE tournament manipulation have been an active topic of research in recent years. In this paper, we initiate the…
A knockout tournament is one of the most simple and popular forms of competition. Here, we are given a binary tournament tree where all leaves are labeled with seed position names. The players participating in the tournament are assigned to…
Balanced knockout tournaments are ubiquitous in sports competitions and are also used in decision-making and elections. The traditional computational question, that asks to compute a draw (optimal draw) that maximizes the winning…
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 consider the manipulability of tournament rules which map the results of $\binom{n}{2}$ pairwise matches and select a winner. Prior work designs simple tournament rules such that no pair of teams can manipulate the outcome of their match…
Given a mapping from a set of players to the leaves of a complete binary tree (called a seeding), a knockout tournament is conducted as follows: every round, every two players with a common parent compete against each other, and the winner…
Knockout tournaments constitute a popular format for organizing sports competitions. While prior results have shown that it is often possible to manipulate a knockout tournament by fixing the bracket, these results ignore the prevalent…
In sports competitions, teams can manipulate the result by, for instance, throwing games. We show that we can decide how to manipulate round robin and cup competitions, two of the most popular types of sporting competitions in polynomial…
A tournament organizer must select one of $n$ possible teams as the winner of a competition after observing all $\binom{n}{2}$ matches between them. The organizer would like to find a tournament rule that simultaneously satisfies the…
We revisit the coalition structure generation problem in which the goal is to partition the players into exhaustive and disjoint coalitions so as to maximize the social welfare. One of our key results is a general polynomial-time algorithm…
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…
We propose a new tournament structure that combines the popular knockout tournaments and the round-robin tournaments. As opposed to the extremes of divisive elimination and no elimination, our tournament aims to eliminate the participants…
In multiagent settings where the agents have different preferences, preference aggregation is a central issue. Voting is a general method for preference aggregation, but seminal results have shown that all general voting protocols are…
Most work on manipulation assumes that all preferences are known to the manipulators. However, in many settings elections are open and sequential, and manipulators may know the already cast votes but may not know the future votes. We…
Coalitional manipulation in voting is considered to be any scenario in which a group of voters decide to misrepresent their vote in order to secure an outcome they all prefer to the first outcome of the election when they vote honestly. The…
We consider a random knockout tournament among players $1, \ldots, n$, in which each match involves two players. The match format is specified by the number of matches played in each round, where the constitution of the matches in a round…
Most work on manipulation assumes that all preferences are known to the manipulators. However, in many settings elections are open and sequential, and manipulators may know the already cast votes but may not know the future votes. We…
We consider the manipulability of tournament rules, in which $n$ teams play a round robin tournament and a winner is (possibly randomly) selected based on the outcome of all $\binom{n}{2}$ matches. Prior work defines a tournament rule to be…
Voting is a simple mechanism to aggregate the preferences of agents. Many voting rules have been shown to be NP-hard to manipulate. However, a number of recent theoretical results suggest that this complexity may only be in the worst-case…
In J. Schwenk.(2018) ['What is the Correct Way to Seed a Knockout Tournament?' Retrieved from The American Mathematical Monthly], Schwenk identified a surprising weakness in the standard method of seeding a single elimination (or knockout)…