暂无分享,去创建一个
[1] Lawrence G. Sager. Handbook of Computational Social Choice , 2015 .
[2] Virginia Vassilevska Williams. Fixing a Tournament , 2010, AAAI.
[3] Marc Pauly. Can strategizing in round-robin subtournaments be avoided? , 2014, Soc. Choice Welf..
[4] Nicholas R. Miller. A New Solution Set for Tournaments and Majority Voting: Further Graph- Theoretical Approaches to the Theory of Voting , 1980 .
[5] S. Matthew Weinberg,et al. Condorcet-Consistent and Approximately Strategyproof Tournament Rules , 2016, ITCS.
[6] S. Matthew Weinberg,et al. Approximately Strategyproof Tournament Rules: On Large Manipulating Sets and Cover-Consistence , 2019, ITCS.
[7] László Csató. 2018 FIFA World Cup qualification can be manipulated , 2017 .
[8] Virginia Vassilevska Williams,et al. Fixing Tournaments for Kings, Chokers, and More , 2015, IJCAI.
[9] J. Banks. Sophisticated voting outcomes and agenda control , 1984 .
[10] Moshe Tennenholtz,et al. Nonmanipulable Selections from a Tournament , 2009, IJCAI.
[11] M. Breton,et al. The Bipartisan Set of a Tournament Game , 1993 .
[12] B. Weingast,et al. Uncovered Sets and Sophisticated Voting Outcomes with Implications for Agenda Institutions , 1984 .
[13] David C. Fisher,et al. Optimal strategies for a generalized “scissors, paper, and stone” game , 1992 .
[14] Jean-François Laslier,et al. Tournament Solutions And Majority Voting , 1997 .
[15] P. Fishburn. Condorcet Social Choice Functions , 1977 .
[16] Isabelle Stanton,et al. Rigging Tournament Brackets for Weaker Players , 2011, IJCAI.
[17] Warut Suksompong,et al. Who Can Win a Single-Elimination Tournament? , 2016, AAAI.
[18] Robert D. Kleinberg,et al. Nonmanipulable Randomized Tournament Selections , 2010, Proceedings of the AAAI Conference on Artificial Intelligence.