English
Related papers

Related papers: Piercing Numbers in Circular Societies

200 papers

Considering voting rules based on evaluation inputs rather than preference rankings modifies the paradigm of probabilistic studies of voting procedures. This article proposes several simulation models for generating evaluation-based voting…

Applications · Statistics 2024-03-18 Antoine Rolland , Jean-Baptiste Aubin , Irène Gannaz , Samuela Leoni

The existence of juxtaposed regions of distinct cultures in spite of the fact that people's beliefs have a tendency to become more similar to each other's as the individuals interact repeatedly is a puzzling phenomenon in the social…

Computational Physics · Physics 2010-11-05 Lucas R. Peres , Jose F. Fontanari

We analyze Assessment Voting, a new two-round voting procedure that can be applied to binary decisions in democratic societies. In the first round, a randomly-selected number of citizens cast their vote on one of the two alternatives at…

Econometrics · Economics 2018-02-06 Hans Gersbach , Akaki Mamageishvili , Oriol Tejada

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…

Theoretical Economics · Economics 2020-09-28 Mostapha Diss , Boris Tsvelikhovskiy

Election polls play a critical role in political discussions by probing public opinion and enabling political parties to assess their performance before elections. However, traditional polling methods sometimes fail to predict election…

Combinatorial preference aggregation has many applications in AI. Given the exponential nature of these preferences, compact representations are needed and ($m$)CP-nets are among the most studied ones. Sequential and global voting are two…

Artificial Intelligence · Computer Science 2019-03-28 Thomas Lukasiewicz , Enrico Malizia

We study approval-based committee voting in which a target number of candidates are selected based on voters' approval preferences over candidates. In contrast to most of the work, we consider the setting where voters express uncertain…

Computer Science and Game Theory · Computer Science 2024-07-30 Hariz Aziz , Venkateswara Rao Kagita , Baharak Rastegari , Mashbat Suzuki

Whether the goal is to analyze voting behavior, locate facilities, or recommend products, the problem of translating between (ordinal) rankings and (numerical) utilities arises naturally in many contexts. This task is commonly approached by…

Theoretical Economics · Economics 2026-02-03 Joshua Zeitlin , Corinna Coupette

We investigate approval-based committee voting with incomplete information about the approval preferences of voters. We consider several models of incompleteness where each voter partitions the set of candidates into approved, disapproved,…

Computer Science and Game Theory · Computer Science 2024-08-21 Aviram Imber , Jonas Israel , Markus Brill , Benny Kimelfeld

It is widely believed that one's peers influence product adoption behaviors. This relationship has been linked to the number of signals a decision-maker receives in a social network. But it is unclear if these same principles hold when the…

Social and Information Networks · Computer Science 2020-09-09 Soumajyoti Sarkar , Ashkan Aleali , Paulo Shakarian , Mika Armenta , Danielle Sanchez , Kiran Lakkaraju

The popularity of an opinion in one's direct circles is not necessarily a good indicator of its popularity in one's entire community. Network structures make local information about global properties of the group potentially inaccurate, and…

Social and Information Networks · Computer Science 2025-08-11 Maaike Los , Zoé Christoff , Davide Grossi

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$,…

Computer Science and Game Theory · Computer Science 2026-03-17 Emilio De Santis , Antonio Di Crescenzo , Verdiana Mustaro

The Possible-Winner problem asks, given an election where the voters' preferences over the set of candidates is partially specified, whether a distinguished candidate can become a winner. In this work, we consider the computational…

Computer Science and Game Theory · Computer Science 2018-02-27 Batya Kenig

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

In order to represent the preferences of a group of individuals, we introduce Probabilistic CP-nets (PCP-nets). PCP-nets provide a compact language for representing probability distributions over preference orderings. We argue that they are…

Artificial Intelligence · Computer Science 2013-09-27 Damien Bigot , Bruno Zanuttini , Helene Fargier , Jerome Mengin

We study the problem of designing voting rules that take as input the ordinal preferences of $n$ agents over a set of $m$ alternatives and output a single alternative, aiming to optimize the overall happiness of the agents. The input to the…

Computer Science and Game Theory · Computer Science 2023-06-01 Vasilis Gkatzelis , Mohamad Latifian , Nisarg Shah

We study multiwinner elections with approval-based preferences. An instance of a multiwinner election consists of a set of alternatives, a population of voters---each voter approves a subset of alternatives, and the desired committee size…

Computer Science and Game Theory · Computer Science 2019-10-15 Piotr Skowron

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

We study the evolution of a social group when admission to the group is determined via consensus or unanimity voting. In each time period, two candidates apply for membership and a candidate is selected if and only if all the current group…

Computer Science and Game Theory · Computer Science 2020-05-27 Mashbat Suzuki , Adrian Vetta

In the popular edge problem, the input is a bipartite graph $G = (A \cup B,E)$ where $A$ and $B$ denote a set of men and a set of women respectively, and each vertex in $A\cup B$ has a strict preference ordering over its neighbours. A…

Data Structures and Algorithms · Computer Science 2022-09-23 Kushagra Chatterjee , Prajakta Nimbhorkar
‹ Prev 1 3 4 5 6 7 10 Next ›