2 papers
cs.GT2024
Discovering Consistent Subelections
Łukasz Janeczko, Jérôme Lang, Grzegorz Lisowski +1
We show how hidden interesting subelections can be discovered in ordinal elections. An interesting subelection consists of a reasonably large set of voters and a reasonably large s…
cs.GT2024
Guide to Numerical Experiments on Elections in Computational Social Choice
Niclas Boehmer, Piotr Faliszewski, Łukasz Janeczko +7
We analyze how numerical experiments regarding elections were conducted within the computational social choice literature (focusing on papers published in the IJCAI, AAAI, and AAMA…