On the approximability of Dodgson and Young elections
type: Item
instance of: scholarly article
title: On the approximability of Dodgson and Young elections
zbMATH Open document ID: 1251.91026
author: I. Caragiannis
author: Jason A. Covey
author: Michal Feldman
author: Christopher M. Homan
author: C. Kaklamanis
author: Nikos Karanikolas
author: Ariel D. Procaccia
author: Jeffrey S. Rosenschein
published in: Artificial Intelligence
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 91B12
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 6106685
zbMATH Keywords: computational social choice
zbMATH Keywords: approximation algorithms
MaRDI profile type: Publication
full work available at URL: j.artint.2012.04.004
OpenAlex ID: W2024298276
cites work: Aggregating inconsistent information
cites work: Voting schemes for which it can be difficult to tell who won the election
cites work: Parameterized computational complexity of Dodgson and Young elections
cites work: Q3266133
cites work: Some Remarks on Dodgson's Voting Rule
cites work: Socially desirable approximations for dodgson’s voting rule
cites work: Ordering by weighted number of wins gives a good ranking for weighted tournaments
cites work: Introduction to algorithms
cites work: Multimode Control Attacks on Elections
cites work: A threshold of ln n for approximating set cover
cites work: Condorcet Social Choice Functions
cites work: Monotonicity paradoxes in the theory of elections
cites work: Q4198056
cites work: Manipulation of Voting Schemes: A General Result
cites work: Exact analysis of Dodgson elections
cites work: Guarantees for the success frequency of an algorithm for finding Dodgson-election winners
cites work: Q4782694
cites work: Q3549601
cites work: The Dodgson ranking and its relation to Kemeny's method and Slater's rule
cites work: The Dodgson ranking and the Borda count: a binary comparison
cites work: Approximability of Dodgson's rule
cites work: Q3524718
cites work: The learnability of voting rules
cites work: A comparison of Dodgson's method and Kemeny's rule
cites work: A comparison of Dodgson's method and the Borda count
cites work: Q4527015
cites work: Exact complexity of the winner problem for Young elections
cites work: Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
cites work: Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
cites work: Extending Condorcet's rule
DOI: 10.1016/J.ARTINT.2012.04.004
description: scientific article; zbMATH DE number 6106685