Control complexity in Bucklin and fallback voting: An experimental analysis

Gábor Erdélyi, Michael R. Fellows, Jörg Rothe, Lena Schend. Control complexity in Bucklin and fallback voting: An experimental analysis. J. Comput. Syst. Sci., 81(4):661-670, 2015. [doi]

@article{ErdelyiFRS15a,
  title = {Control complexity in Bucklin and fallback voting: An experimental analysis},
  author = {Gábor Erdélyi and Michael R. Fellows and Jörg Rothe and Lena Schend},
  year = {2015},
  doi = {10.1016/j.jcss.2014.11.003},
  url = {http://dx.doi.org/10.1016/j.jcss.2014.11.003},
  researchr = {https://researchr.org/publication/ErdelyiFRS15a},
  cites = {0},
  citedby = {0},
  journal = {J. Comput. Syst. Sci.},
  volume = {81},
  number = {4},
  pages = {661-670},
}