[PDF][PDF] Tournaments in Computational Social Choice: Recent Developments.

W Suksompong - IJCAI, 2021 - ijcai.org
Tournaments are commonly used to select winning alternatives in scenarios involving
pairwise comparisons such as sports competitions and political elections. This survey …

Tournament fixing parameterized by feedback vertex set number is FPT

M Zehavi - Proceedings of the AAAI Conference on Artificial …, 2023 - ojs.aaai.org
A knockout (or single-elimination) tournament is a format of a competition that is very
popular in practice (particularly in sports, elections and decision making), and which has …

Risk of collusion: Will groups of 3 ruin the FIFA World Cup?

J Guyon - Journal of Sports Analytics, 2021 - journals.sagepub.com
In 2026, the FIFA World Cup will for the first time gather 48 men's national teams. It will
consist of a group stage made of 16 groups of three, with the best two teams in each group …

“Choose your opponent”: A new knockout design for hybrid tournaments

J Guyon - Journal of Sports Analytics, 2022 - content.iospress.com
We present a new, simple knockout format for sports tournaments, that we call “Choose Your
Opponent”, where the teams that have performed best during a preliminary group stage can …

What a fairer 24 team UEFA Euro could look like

J Guyon - Journal of Sports Analytics, 2018 - content.iospress.com
In 2016, for the first time, the UEFA European Championship gathered 24 men's national
teams. It consisted of a group stage made of 6 groups of 4, followed by a knockout stage …

Collective decision making under incomplete knowledge: possible and necessary solutions

J Lang - Twenty-Ninth International Joint Conference on …, 2020 - hal.science
Most solution concepts in collective decision making are defined assuming complete
knowledge of individuals' preferences and of the mechanism used for aggregating them …

[HTML][HTML] Fixing knockout tournaments with seeds

P Manurangsi, W Suksompong - Discrete Applied Mathematics, 2023 - Elsevier
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 …

Who can win a single-elimination tournament?

MP Kim, W Suksompong, VV Williams - SIAM Journal on Discrete Mathematics, 2017 - SIAM
A single-elimination (SE) tournament is a popular way to select a winner both in sports
competitions and in elections. A natural and well-studied question is the tournament fixing …

Possible and necessary allocations via sequential mechanisms

H Aziz, T Walsh, L Xia - arXiv preprint arXiv:1412.2226, 2014 - arxiv.org
A simple mechanism for allocating indivisible resources is sequential allocation in which
agents take turns to pick items. We focus on possible and necessary allocation problems …

Possible and necessary winners of partial tournaments

H Aziz, M Brill, F Fischer, P Harrenstein, J Lang… - Journal of Artificial …, 2015 - jair.org
We study the problem of computing possible and necessary winners for partially specified
weighted and unweighted tournaments. This problem arises naturally in elections with …