中文
相关论文

相关论文: Exact Analysis of Dodgson Elections: Lewis Carroll…

200 篇论文

In the year 1876 the mathematician Charles Dodgson, who wrote fiction under the now more famous name of Lewis Carroll, devised a beautiful voting system that has long fascinated political scientists. However, determining the winner of a…

数据结构与算法 · 计算机科学 2007-06-25 Christopher M. Homan , Lane A. Hemaspaandra

In 1977, Young proposed a voting scheme that extends the Condorcet Principle based on the fewest possible number of voters whose removal yields a Condorcet winner. We prove that both the winner and the ranking problem for Young elections is…

计算复杂性 · 计算机科学 2016-08-16 Jörg Rothe , Holger Spakowski , Jörg Vogel

A decade ago, a beautiful paper by Wagner developed a ``toolkit'' that in certain cases allows one to prove problems hard for parallel access to NP. However, the problems his toolkit applies to most directly are not overly natural. During…

计算复杂性 · 计算机科学 2007-05-23 Edith Hemaspaandra , Lane A. Hemaspaandra , Joerg Rothe

Conflict of interest is the permanent companion of any population of agents (computational or biological). For that reason, the ability to compromise is of paramount importance, making voting a key element of societal mechanisms. One of the…

人工智能 · 计算机科学 2016-08-10 Arne Recknagel , Tarek R. Besold

We provide deterministic, polynomial-time computable voting rules that approximate Dodgson's and (the ``minimization version'' of) Young's scoring rules to within a logarithmic factor. Our approximation of Dodgson's rule is tight up to a…

计算机科学与博弈论 · 计算机科学 2008-12-18 Jason Covey , Christopher Homan

In a single winner election with several candidates and ranked choice or rating scale ballots, a Condorcet winner is one who wins all their two way races by majority rule or MR. A voting system has Condorcet consistency or CC if it names…

统计方法学 · 统计学 2017-06-07 Richard B. Darlington

The Possible Winner problem asks, given an election where the voters' preferences over the candidates are specified only partially, whether a designated candidate can become a winner by suitably extending all the votes. Betzler and Dorn [1]…

计算复杂性 · 计算机科学 2011-11-29 Dorothea Baumeister , Joerg Rothe

A Condorcet voting scheme chooses a winning candidate as one who defeats all others in pairwise majority rule. We provide a review which includes the rigorous mathematical treatment for calculating the limiting probability of a Condorcet…

统计理论 · 数学 2007-06-13 M. S. Krishnamoorthy , M. Raghavachari

Condorcet's paradox is a fundamental result in social choice theory which states that there exist elections in which, no matter which candidate wins, a majority of voters prefer a different candidate. In fact, even if we can select any $k$…

计算机科学与博弈论 · 计算机科学 2025-12-02 Moses Charikar , Prasanna Ramakrishnan , Kangning Wang

Proponents of Condorcet voting face the question of what to do in the rare case when no Condorcet winner exists. Recent work provides compelling arguments for the rule that should be applied in three-candidate elections, but already with…

理论经济学 · 经济学 2025-09-16 Wesley H. Holliday

This paper considers elections in which voters choose one candidate each, independently according to known probability distributions. A candidate receiving a strict majority (absolute or relative, depending on the version) wins. After the…

数据结构与算法 · 计算机科学 2024-01-22 Lisa Hellerstein , Naifeng Liu , Kevin Schewior

With the Dodgson rule, cloning the electorate can change the winner, which Young (1977) considers an "absurdity". Removing this absurdity results in a new rule (Fishburn, 1977) for which we can compute the winner in polynomial time (Rothe…

组合数学 · 数学 2010-08-10 John C. McCabe-Dansted

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

计算复杂性 · 计算机科学 2010-05-03 Nadja Betzler , Britta Dorn

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

Consider $2k-1$ voters, each of which has a preference ranking between $n$ given alternatives. An alternative $A$ is called a Condorcet winner, if it wins against every other alternative $B$ in majority voting (meaning that for every other…

理论经济学 · 经济学 2022-03-28 Lisa Sauermann

We investigate two systems of fully proportional representation suggested by Chamberlin Courant and Monroe. Both systems assign a representative to each voter so that the "sum of misrepresentations" is minimized. The winner determination…

计算机科学与博弈论 · 计算机科学 2014-02-05 Nadja Betzler , Arkadii Slinko , Johannes Uhlmann

We investigate the problem of computing the probability of winning in an election where voter attendance is uncertain. More precisely, we study the setting where, in addition to a total ordering of the candidates, each voter is associated…

计算机科学与博弈论 · 计算机科学 2021-02-01 Aviram Imber , Benny Kimelfeld

Winner selection by majority, in an election between two candidates, is the only rule compatible with democratic principles. Instead, when the candidates are three or more and the voters rank candidates in order of preference, there are no…

物理与社会 · 物理学 2016-04-19 Pierluigi Contucci , Emanuele Panizzi , Federico Ricci-Tersenghi , Alina Sîrbu

Consider elections where the set of candidates is partitioned into parties, and each party must nominate exactly one candidate. The Possible President problem asks whether some candidate of a given party can become the winner of the…

计算机科学与博弈论 · 计算机科学 2025-02-06 Ildikó Schlotter , Katarína Cechlárová

A voting rule is a Condorcet extension if it returns a candidate that beats every other candidate in pairwise majority comparisons whenever one exists. Condorcet extensions have faced criticism due to their susceptibility to…

理论经济学 · 经济学 2024-12-03 Felix Brandt , Chris Dong , Dominik Peters
‹ 上一页 1 2 3 10 下一页 ›