共 45 条
[1]
Ahuja R., Magnanti T., Orlin J., Network Flows: Theory, Algorithms, and Applications, (1993)
[2]
Arvind V., Kobler J., Kuhnert S., Vasudev Y., Approximate graph isomorphism, Proceedings of MFCS-12, pp. 100-111, (2012)
[3]
Babai L., Dawar A., Schweitzer P., Toran J., The graph isomorphism problem (Dagstuhl Seminar 15511), Dagstuhl Reports, 5, 12, pp. 1-17, (2015)
[4]
Ballester M., Haeringer G., A characterization of the single-peaked domain, Social Choice and Welfare, 36, 2, pp. 305-322, (2011)
[5]
Bartholdi J., Trick M., Stable matching with preferences derived from a psychological model, Operations Research Letters, 5, 4, pp. 165-169, (1986)
[6]
Berg S., Paradox of voting under an urn model: The effect of homogeneity, Public Choice, 47, 2, pp. 377-387, (1985)
[7]
Black D., The Theory of Committees and Elections, (1958)
[8]
Boehmer N., Bredereck R., Elkind E., Faliszewski P., Szufa S., Expected frequency matrices of elections: Computation, geometry, and preference learning, Proceedings of NeurIPS-2022, (2022)
[9]
Boehmer N., Bredereck R., Faliszewski P., Niedermeier R., Szufa S., Putting a compass on the map of elections, Proceedings of IJCAI-21, pp. 59-65, (2021)
[10]
Boehmer N., Cai J., Faliszewski P., Fan A., Janeczko L., Kaczmarczyk A., Was T., Properties of position matrices and their elections, Proceedings of AAAI-23, pp. 5507-5514, (2023)