Skip to main navigation
Skip to search
Skip to main content
Tel Aviv University Home
Update Request & User Guide (TAU staff only)
Home
Experts
Research units
Research output
Datasets
Prizes
Activities
Press/Media
Search by expertise, name or affiliation
On the approximability of Dodgson and Young elections
Ioannis Caragiannis
, Jason A. Covey
,
Michal Feldman
, Christopher M. Homan
, Christos Kaklamanis
, Nikos Karanikolas
, Ariel D. Procaccia
*
, Jeffrey S. Rosenschein
*
Corresponding author for this work
University of Patras
Rochester Institute of Technology
Hebrew University of Jerusalem
Microsoft USA
Harvard University
Research output
:
Contribution to journal
›
Article
›
peer-review
20
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'On the approximability of Dodgson and Young elections'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Greedy Algorithm
100%
Approximability
100%
Approximates
50%
Polynomial Time
50%
Condorcet
50%
Theory Choice
50%
Keyphrases
Dodgson
100%
Voting Rules
40%
NP-hard
40%
Greedy Algorithm
40%
Number of Alternatives
20%
Social Choice
20%
Approximation Ratio
20%
Harmonic numbers
20%
Condorcet Winner
20%
Quasi-polynomial Time Algorithms
20%
Inapproximability Results
20%
Social Choice Theory
20%
Computer Science
Greedy Algorithm
100%
Approximation (Algorithm)
50%
Approximation Ratio
50%
polynomial-time algorithm
50%
Social Choice Theory
50%