1. Strategyproof approximation of the minimax on networks;Alon;Math. Oper. Res.,2013
2. Single transferable vote resists strategic voting;Bartholdi;Soc. Choice Welf.,1991
3. The computational difficulty of manipulating an election;Bartholdi;Soc. Choice Welf.,1989
4. Scoring rules for the allocation of indivisible goods;Baumeister,2014
5. Baumeister, D., Erdélyi, G., Erdélyi, O., Rothe, J., Bribery and control in judgment aggregation. In: F. Brandt, P. Faliszewski (Eds.), Proceedings of the 4th International Workshop on Computational Social Choice, AGH University of Science and Technology, Kraków, Poland, Sept. 2012. pp. 37–48.