中文
相关论文

相关论文: Line-Up Elections: Parallel Voting with Shared Can…

200 篇论文

In elections, a set of candidates ranked consecutively (though possibly in different order) by all voters is called a clone set, and its members are called clones. A clone structure is a family of all clone sets of a given election. In this…

计算机科学与博弈论 · 计算机科学 2011-10-19 Edith Elkind , Piotr Faliszewski , Arkadii Slinko

Perpetual voting was recently introduced as a framework for long-term collective decision making. In this framework, we consider a sequence of subsequent approval-based elections and try to achieve a fair overall outcome. To achieve…

计算机科学与博弈论 · 计算机科学 2021-05-03 Martin Lackner , Jan Maly

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…

理论经济学 · 经济学 2020-09-28 Mostapha Diss , Boris Tsvelikhovskiy

Fairness in multiwinner elections is studied in varying contexts. For instance, diversity of candidates and representation of voters are both separately termed as being fair. A common denominator to ensure fairness across all such contexts…

计算机科学与博弈论 · 计算机科学 2022-11-24 Kunal Relia

The map of elections framework is a methodology for visualizing and analyzing election datasets. So far, the framework was restricted to elections that have equal numbers of candidates, equal numbers of voters, and where all the (ordinal)…

计算机科学与博弈论 · 计算机科学 2026-01-27 Piotr Faliszewski , Jitka Mertlová , Pierre Nunn , Stanisław Szufa , Tomasz Wąs

Here we present \texttt{electoral\_sim}, an open-source Python framework for simulating and comparing electoral systems across diverse voter preference distributions. The framework represents voters and candidates as points in a…

计算机科学与博弈论 · 计算机科学 2026-03-11 Sumit Mukherjee

We consider a two-round election model involving $m$ voters and $n$ candidates. Each voter is endowed with a strict preference list ranking the candidates. In the first round, the candidates are partitioned into two subsets, $A$ and $B$,…

计算机科学与博弈论 · 计算机科学 2026-03-17 Emilio De Santis , Antonio Di Crescenzo , Verdiana Mustaro

In repeated games, players choose actions concurrently at each step. We consider a parameterized setting of repeated games in which the players form a population of an arbitrary size. Their utility functions encode a reachability objective.…

计算机科学与博弈论 · 计算机科学 2025-10-06 Nathalie Bertrand , Patricia Bouyer , Luc Lapointe , Corto Mascle

The goal of this paper is twofold. First and foremost, we aim to experimentally and quantitatively show that the choice of a multiwinner voting rule can play a crucial role on the way minorities are represented. We also test the possibility…

计算机科学与博弈论 · 计算机科学 2016-04-11 Piotr Faliszewski , Jean-Francois Laslier , Robert Schaefer , Piotr Skowron , Arkadii Slinko , Nimrod Talmon

In this paper we extend the principle of proportional representation to rankings. We consider the setting where alternatives need to be ranked based on approval preferences. In this setting, proportional representation requires that…

计算机科学与博弈论 · 计算机科学 2016-12-06 Piotr Skowron , Martin Lackner , Markus Brill , Dominik Peters , Edith Elkind

We study the setting of single-winner elections with ordinal preferences where candidates might be members of \emph{alliances} (which may correspond to e.g., political parties, factions, or coalitions). However, we do not assume that…

计算机科学与博弈论 · 计算机科学 2024-01-30 Grzegorz Pierczyński , Stanisław Szufa

A core tension in the study of plurality elections is the clash between the classic Hotelling-Downs model, which predicts that two office-seeking candidates should position themselves at the median voter's policy, and the empirical…

计算机科学与博弈论 · 计算机科学 2025-03-04 Kiran Tomlinson , Tanvi Namjoshi , Johan Ugander , Jon Kleinberg

Multi-winner voting is the process of selecting a fixed-size set of representative candidates based on voters' preferences. It occurs in applications ranging from politics (parliamentary elections) to the design of modern computer…

计算机科学与博弈论 · 计算机科学 2022-11-22 Martin Lackner , Piotr Skowron

The integrity of elections is central to democratic systems. However, a myriad of malicious actors aspire to influence election outcomes for financial or political benefit. A common means to such ends is by manipulating perceptions of the…

计算机科学与博弈论 · 计算机科学 2022-06-22 Junlin Wu , Andrew Estornell , Lecheng Kong , Yevgeniy Vorobeychik

We develop a model of multiwinner elections that combines performance-based measures of the quality of the committee (such as, e.g., Borda scores of the committee members) with diversity constraints. Specifically, we assume that the…

计算机科学与博弈论 · 计算机科学 2017-11-23 Robert Bredereck , Piotr Faliszewski , Ayumi Igarashi , Martin Lackner , Piotr Skowron

Referring to a standard context of voting theory, and to the classic notion of voting situation, here we show that it is possible to observe any arbitrary set of elections' outcomes, no matter how paradoxical it may appear. On this purpose…

概率论 · 数学 2022-06-01 Emilio De Santis , Fabio Spizzichino

We propose a statistical framework for quantifying the importance of single events that do not provide intermediate rewards but offer implicit incentives through the reward structure at the end of a multi-event contest. Applying the…

应用统计 · 统计学 2022-07-07 Daniel Goller , Sandro Heiniger

We show a prototype of a system that uses multiwinner voting to suggest resources (such as movies) related to a given query set (such as a movie that one enjoys). Depending on the voting rule used, the system can either provide resources…

计算机科学与博弈论 · 计算机科学 2022-02-09 Grzegorz Gawron , Piotr Faliszewski

Scoring rules aggregate individual rankings by assigning some points to each position in each ranking such that the total sum of points provides the overall ranking of the alternatives. They are widely used in sports competitions consisting…

其他统计学 · 统计学 2023-03-28 László Csató

We show how hidden interesting subelections can be discovered in ordinal elections. An interesting subelection consists of a reasonably large set of voters and a reasonably large set of candidates such that the former have a consistent…

计算机科学与博弈论 · 计算机科学 2024-07-29 Łukasz Janeczko , Jérôme Lang , Grzegorz Lisowski , Stanisław Szufa