PrefLib: a library for preferences. We introduce PrefLib: A library for preferences; an online resource located at “”. With the emergence of computational social choice and an increased awareness of the applicability of preference reasoning techniques to areas ranging from recommendation systems to kidney exchanges, the interest in preferences has never been higher. We hope to encourage the growth of all facets of preference reasoning by establishing a centralized repository of high quality data based around simple, delimited data formats. We detail the challenges of constructing such a repository, provide a survey of the initial release of the library, and invite the community to use and help expand PrefLib.

References in zbMATH (referenced in 24 articles )

Showing results 1 to 20 of 24.
Sorted by year (citations)

1 2 next

  1. Aziz, Haris; Biró, Péter; Gaspers, Serge; de Haan, Ronald; Mattei, Nicholas; Rastegari, Baharak: Stable matching with uncertain linear preferences (2020)
  2. Lu, Tyler; Boutilier, Craig: Preference elicitation and robust winner determination for single- and multi-winner social choice (2020)
  3. Mollica, Cristina; Tardella, Luca: PLMIX: an R package for modelling and clustering partially ranked data (2020)
  4. Turner, Heather L.; van Etten, Jacob; Firth, David; Kosmidis, Ioannis: Modelling rankings in (\mathsfR): the \textbfPlackettLucepackage (2020)
  5. Aziz, Haris; Lev, Omer; Mattei, Nicholas; Rosenschein, Jeffrey S.; Walsh, Toby: Strategyproof peer selection using randomization, partitioning, and apportionment (2019)
  6. Bachmeier, Georg; Brandt, Felix; Geist, Christian; Harrenstein, Paul; Kardel, Keyvan; Peters, Dominik; Seedig, Hans Georg: (k)-majority digraphs and the hardness of voting with a constant number of voters (2019)
  7. Caragiannis, Ioannis; Chatzigeorgiou, Xenophon; Krimpas, George A.; Voudouris, Alexandros A.: Optimizing positional scoring rules for rank aggregation (2019)
  8. D’Ambrosio, Antonio; Iorio, Carmela; Staiano, Michele; Siciliano, Roberta: Median constrained bucket order rank aggregation (2019)
  9. Nikolov, Nikolay I.; Stoimenova, Eugenia: Asymptotic properties of Lee distance (2019)
  10. Aledo, Juan A.; Gámez, José A.; Rosete, Alejandro: Approaching rank aggregation problems by using evolution strategies: the case of the optimal bucket order problem (2018)
  11. Badal, Prakash S.; Das, Ashish: Efficient algorithms using subiterative convergence for Kemeny ranking problem (2018)
  12. Heather L. Turner; Jacob van Etten; David Firth; Ioannis Kosmidis: Modelling rankings in R: the PlackettLuce package (2018) arXiv
  13. Milosz, Robin; Hamel, Sylvie: Exploring the median of permutations problem (2018)
  14. Nitzan, Mor; Nitzan, Shmuel; Segal-Halevi, Erel: Flexible level-1 consensus ensuring stable social choice: analysis and algorithms (2018)
  15. Aledo, Juan A.; Gámez, José A.; Rosete, Alejandro: Partial evaluation in rank aggregation problems (2017)
  16. Armengol, Eva; Puyol-Gruart, Josep: A reward-based approach for preference modeling: a case study (2017)
  17. D’Ambrosio, Antonio; Mazzeo, Giulio; Iorio, Carmela; Siciliano, Roberta: A differential evolution algorithm for finding the median ranking under the Kemeny axiomatic approach (2017)
  18. Pérez-Fernández, Raúl; Alonso, Pedro; Díaz, Irene; Montes, Susana; De Baets, Bernard: Monotonicity-based consensus states for the monometric rationalisation of ranking rules and how they are affected by ties (2017)
  19. Brandt, Felix; Seedig, Hans Georg: On the discriminative power of tournament solutions (2016)
  20. Cristina Mollica, Luca Tardella: PLMIX: An R package for modeling and clustering partially ranked data (2016) arXiv

1 2 next