Evaluating multiple attribute items using queries
- 14 October 2001
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 144-153
- https://doi.org/10.1145/501158.501174
Abstract
The task of evaluating and ranking items with multiple-attributes appears in many guises in commerce. Examples include evaluating responses to a request for quotes (RFQ) for some item and comparison shopping for an item within one or more catalogs. This task is straightforward if the value of the item can be explicitly specified by the evaluator as a function of the attribute values. However, a typical evaluator may not be able to provide the value function in explicit form. In contrast, it is intuitive for them to compare, say, two items and pick the preferable one based on all of the relevant attributes. In this paper we present a method, Q-Eval, that queries the evaluator with selected pairs of items and uses the responses to build a preference model for the evaluator. This model is then used to rank the items in order of the inferred preference. The evaluator can then pick the winning item or items by considering only the top few items in this ranked list. This should result in significant productivity improvement for the evaluator when the number of items to choose from is large. Our algorithm is novel in the way it attempts to derive a stable preference model with only a small number of user queries. This paper describes the algorithm and presents experimental results with real-life data to validate the approach.Keywords
This publication has 8 references indexed in Scilit:
- Design and implementation of an agent-based intermediary infrastructure for electronic marketsPublished by Association for Computing Machinery (ACM) ,2000
- Random walks and anO*(n5) volume algorithm for convex bodiesRandom Structures & Algorithms, 1997
- How to Make a Decision: The Analytic Hierarchy ProcessInterfaces, 1994
- A random polynomial-time algorithm for approximating the volume of convex bodiesJournal of the ACM, 1991
- Conjoint Analysis in Marketing: New Developments with Implications for Research and PracticeJournal of Marketing, 1990
- On the Complexity of Computing the Volume of a PolyhedronSIAM Journal on Computing, 1988
- The Complexity of Vertex Enumeration MethodsMathematics of Operations Research, 1983
- The complexity of computing the permanentTheoretical Computer Science, 1979