Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, February 14, 2006, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Eva Schuberth (with Dieter Mitsche)

Collaborative Sorting

We consider the problem of eliciting product preferences for substitute goods from a population of potential consumers. The preferences are measured on an ordinal scale and are elicited by pairwise comparisons of products. Preference elicitation by pairwise comparisons is considered accurate since it often simulates real buying situations. To elicit a respondent's ranking of n products completely Ω(n log n) pairwise comparisons are necessary. These are easily too many comparisons in settings where the incentive for the respondent is not high though he might be willing to answer a few questions truthfully. Here we describe an approach to elicit typical preferences of a population by asking many persons a few questions instead of asking a few people many questions.

(Joint work with J. Giesen)

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login