English
Related papers

Related papers: Clone Structures in Voters' Preferences

200 papers

The computational study of elections generally assumes that the preferences of the electorate come in as a list of votes. Depending on the context, it may be much more natural to represent the list succinctly, as the distinct votes of the…

Computer Science and Game Theory · Computer Science 2021-06-25 Zack Fitzsimmons , Edith Hemaspaandra

A clone on a set X is a set of finitary operations on X which contains all projections and which is moreover closed under functional composition. Ordering all clones on X by inclusion, one obtains a complete algebraic lattice, called the…

Rings and Algebras · Mathematics 2008-01-15 Martin Goldstern , Michael Pinsker

Previous work on voter control, which refers to situations where a chair seeks to change the outcome of an election by deleting, adding, or partitioning voters, takes for granted that the chair knows all the voters' preferences and that all…

Computer Science and Game Theory · Computer Science 2016-06-20 Edith Hemaspaandra , Lane A. Hemaspaandra , Joerg Rothe

Manipulation, bribery, and control are well-studied ways of changing the outcome of an election. Many voting rules are, in the general case, computationally resistant to some of these manipulative actions. However when restricted to…

Computational Complexity · Computer Science 2017-07-24 Gábor Erdélyi , Martin Lackner , Andreas Pfandler

Several elections run in the last years have been characterized by attempts to manipulate the result of the election through the diffusion of fake or malicious news over social networks. This problem has been recognized as a critical issue…

Computer Science and Game Theory · Computer Science 2023-08-22 Vincenzo Auletta , Francesco Carbone , Diodato Ferraioli

Function clones are sets of functions on a fixed domain that are closed under composition and contain the projections. They carry a natural algebraic structure, provided by the laws of composition which hold in them, as well as a natural…

Logic · Mathematics 2016-05-17 Manuel Bodirsky , Michael Pinsker , András Pongrácz

We investigate binary voting systems with two types of voters and a hierarchy among the members in each type, so that members in one class have more influence or importance than members in the other class. The purpose of this paper is to…

Combinatorics · Mathematics 2009-07-23 Josep Freixas , Xavier Molinero , Salvador Roura

An electorate with fully-ranked innate preferences casts approval votes over a finite set of alternatives. As a result, only partial information about the true preferences is revealed to the voting authorities. In an effort to understand…

Computer Science and Game Theory · Computer Science 2023-10-09 Andrei Constantinescu , Roger Wattenhofer

Challenges of assessing complexity and clonality in populations of mixed species arise in diverse areas of modern biology, including estimating diversity and clonality in microbiome populations, measuring patterns of T and B cell clonality,…

Methodology · Statistics 2014-08-07 Yi Liu , Andrew Z. Fire , Scott Boyd , Richard A. Olshen

We study supervised learning problems using clustering constraints to impose structure on either features or samples, seeking to help both prediction and interpretation. The problem of clustering features arises naturally in text…

Machine Learning · Computer Science 2016-09-20 Vincent Roulet , Fajwel Fogel , Alexandre d'Aspremont , Francis Bach

We propose a Condorcet consistent voting method that we call Split Cycle. Split Cycle belongs to the small family of known voting methods satisfying the anti-vote-splitting criterion of independence of clones. In this family, only Split…

Computer Science and Game Theory · Computer Science 2023-11-30 Wesley H. Holliday , Eric Pacuit

RNA virus populations will undergo processes of mutation and selection resulting in a mixed population of viral particles. High throughput sequencing of a viral population subsequently contains a mixed signal of the underlying clones. We…

Populations and Evolution · Quantitative Biology 2014-07-31 Donatien Fotso-Chedom , Pablo R. Murcia , Chris D. Greenman

In an election, we are given a set of voters, each having a preference list over a set of candidates, that are distributed on a social network. We consider a scenario where voters may change their preference lists as a consequence of the…

Social and Information Networks · Computer Science 2020-06-01 Mohammad Abouei Mehrizi , Gianlorenzo D'Angelo

Electoral control types are ways of trying to change the outcome of elections by altering aspects of their composition and structure [BTT92]. We say two compatible (i.e., having the same input types) control types that are about the same…

Computer Science and Game Theory · Computer Science 2025-11-12 Benjamin Carleton , Michael C. Chavrimootoo , Lane A. Hemaspaandra , David E. Narváez , Conor Taliancich , Henry B. Welles

Many electoral bribery, control, and manipulation problems (which we will refer to in general as "manipulative actions" problems) are NP-hard in the general case. It has recently been noted that many of these problems fall into polynomial…

Computer Science and Game Theory · Computer Science 2012-07-09 Piotr Faliszewski , Edith Hemaspaandra , Lane A. Hemaspaandra

Every clone of functions comes naturally equipped with a topology---the topology of pointwise convergence. A clone $\mathfrak{C}$ is said to have automatic homeomorphicity with respect to a class $\mathcal{C}$ of clones, if every…

Logic · Mathematics 2017-04-04 Christian Pech , Maja Pech

In some preference aggregation scenarios, voters' preferences are highly structured: e.g., the set of candidates may have one-dimensional structure (so that voters' preferences are single-peaked) or be described by a binary decision tree…

Computer Science and Game Theory · Computer Science 2022-02-02 Sonja Kraiczy , Edith Elkind

Co-change candidates are the group of code fragments that require a change if any of these fragments experience a modification in a commit operation during software evolution. The cloned co-change candidates are a subset of the co-change…

Software Engineering · Computer Science 2025-02-21 Md Nadim , Manishankar Mondal , Chanchal K. Roy , Kevin Schneider

A citizens' assembly is a group of people who are randomly selected to represent a larger population in a deliberation. While this approach has successfully strengthened democracy, it has certain limitations that suggest the need for…

Computer Science and Game Theory · Computer Science 2025-03-03 Daniel Halpern , Ariel D. Procaccia , Ehud Shapiro , Nimrod Talmon

Prior work on the complexity of bribery assumes that the bribery happens simultaneously, and that the briber has full knowledge of all voters' votes. But neither of those assumptions always holds. In many real-world settings, votes come in…

Computer Science and Game Theory · Computer Science 2021-10-25 Edith Hemaspaandra , Lane A. Hemaspaandra , Jörg Rothe