中文
相关论文

相关论文: On eligibility by the de Borda voting rules

200 篇论文

We model Monroe's and Chamberlin and Courant's multiwinner voting systems as a certain resource allocation problem. We show that for many restricted variants of this problem, under standard complexity-theoretic assumptions, there are no…

计算机科学与博弈论 · 计算机科学 2013-01-29 Piotr Skowron , Piotr Faliszewski , Arkadii Slinko

We define a family of runoff rules that work as follows: voters cast approval ballots over candidates; two finalists are selected; and the winner is decided by majority. With approval-type ballots, there are various ways to select the…

计算机科学与博弈论 · 计算机科学 2023-01-27 Théo Delemazure , Jérôme Lang , Jean-François Laslier , Remzi M. Sanver

Approval voting is a common method of preference aggregation where voters vote by ``approving'' of a subset of candidates and the winner(s) are those who are approved of by the largest number of voters. In approval voting, the degree to…

计算机科学与博弈论 · 计算机科学 2023-07-19 Hari Sarang Nathan

The so-called permutation separability criteria are simple operational conditions that are necessary for separability of mixed states of multipartite systems: (1) permute the indices of the density matrix and (2) check if the trace norm of…

量子物理 · 物理学 2007-05-23 Pawel Wocjan , Michal Horodecki

We study the problem of bribery in multiwinner elections, for the case where the voters cast approval ballots (i.e., sets of candidates they approve) and the bribery actions are limited to: adding an approval to a vote, deleting an approval…

计算机科学与博弈论 · 计算机科学 2021-04-20 Piotr Faliszewski , Piotr Skowron , Nimrod Talmon

The classic Gibbard-Satterthwaite theorem says that every strategy-proof voting rule with at least three possible candidates must be dictatorial. In \cite{McL11}, McLennan showed that a similar impossibility result holds even if we consider…

计算机科学与博弈论 · 计算机科学 2015-04-13 Samantha Leung , Edward Lui , Rafael Pass

This paper presents mathematics relevant to the question whether voting should be mandatory. Assuming a static distribution of voters' political beliefs, we model how politicians might adjust their positions to raise their share of the…

物理与社会 · 物理学 2023-10-24 Christoph Börgers , Natasa Dragovic , Anna Haensch , Arkadz Kirshtein , Lilla Orr

The outcome of an election depends not only on which candidate is more popular, but also on how many of their voters actually turn out to vote. Here we consider a simple model in which voters abstain from voting if they think their vote…

物理与社会 · 物理学 2021-12-01 Ekaterina Landgren , Jonas L. Juul , Steven H. Strogatz

When selecting multiple candidates based on approval preferences of agents, the proportional representation of agents' opinions is an important and well-studied desideratum. Existing criteria for evaluating the representativeness of…

计算机科学与博弈论 · 计算机科学 2024-10-02 Markus Brill , Jonas Israel , Evi Micha , Jannik Peters

We consider the classic veto bargaining model but allow the agenda setter to engage in persuasion to convince the veto player to approve her proposal. We fully characterize the optimal proposal and experiment when Vetoer has quadratic loss,…

理论经济学 · 经济学 2023-10-23 Jenny S Kim , Kyungmin Kim , Richard Van Weelden

A fundamental principle of individual rational choice is Sen's $\gamma$ axiom, also known as expansion consistency, stating that any alternative chosen from each of two menus must be chosen from the union of the menus. Expansion consistency…

理论经济学 · 经济学 2023-03-28 Wesley H. Holliday , Chase Norman , Eric Pacuit , Saam Zahedian

A Condorcet winning set addresses the Condorcet paradox by selecting a few candidates--rather than a single winner--such that no unselected alternative is preferred to all of them by a majority of voters. This idea extends to…

计算机科学与博弈论 · 计算机科学 2025-07-01 Thanh Nguyen , Haoyu Song , Young-San Lin

We propose a new single-winner voting system using ranked ballots: Stable Voting. The motivating principle of Stable Voting is that if a candidate A would win without another candidate B in the election, and A beats B in a head-to-head…

理论经济学 · 经济学 2023-02-14 Wesley H. Holliday , Eric Pacuit

We study the {PAC} learnability of multiwinner voting, focusing on the class of approval-based committee scoring (ABCS) rules. These are voting rules applied on profiles with approval ballots, where each voter approves some of the…

计算机科学与博弈论 · 计算机科学 2023-08-02 Ioannis Caragiannis , Karl Fehrs

Voting can abstractly model any decision-making scenario and as such it has been extensively studied over the decades. Recently, the related literature has focused on quantifying the impact of utilizing only limited information in the…

计算机科学与博弈论 · 计算机科学 2020-01-07 Aris Filos-Ratsikas , Evi Micha , Alexandros A. Voudouris

This paper mainly focuses on the sign of the wave speed in the Lotka-Volterra competition system of bistable type, also known as the strong-strong competition case. The traveling wave solution of the system is crucial for understanding the…

偏微分方程分析 · 数学 2024-08-21 Dongyuan Xiao

An important question in elections is the determine whether a candidate can be a winner when some votes are absent. We study this determining winner with the absent votes (WAV) problem when the votes are top-truncated. We show that the WAV…

计算机科学与博弈论 · 计算机科学 2023-10-12 Qishen Han , Amélie Marian , Lirong Xia

Voting is a commonly applied method for the aggregation of the preferences of multiple agents into a joint decision. If preferences are binary, i.e., "yes" and "no", every voting system can be described by a (monotone) Boolean function…

计算机科学与博弈论 · 计算机科学 2016-07-15 Martin Olsen , Sascha Kurz , Xavier Molinero

This paper considers the ranking problem of candidates for a certain position based on ballot papers filled by voters. We suggest a ranking procedure of alternatives using cooperative game theory methods. For this, it is necessary to…

计算机科学与博弈论 · 计算机科学 2022-09-09 Aleksei Kondratev , Vladimir Mazalov

For a line bundle L on a smooth surface S, it is now known that the degree of the Severi variety of cogenus-d curves is given by a universal polynomial in the Chern classes of L and S if L is d-very ample. For S rational, we relax the…