Parameterized complexity of control problems in Maximin election

@article{Liu2010ParameterizedCO,
  title={Parameterized complexity of control problems in Maximin election},
  author={Hanying Liu and Daming Zhu},
  journal={Inf. Process. Lett.},
  year={2010},
  volume={110},
  pages={383-388}
}
Elections are a central model in a variety of areas. This paper studies parameterized computational complexity of five control problems in the Maximin election. We obtain the following results: constructive control by adding candidates is W[2]-hard with respect to the parameter ''number of added candidates''; both constructive and destructive control by adding/deleting voters are W[1]-hard with respect to the parameter ''number of added/deleted voters''. 

Similar Papers

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 26 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 26 REFERENCES