Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates. Brandt, F., Brill, M., Hemaspaandra, E., & Hemaspaandra, L. A. J. Artif. Intell. Res., 53:439-496, 2015.
Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates. [link]Link  Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates. [link]Paper  bibtex   
@article{journals/jair/BrandtBHH15,
  added-at = {2017-06-21T00:00:00.000+0200},
  author = {Brandt, Felix and Brill, Markus and Hemaspaandra, Edith and Hemaspaandra, Lane A.},
  biburl = {https://www.bibsonomy.org/bibtex/2a0562a798dfd6fc2a5631c3bdde88055/dblp},
  ee = {https://doi.org/10.1613/jair.4647},
  interhash = {1591788f96c2dc87821026db6dcd74fe},
  intrahash = {a0562a798dfd6fc2a5631c3bdde88055},
  journal = {J. Artif. Intell. Res.},
  keywords = {dblp},
  pages = {439-496},
  timestamp = {2017-06-22T11:39:13.000+0200},
  title = {Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates.},
  url = {http://dblp.uni-trier.de/db/journals/jair/jair53.html#BrandtBHH15},
  volume = 53,
  year = 2015
}

Downloads: 0