1. Bachmeier, G., et al.: $$k$$-majority digraphs and the hardness of voting with a constant number of voters. J. Comput. Syst. Sci. 105, 130–157 (2019)
2. Batchelder, W., Colonius, H., Dzhafarov, E., Myung, J.: New Handbook of Mathematical Psychology, vol. 1. Cambridge University Press, Foundations and Methodology (2016)
3. Block, H., Marschak, J.: Random orderings and stochastic theories of response. In: Olkin, I. (ed.) Contributions to Probability and Statistics. Stanford University Press (1960)
4. Cameron, T., Charmot, S., Pulaj, J.: On the linear ordering problem and the rankability of data. Found. Data Sci. 3(2), 133–149 (2021)
5. Chen, X., Hu, X., Zang, W.: A min-max theorem on tournaments. SIAM J. Comput. 37, 923–937 (2007)