These Papers are Using PrefLib
Below is a list of papers that have made use of or directly referenced data stored here at PrefLib. The papers have been automatically added from Google Scholar, if there is a problem with a paper or if you want to add one paper, please contact us.
- Strategyproof peer selection using randomization, partitioning, and apportionment. H Aziz, O Lev, N Mattei, JS Rosenschein, T Walsh, Artificial Intelligence (2019).
- The Constrained Round Robin Algorithm for Fair and Efficient Allocation. H Aziz, X Huang, N Mattei, E Segal-Halevi, arXiv preprint (2019).
- The prevalence and consequences of ballot truncation in ranked-choice elections. DM Kilgour, JC Grégoire, AM Foley, Public Choice (2019).
- Very hard electoral control problems. Z Fitzsimmons, E Hemaspaandra, A Hoover et al., Proceedings of the AAAI Conference on Artificial Intelligence (2019).
- Who Is in Your Top Three? Optimizing Learning in Elections with Many Candidates. N Garg, LL Gelauff, S Sakshuwong et al., Proceedings of the AAAI Conference on Artificial Intelligence (2019).
- A quantitative analysis of multi-winner rules. M Lackner, P Skowron, arXiv preprint (2018).
- Achieving fully proportional representation by clustering voters. P Faliszewski, A Slinko, K Stahl, N Talmon, Journal of Heuristics (2018).
- Approaching rank aggregation problems by using evolution strategies: the case of the optimal bucket order problem. JA Aledo, JA Gámez, A Rosete, European Journal of Operational Research (2018).
- Choosing to Rank. S Ragain, J Ugander, arXiv preprint (2018).
- Collective schedules: Scheduling meets computational social choice. F Pascual, K Rzadca, P Skowron, Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (2018).
- Computing the Schulze Method for Large-Scale Preference Data Sets.. T Csar, M Lackner, R Pichler, Proceedings of the International Joint Conference on Artificial Intelligence (2018).
- Decision Making Over Combinatorially-Structured Domains. A Martin, KB Venable, Proceedings of the AAAI Conference on Artificial Intelligence (2018).
- Efficient algorithms using subiterative convergence for Kemeny ranking problem. PS Badal, A Das, Computers & Operations Research (2018).
- Exploring the median of permutations problem. R Milosz, S Hamel, Journal of Discrete Algorithms (2018).
- Flexible level-1 consensus ensuring stable social choice: analysis and algorithms. M Nitzan, S Nitzan, E Segal-Halevi, Social Choice and Welfare (2018).
Even more references, papers, and tutorials can be found in the proceedings of the EXPLORE Workshops:
Some Tools to Work with Preferences
Empirical experiments with real data are becoming a more fundamental part of work in computational social choice. In addition to a lightweight set of tools for working with data from PrefLib we also host documentation for several of these project. Please contact Nick if you have code that you would like to share with the community.
This is a voting simulator built for the paper A Local-Dominance Theory of Voting Equilibria. We are releasing its source code to be expanded and enhanced by the community. However, it is quite versatile in its current construction, and can be used for various simulations "as is".
Kidney failure is a life-threatening health issue that affects hundreds of thousands of people worldwide. In the US alone, the waitlist for a kidney transplant has over 100,000 patients. This list is growing: demand far outstrips supply.This codebase includes: structural elements of kidney exchange like "pools", "hospitals", and "pairs", a couple of kidney exchange graph generators, a couple of kidney exchange solvers (max weight, failure-aware, fairness-aware, individually rational), and a dynamic kidney exchange simulator.
CRISNER stands for Conditional and Relative Importance Statement Network PrEference Reasoner. It can reason about ceteris paribus preference languages such as CP-nets, TCP-nets and CP-theories. Given a preference specification (a set of preference statements) in one of these languages, CRISNER succinctly encodes its induced preference graph (IPG) into a Kripke structure model in the language of the NuSMV model checker. This Kripke model is reachability-equivalent to the induced preference graph. CRISNER generates the model only once, and then translates each query posed against this preference specification into a temporal logic formula in computation-tree temporal logic (CTL) such that the formula is verified in the Kripke model if and only if the query holds true according to the ceteris paribus semantics of the preference language. The model checker either affirms the query or returns with a counterexample. For answering queries related to equivalence and subsumption checking of two sets of preferences, CRISNER constructs a combined IPG and uses temporal queries in CTL to identify whether every dominance that holds in one also holds in the other, and vice-versa.