Abstract
We introduce PrefLib: A Library for Preferences; an online resource located at http://www.preflib.org . 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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bache, K., Lichman, M.: UCI machine learning repository, University of California, Irvine, School of Information and Computer Sciences (2013), http://archive.ics.uci.edu/ml
Bennett, J., Lanning, S.: The Netflix prize. In: Proceedings of the KDD Cup and Workshop (2007)
Boutilier, C., Brafman, R.I., Domshlak, C., Hoos, H.H., Poole, D.: CP-nets: A tool for representing and reasoning with conditional ceteris paribus preference statements. Journal of Artificial Intelligence Research (JAIR) 21, 135–191 (2004)
Davies, J., Katsirelos, G., Narodytska, N., Walsh, T.: Complexity of and algorithms for Borda manipulation. In: Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence (AAAI 2011), pp. 657–662. AAAI Press (2011)
Dickerson, J.P., Procaccia, A.D., Sandholm, T.: Optimizing kidney exchange with transplant chains: Theory and reality. In: Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2012), pp. 711–718 (2012)
Friedgut, E., Kalai, G., Nisan, N.: Elections can be manipulated often. In: Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2008), pp. 243–249. IEEE Computer Society Press (2008)
Gent, I.P., Walsh, T.: CSPlib: A benchmark library for constraints. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 480–481. Springer, Heidelberg (1999)
Gusfield, D., Irving, R.W.: The Stable Marriage Problem: Structure and Algorithms. MIT Press, Cambridge (1989)
Hall, M., Frank, E., Holmes, G., Pfahringer, B., Reutemann, P., Witten, I.H.: The WEKA data mining software: an update. ACM SIGKDD Explorations Newsletter 11(1), 10–18 (2009)
Lu, T., Boutilier, C.: Robust approximation and incremental elicitation in voting protocols. In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, pp. 287–293. AAAI Press (2011)
Mattei, N.: Empirical evaluation of voting rules with strictly ordered preference data. In: Brafman, R. (ed.) ADT 2011. LNCS, vol. 6992, pp. 165–177. Springer, Heidelberg (2011)
Mattei, N.: Decision Making Under Uncertainty: Theoretical and Empirical Results on Social Choice, Manipulation, and Bribery. Ph.D. thesis, University of Kentucky (2012)
Mattei, N., Forshee, J., Goldsmith, J.: An empirical study of voting rules and manipulation with large datasets. In: Fourth International Workshop on Computational Social Choice (COMSOC 2012). Springer (2012)
Moulin, H.: Fair Division and Collective Welfare. The MIT Press (2004)
Popova, A., Regenwetter, M., Mattei, N.: A behavioral perspective on social choice. Annals of Mathematics and Artificial Intelligence (to appear, 2013)
Procaccia, A.D., Rosenschein, J.S.: Average-case tractability of manipulation in voting via the fraction of manipulators. In: Proceedings of 6th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2007), pp. 718–720. IFAAMAS (2007)
Regenwetter, M., Grogman, B., Marley, A.A.J., Testlin, I.M.: Behavioral Social Choice: Probabilistic Models, Statistical Inference, and Applications. Cambridge Univ. Press (2006)
Regenwetter, M., Kim, A., Kantor, A., Ho, M.H.R.: The unexpected empirical consensus among consensus methods. Psychological Science 18(7), 629–635 (2007)
Ricci, F., Rokach, L., Shapira, B.: Introduction to recommender systems handbook. In: Recommender Systems Handbook, pp. 1–35. Springer (2011)
Skowron, P., Faliszewski, P., Slinko, A.: Achieving fully proportional representation is easy in practice. In: Proceedings of 12th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2013), pp. 399–406 (2013)
Tideman, T.N., Plassmann, F.: Modeling the outcomes of vote-casting in actual elections. In: Electoral Systems, pp. 217–251. Springer (2012)
Walsh, T.: Where are the really hard manipulation problems? The phase transition in manipulating the veto rule. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 324–329 (2009)
Walsh, T.: An empirical study of the manipulability of single transferable voting. In: Proceedings of the 19th European Conference on Artificial Intelligence (ECAI 2010). Frontiers in Artificial Intelligence and Applications, vol. 215, pp. 257–262. IOS Press (2010)
Walsh, T.: Where are the hard manipulation problems? Journal of Artificial Intelligence Research 42, 1–39 (2011)
Xia, L., Conitzer, V.: Generalized scoring rules and the frequency of coalitional manipulability. In: EC 2008: Proceedings of the 9th ACM conference on Electronic Commerce, pp. 109–118. ACM (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mattei, N., Walsh, T. (2013). PrefLib: A Library for Preferences http://www.preflib.org . In: Perny, P., Pirlot, M., Tsoukiàs, A. (eds) Algorithmic Decision Theory. ADT 2013. Lecture Notes in Computer Science(), vol 8176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41575-3_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-41575-3_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41574-6
Online ISBN: 978-3-642-41575-3
eBook Packages: Computer ScienceComputer Science (R0)