English
Related papers

Related papers: Designing Strategyproof Election Systems with Scor…

200 papers

Unbiased and objective architectural design decisions are crucial for the success of a software development project. Stakeholder inputs play an important role in arriving at such design decisions. However, the stakeholders may act in a…

Software Engineering · Computer Science 2019-05-28 Shipra Sharma , Balwinder Sodhi

In the face of adverse motives, it is indispensable to achieve a consensus. Elections have been the canonical way by which modern democracy has operated since the 17th century. Nowadays, they regulate markets, provide an engine for modern…

Machine Learning · Computer Science 2026-01-06 Hao Xiang Li , Yash Shah , Lorenzo Giusti

In this paper, we propose a framework to study a general class of strategic behavior in voting, which we call vote operations. We prove the following theorem: if we fix the number of alternatives, generate $n$ votes i.i.d. according to a…

Artificial Intelligence · Computer Science 2012-08-15 Lirong Xia

In order to address issues with manual vote counting during election procedures, this study intends to examine the viability of using advanced image processing techniques for automated voter counting. The study aims to shed light on how…

Machine Learning · Computer Science 2025-03-18 Mir Faris , Syeda Aynul Karim , Md. Juniadul Islam

Today, Internet involves many actors who are making revenues on it (operators, companies, service providers,...). It is therefore important to be able to make fair decisions in this large-scale and highly competitive economical ecosystem.…

Networking and Internet Architecture · Computer Science 2012-05-01 François Durand , Fabien Mathieu , Ludovic Noirie

Almost all dependable systems use some form of redundancy in order to increase fault-tolerance. Very popular are the $N$-Modular Redundant (NMR) systems in which a majority voter chooses the voting output. However, elaborate systems require…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-04-23 Elena Hadzieva , Aleksandar Simevski

In this paper, I introduce a novel stability axiom for stochastic voting rules, called self-equivalence, by which a society considering whether to replace its voting rule using itself will choose not to do so. I then show that under the…

Theoretical Economics · Economics 2026-05-14 Héctor Hermida-Rivera

Scoring systems are an extremely important class of election systems. A length-$m$ (so-called) scoring vector applies only to $m$-candidate elections. To handle general elections, one must use a family of vectors, one per length. The most…

Computer Science and Game Theory · Computer Science 2014-04-18 Edith Hemaspaandra , Lane A. Hemaspaandra , Henning Schnoor

Ensemble-based approaches are very effective in various fields in raising the accuracy of its individual members, when some voting rule is applied for aggregating the individual decisions. In this paper, we investigate how to find and…

Artificial Intelligence · Computer Science 2019-04-10 Attila Tiba , Andras Hajdu , Gyorgy Terdik , Henrietta Toman

Computational social choice (COMSOC) studies principled ways to aggregate conflicting individual preferences into collective decisions. In this paper, we call for an increased effort towards Computational Social Choice: Research &…

This article aims to present a unified framework for grading-based voting processes. The idea is to represent the grades of each voter on d candidates as a point in R^d and to define the winner of the vote using the deepest point of the…

Other Statistics · Statistics 2021-12-21 Jean-Baptiste Aubin , Irène Gannaz , Samuela Leoni-Aubin , Antoine Rolland

We design a recursive measure of voting power based on partial as well as full voting efficacy. Classical measures, by contrast, incorporate solely full efficacy. We motivate our design by representing voting games using a division lattice…

Theoretical Economics · Economics 2022-05-25 Arash Abizadeh , Adrian Vetta

Voting methods are instrumental design elements of democracies. Citizens use them to express and aggregate their preferences to reach a collective decision. However, voting outcomes can be as sensitive to voting rules as they are to…

To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggregated according to a voting protocol. However, in realistic settings,…

Computational Complexity · Computer Science 2010-05-03 Nadja Betzler , Britta Dorn

Agents vote to choose a fair mixture of public outcomes; each agent likes or dislikes each outcome. We discuss three outstanding voting rules. The Conditional Utilitarian rule, a variant of the random dictator, is Strategyproof and…

Computer Science and Game Theory · Computer Science 2017-12-08 Haris Aziz , Anna Bogomolnaia , Herve Moulin

Chore division is the problem of fairly dividing some divisible, undesirable bad, such as a set of chores, among a number of players. Each player has their own valuation of the chores, and must be satisfied they did not receive more than…

Computer Science and Game Theory · Computer Science 2022-04-04 David Francis

We present partial strategyproofness, a new, relaxed notion of strategyproofness for studying the incentive properties of non-strategyproof assignment mechanisms. Informally, a mechanism is partially strategyproof if it makes truthful…

Computer Science and Game Theory · Computer Science 2020-08-04 Timo Mennle , Sven Seuken

We study the voting problem with two alternatives where voters' preferences depend on a not-directly-observable state variable. While equilibria in the one-round voting mechanisms lead to a good decision, they are usually hard to compute…

Computer Science and Game Theory · Computer Science 2025-05-16 Qishen Han , Grant Schoenebeck , Biaoshuai Tao , Lirong Xia

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…

Computer Science and Game Theory · Computer Science 2022-06-22 Junlin Wu , Andrew Estornell , Lecheng Kong , Yevgeniy Vorobeychik

It is well known, by the Gibbard-Satterthwaite Theorem, that when there are more than two candidates, any non-dictatorial voting rule can be manipulated by untruthful voters. But how strong is the incentive to manipulate under different…

Computer Science and Game Theory · Computer Science 2026-02-27 Ratip Emin Berker , Vincent Conitzer , Eden Hartman , Jiayuan Liu , Caspar Oesterheld
‹ Prev 1 4 5 6 7 8 10 Next ›