z-logo
open-access-imgOpen Access
Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates
Author(s) -
Felix Brandt,
Markus Brill,
Edith Hemaspaandra,
Lane A. Hemaspaandra
Publication year - 2010
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - Uncategorized
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v24i1.7637
Subject(s) - partition (number theory) , time complexity , computer science , order (exchange) , combinatorics , running time , politics , discrete mathematics , mathematics , algorithm , law , economics , political science , finance

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

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom