On the Approximability of Dodgson and Young Elections | Zendy

Ioannis Caragiannis | Zendy; Jason A. Covey | Zendy; Michal Feldman | Zendy; Christopher M. Homan | Zendy; Christos Kaklamanis | Zendy; Nikos Karanikolas | Zendy; Ariel D. Procaccia | Zendy; Jeffrey S. Rosenschein | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On the Approximability of Dodgson and Young Elections

Author(s) -

Ioannis Caragiannis,

Jason A. Covey,

Michal Feldman,

Christopher M. Homan,

Christos Kaklamanis,

Nikos Karanikolas,

Ariel D. Procaccia,

Jeffrey S. Rosenschein

Publication year - 2009

Publication title -

proceedings of the twentieth annual acm-siam symposium on discrete algorithms

Language(s) - English

Resource type - Conference proceedings

DOI - 10.1137/1.9781611973068.115

Subject(s) - condorcet method , rounding , approximation algorithm , greedy algorithm , mathematics , ranking (information retrieval) , deterministic algorithm , algorithm , social choice theory , time complexity , point (geometry) , randomized algorithm , voting , randomized rounding , combinatorics , computer science , mathematical economics , artificial intelligence , law , geometry , politics , political science , operating system

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research