中文
相关论文

相关论文: Sincere-Strategy Preference-Based Approval Voting …

200 篇论文

A voting center is in charge of collecting and aggregating voter preferences. In an iterative process, the center sends comparison queries to voters, requesting them to submit their preference between two items. Voters might discuss the…

计算机与社会 · 计算机科学 2019-09-24 Lihi Dery , Svetlana Obraztsova , Zinovi Rabinovich , Meir Kalech

We focus on the following natural question: is it possible to influence the outcome of a voting process through the strategic provision of information to voters who update their beliefs rationally? We investigate whether it is…

计算机科学与博弈论 · 计算机科学 2019-09-24 Matteo Castiglioni , Andrea Celli , Nicola Gatti

By the Gibbard--Satterthwaite theorem, every reasonable voting rule for three or more alternatives is susceptible to manipulation: there exist elections where one or more voters can change the election outcome in their favour by…

计算机科学与博弈论 · 计算机科学 2017-07-28 Edith Elkind , Umberto Grandi , Francesca Rossi , Arkadii Slinko

Much research in electoral control -- one of the most studied form of electoral attacks, in which an entity running an election alters the structure of that election to yield a preferred outcome -- has focused on giving decision complexity…

计算机科学与博弈论 · 计算机科学 2026-05-14 Huy Vu Bui , Michael C. Chavrimootoo , Kien T. Le , Son M. Nguyen

An important problem in computational social choice theory is the complexity of undesirable behavior among agents, such as control, manipulation, and bribery in election systems. These kinds of voting strategies are often tempting at the…

人工智能 · 计算机科学 2012-04-20 Andrew Lin

Integrity of elections is vital to democratic systems, but it is frequently threatened by malicious actors. The study of algorithmic complexity of the problem of manipulating election outcomes by changing its structural features is known as…

计算机科学与博弈论 · 计算机科学 2020-07-21 Andrew Estornell , Sanmay Das , Edith Elkind , Yevgeniy Vorobeychik

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…

计算机科学与博弈论 · 计算机科学 2025-05-16 Qishen Han , Grant Schoenebeck , Biaoshuai Tao , Lirong Xia

We describe the vote package in R, which implements the plurality (or first-past-the-post), two-round runoff, score, approval and single transferable vote (STV) electoral systems, as well as methods for selecting the Condorcet winner and…

统计计算 · 统计学 2021-02-12 Adrian E. Raftery , Hana Ševčíková , Bernard W. Silverman

News outlets, surveyors, and other organizations often conduct polls on social networks to gain insights into public opinion. Such a poll is typically started by someone on a social network who sends it to her friends. If a person…

多智能体系统 · 计算机科学 2025-02-05 Koustav De , Palash Dey , Swagato Sanyal

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…

计算机科学与博弈论 · 计算机科学 2014-04-18 Edith Hemaspaandra , Lane A. Hemaspaandra , Henning Schnoor

We analyse strategic, complete information, sequential voting with ordinal preferences over the alternatives. We consider several voting mechanisms: plurality voting and approval voting with deterministic or uniform tie-breaking rules. We…

计算机科学与博弈论 · 计算机科学 2019-04-19 Oren Dean , Yakov Babichenko , Moshe Tennenholtz

We study the election control problem with multi-votes, where each voter can present a single vote according different views (or layers, we use "layer" to represent "view"). For example, according to the attributes of candidates, such as:…

计算复杂性 · 计算机科学 2023-07-03 Fengbo Wang , Aizhong Zhou , Jianliang Xu

Previous studies have shown that Instant-Runoff Voting (IRV) is highly resistant to coalitional manipulation (CM), though the theoretical reasons for this remain unclear. To address this gap, we analyze the susceptibility to CM of three…

计算机科学与博弈论 · 计算机科学 2025-10-17 François Durand

This work contributes to a foundational question in economic theory: how do individual-level cognitive biases interact with collective choice mechanisms? We study a setting where voters hold intrinsic preference rankings over a set of…

理论经济学 · 经济学 2026-02-24 Federico Fioravanti , Zoi Terzopoulou

This paper introduces the Voting with Random Proposers (VRP) procedure to address the challenges of agenda manipulation in voting. In each round of VRP, a randomly selected proposer suggests an alternative that is voted on against the…

理论经济学 · 经济学 2025-10-03 Hans Gersbach , Kremena Valkanova

Ranked Choice Voting (RCV) adoption is expanding across U.S. elections, but faces persistent criticism for complexity, strategic manipulation, and ballot exhaustion. We empirically test these concerns on real election data, across three…

计算机与社会 · 计算机科学 2026-02-17 Sanyukta Deshpande , Nikhil Garg , Sheldon H. Jacobson

Mechanism design is concerned with settings where a policymaker (or social planner) faces the problem of aggregating the announced preferences of multiple agents into a collective (or social), system-wide decision. One of the most important…

多智能体系统 · 计算机科学 2020-03-02 Mohammad Ali Javidian , Pooyan Jamshidi , Marco Valtorta , Rasoul Ramezanian

The proportional veto principle, which captures the idea that a candidate vetoed by a large group of voters should not be chosen, has been studied for ranked ballots in single-winner voting. We introduce a version of this principle for…

计算机科学与博弈论 · 计算机科学 2025-05-05 Daniel Halpern , Ariel D. Procaccia , Warut Suksompong

A variety of constructive manipulation, control, and bribery problems for approval-based multiwinner voting have been extensively studied recently. However, their destructive counterparts seem to be less explored. This paper investigates…

计算机科学与博弈论 · 计算机科学 2025-03-19 Yongjie Yang

It is important to study how strategic agents can affect the outcome of an election. There has been a long line of research in the computational study of elections on the complexity of manipulative actions such as manipulation and bribery.…

计算机科学与博弈论 · 计算机科学 2023-07-24 Zack Fitzsimmons , Edith Hemaspaandra