English
Related papers

Related papers: Good election rules with more than three candidate…

200 papers

Approval voting is widely used for making multi-winner voting decisions. The canonical rule (also called Approval Voting) used in the setting aims to maximize social welfare by selecting candidates with the highest number of approvals. We…

Computer Science and Game Theory · Computer Science 2026-04-21 Haris Aziz , Yuhang Guo , Venkateswara Rao Kagita , Baharak Rastegari , Mashbat Suzuki

Nowadays there is an increasing interest of physicists in finding regularities related to social phenomena. This interest is clearly motivated by applications that a statistical mechanical description of the human behavior may have in our…

Physics and Society · Physics 2011-10-28 M. C. Mantovani , H. V. Ribeiro , M. V. Moro , S. Picoli , R. S. Mendes

Strategic voting, or manipulation, is the process by which a voter misrepresents his preferences in an attempt to elect an outcome that he considers preferable to the outcome under sincere voting. It is generally agreed that manipulation is…

Computer Science and Game Theory · Computer Science 2022-11-10 Egor Ianovski , Daria Teplova , Valeriia Kuka

The utilitarian distortion framework evaluates voting rules by their worst-case efficiency loss when voters have cardinal utilities but express only ordinal rankings. Under the classical model, a longstanding tension exists: Plurality,…

Computer Science and Game Theory · Computer Science 2026-02-12 Hamidreza Alipour , Mohak Goyal

In the context of computational social choice, we study voting methods that assign a set of winners to each profile of voter preferences. A voting method satisfies the property of positive involvement (PI) if for any election in which a…

Computer Science and Game Theory · Computer Science 2021-06-23 Wesley H. Holliday , Eric Pacuit

In social choice theory, anonymity (all agents being treated equally) and neutrality (all alternatives being treated equally) are widely regarded as ``minimal demands'' and ``uncontroversial'' axioms of equity and fairness. However, the ANR…

Computer Science and Game Theory · Computer Science 2023-07-14 Lirong Xia

Motivated by the difficulty of specifying complete ordinal preferences over a large set of $m$ candidates, we study voting rules that are computable by querying voters about $t < m$ candidates. Generalizing prior works that focused on…

Computer Science and Game Theory · Computer Science 2024-09-30 Daniel Halpern , Safwan Hossain , Jamie Tucker-Foltz

In this paper, I characterize minimal stable voting rules and minimal self-stable constitutions (i.e., pairs of voting rules) for societies in which only power matters. To do so, I first let players' preference profiles over voting rules…

Theoretical Economics · Economics 2025-08-26 Héctor Hermida-Rivera

Election data represent a precious source of information to study human behavior at a large scale. In proportional elections with open lists, the number of votes received by a candidate, rescaled by the average performance of all…

Physics and Society · Physics 2013-01-25 Arnab Chatterjee , Marija Mitrović , Santo Fortunato

Despite many examples to the contrary, most models of elections assume that rules determining the winner will be followed. We present a model where elections are solely a public signal of the incumbent popularity, and citizens can protests…

Physics and Society · Physics 2013-02-04 Andrew T. Little , Joshua A. Tucker , Tom LaGatta

In a party-based election system, the voters are grouped into parties and all voters of a party are assumed to vote according to the party preferences over the candidates. Hence, once the party preferences are declared the outcome of the…

Multiagent Systems · Computer Science 2014-04-10 Jiong Guo , Yash Raj Shrestha , Yongjie Yang

We study the complexity of winner determination in single-crossing elections under two classic fully proportional representation rules---Chamberlin--Courant's rule and Monroe's rule. Winner determination for these rules is known to be…

Computer Science and Game Theory · Computer Science 2013-07-05 Piotr Skowron , Lan Yu , Piotr Faliszewski , Edith Elkind

This paper studies a dominance relation among scoring rules with respect to avoiding the selection of the Condorcet loser. In a voting model with three or more alternatives, we say that a scoring rule $f$ Condorcet-loser-dominates…

Theoretical Economics · Economics 2026-04-08 Ryoga Doi , Kensei Nakamura

This paper examines normatively acceptable criteria for evaluating social states when individuals are responsible for their skills or productivity and these factors should be accounted for. We consider social choice rules over sets of…

Theoretical Economics · Economics 2025-02-12 Kensei Nakamura

Plurality and approval voting are two well-known voting systems with different strengths and weaknesses. In this paper we consider a new voting system we call beta(k) which allows voters to select a single first-choice candidate and approve…

Theoretical Economics · Economics 2020-06-02 Peter Butler , Jerry Lin

In selection processes such as hiring, promotion, and college admissions, implicit bias toward socially-salient attributes such as race, gender, or sexual orientation of candidates is known to produce persistent inequality and reduce…

Computers and Society · Computer Science 2022-06-08 Anay Mehrotra , Bary S. R. Pradelski , Nisheeth K. Vishnoi

Some argue that political stability is best served through a two-party system. This study refutes this. The author mathematically defines the stability and rigidity of electoral systems comprised of any quantity of electors and parties. In…

Economics · Quantitative Finance 2016-08-18 Michael Y. Levy

We consider the problem of manipulating elections by cloning candidates. In our model, a manipulator can replace each candidate c by several clones, i.e., new candidates that are so similar to c that each voter simply replaces c in his vote…

Computer Science and Game Theory · Computer Science 2014-01-21 Edith Elkind , Piotr Faliszewski , Arkadii Slinko

Given a set of agents with approval preferences over each other, we study the task of finding $k$ matchings fairly representing everyone's preferences. We model the problem as an approval-based multiwinner election where the set of…

Computer Science and Game Theory · Computer Science 2021-02-16 Niclas Boehmer , Markus Brill , Ulrike Schmidt-Kraepelin

When each voter rates or ranks several candidates for a single office, a strong Condorcet winner (SCW) is one who beats all others in two-way races. Among 21 electoral systems examined, 18 will sometimes make candidate X the winner even if…

Methodology · Statistics 2016-09-22 Richard B. Darlington
‹ Prev 1 8 9 10 Next ›