Abstract
Groups engaged in a mutual activity often need assistance in order to reach a joint decision. However, the group members’ personal preferences are often unknown and need to be collected. Querying for preferences can annoy the users. We suggest employing a voting mechanism that finds a winning item under incomplete settings. We present a practical method for eliciting the preferences, so that with a minimal amount of queries a winning item that certainly suits the group can be computed. The heuristic incorporates probabilistic assumptions on the users’ preferences and was evaluated on a real world datasets as well as on simulated data, showing a saving in queries to users.
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
Balakrishnan, S., Chopra, S.: Two of a kind or the ratings game?Adaptive pairwise preferences and latent factor models. Frontiers of Computer Science 6(2), 197–208 (2012)
Conitzer, V., Sandholm, T.: Communication complexity of common voting rules. In: Proc. EC 2005, pp. 78–87. ACM (2005)
Fishman, G.: Monte Carlo: concepts, algorithms, and applications. Springer (1996)
Hazon, N., Aumann, Y., Kraus, S., Wooldridge, M.: On the evaluation of election outcomes under uncertainty. Artificial Intelligence (2012)
Kalech, M., Kraus, S., Kaminka, G.A., Goldman, C.V.: Practical voting rules with partial information. Auton. Agents Multi-Agent Syst. 22(1), 151–182 (2011)
Kamishima, T., Kazawa, H., Akaho, S.: Supervised ordering-an empirical survey. In: Proc. ICDM 2005, p. 4. IEEE (2005)
Konczak, K., Lang, J.: Voting procedures with incomplete preferences. In: Proc. IJCAI 2005 (2005)
Koren, Y., Sill, J.: OrdRec: an ordinal model for predicting personalized item rating distributions. In: Proc. of the Fifth ACM RECSYS, pp. 117–124. ACM (2011)
Lu, T., Boutilier, C.: Robust approximation and incremental elicitation in voting protocols. In: Proc. of AAAI (2011)
Masthoff, J.: Group recommender systems: Combining individual models. Recommender Systems Handbook, pp. 677–702 (2011)
Naamani Dery, L., Kalech, M., Rokach, L., Shapira, B.: Iterative voting under uncertainty for group recommender systems. In: Proc. RECSYS, pp. 265–268. ACM (2010)
Pfeiffer, T., Gao, X.A., Mao, A., Chen, Y., Rand, D.G.: Adaptive Polling for Information Aggregation. In: Proc. AAAI (2012)
Shannon, C.E.: A mathematical theory of communication. ACM SIGMOBILE Mobile Computing and Communications Review 5(1), 3–55 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Naamani-Dery, L., Golan, I., Kalech, M., Rokach, L. (2014). Preference Elicitation for Group Decisions. In: Zaraté, P., Kersten, G.E., Hernández, J.E. (eds) Group Decision and Negotiation. A Process-Oriented View. GDN 2014. Lecture Notes in Business Information Processing, vol 180. Springer, Cham. https://doi.org/10.1007/978-3-319-07179-4_22
Download citation
DOI: https://doi.org/10.1007/978-3-319-07179-4_22
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07178-7
Online ISBN: 978-3-319-07179-4
eBook Packages: Computer ScienceComputer Science (R0)