Back to Results
First PageMeta Content
Mathematics / Voting systems / Approximation algorithm / Computational complexity theory / Logarithm / Condorcet criterion / Lewis Carroll / Voting system criteria / Voting / Social choice theory


Socially Desirable Approximations for Dodgson’s Voting Rule∗ Ioannis Caragiannis†
Add to Reading List

Document Date: 2010-08-11 10:02:19


Open Document

File Size: 242,25 KB

Share Result on Facebook

City

Rio / /

Company

Dodgson / /

Country

United States / Greece / /

/

Facility

University of Patras / Research Academic Computer Technology Institute / Harvard University / /

IndustryTerm

polynomial-time algorithms / approximation algorithm / quasi-polynomial-time algorithms / truthful approximation algorithms / homogeneous approximation algorithms / us with tools / e - commerce / tractable algorithms / monotonic exponential-time algorithm / monotonic approximation algorithm / approximation algorithms / desirable approximation algorithms / /

Organization

School of Engineering and Applied Sciences / Harvard University / University of Patras / Department of Computer Engineering and Informatics / European Union / Academic Computer Technology Institute / /

Person

Nikos Karanikolas§ Ariel / Ioannis Caragiannis† Christos Kaklamanis / Christos Kaklamanis‡ Nikos Karanikolas / Lewis Carroll / Charles Lutwidge Dodgson / /

ProvinceOrState

Copeland / /

Technology

monotonic exponential-time algorithm / socially desirable approximation algorithms / two approximation algorithms / approximation algorithm / polynomial-time algorithms / monotonic approximation algorithm / homogeneous approximation algorithms / two polynomial-time algorithms / approximation algorithms / quasi-polynomial-time algorithms / computationally tractable algorithms / truthful approximation algorithms / /

SocialTag