ML Anthology

Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates

Felix Brandt, Markus Brill, Edith Hemaspaandra, Lane A. Hemaspaandra
JAIR 2015 pp. 439-496
doi:10.1613/JAIR.4647 /jair/2015/brandt2015jair-bypassing/
JAIR Semantic Scholar

Cite

Text

Brandt et al. "Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates." Journal of Artificial Intelligence Research, 2015. doi:10.1613/JAIR.4647

Markdown

[Brandt et al. "Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates." Journal of Artificial Intelligence Research, 2015.](https://mlanthology.org/jair/2015/brandt2015jair-bypassing/) doi:10.1613/JAIR.4647

BibTeX

@article{brandt2015jair-bypassing,
  title     = {{Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates}},
  author    = {Brandt, Felix and Brill, Markus and Hemaspaandra, Edith and Hemaspaandra, Lane A.},
  journal   = {Journal of Artificial Intelligence Research},
  year      = {2015},
  pages     = {439-496},
  doi       = {10.1613/JAIR.4647},
  volume    = {53},
  url       = {https://mlanthology.org/jair/2015/brandt2015jair-bypassing/}
}