Q-Eval: Evaluating multiple attribute items using queries

Proceedings of the ACM Conference on Electronic Commerce

Volumn , Issue , 2001, Pages 144-153

  Iyengar, Vijay S ^a   Lee, Jon ^a   Campbell, Murray ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DECISION MAKING; EVALUATION; ITERATIVE METHODS; QUERY LANGUAGES;

BID-EVALUATIONS; COMPARISON SHOPPING; MULTIPLE-ATTRIBUTES ITEMS; PREFERENCE ELICITATION; REQUEST FOR QUOTES; UTILITY FUNCTIONS;

ELECTRONIC COMMERCE;

EID: 0242539949     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. S. Arnborg. Learning in prevision space. In Proceedings of 1st International Symposium on Imprecise Probabilities and their Applications, 1999.
2. B. Bueler, A. Enge, and K. Fukuda. Exact volume computation for convex polytopes: A practical study. In Polytopes - Combinatorics and Computation. DMV-Seminars, Birkhauser Verlag, 1998. FTP site=ftp://ftp.ifor.math.ethz.ch/pub/fukuda/reports.
3. R. Caron, H. Greenberg, and A. Holder. Analytic centers and repelling inequalities. CCM 142, Center for Computational Mathematics, Mathematics Department, University of Colorado at Dlenver, Denver, CO, 1999.
4. R. Clemen. Making Hard Decisions. Duxbury Press, 1996.
5. M. Dyer. The complexity of vertex enumeration methods. Mathematics of Operations Research, 8(3):381-402, 1983.
6. M. Dyer and A. Frieze. On the complexity of computing the volume of a polyhedron. Siam Journal of Computing, 17(5):967-974, 1988.
7. M. Dyer, A. Frieze, and R. Kannan. A random polynomial time algorithm for approximating the volume of convex bodies. Journal of the ACM, 38(1):1-17, 1991.
8. K. Fukuda. Cdd - an implementation of the double description method. Technical Report Technical Report, DMA-EPFL, Institute for Operations Research, DMA-EPFL, Institute for Operations Research, ETH Zentrum, Zurich, 1993. URL= http://www.ifor.math.ethz.ch/-fukuda/cdd_home/cdd.html
9. K. Fukuda and A. Prodon. Double description method revisited. In Combinatorics and Computer Science, volume 1120, pages 91-111. Lecture Notes in Computer Science, Springer, 1996.
10. P. Green and A. Krieger. Recent contributions to optimal product positioning and buyer segmentation. European Journal of Operational Research, 41:127-141, 1989.
11. P. Green and V. Srinivasan. Conjoint analysis in marketing research: New developments and directions. Journal of Marketing, 54(4):3-19, October 1990.
12. R. Johnson. Adaptive conjoint analysis. In Sawtooth Software Conference on Perceptual Mapping, Conjoint Analysis and Computer Interviewing, pages 253-265. Sawtooth Software, 1987.
13. R. Johnson. Comment on 'adaptive conjoint analysis: Some caveats and suggestions'. Journal of Marketing Research, 28(2):223-225, May 1991.
14. 5) volume algorithm for convex bodies. Random Structures and Algorithms, 11:1-96, 1997.
15. R. Keeney and H. Raiffa. Decisions with Multiple Objectives: Preferences and Value Tradeoffs. Wiley, 1976.
16. G. Lilien, P. Kotler, and K. Moorthy. Marketing Models. Prentice Hall, 1992.
17. S. Nash and A. Sofer. Linear and Nonlinear Programming. McGraw-Hill, 1996.
18. R. Pindyck and D. Rubinfield. Microeconomics. Prentice Hall, 1997.
19. T. Saaty. How to make a decision: The analytic hierarchy process. Interfaces, 24(6):19-43, 1994.
20. G. Sonnevend. An "analytical centre" for polyhedrons and newlasses of global algorithms for linear (smooth, convex) programming. In System modelling and optimization (Budapest, 1985), pages 866-875. Springer, Berlin, 1986.
21. G. Tewari and P. Maes. Design and implementation of an agent-based intermediary infrastructure for electronic markets. In ACM Conference on Electronic Commerce, EC'00, pages 86-94, 2000.
22. L. Valiant. The complexity of computing the permanent. Theoretical Computer Science, 8(2):189-201, 1979.
23. Y. Zhang. Computational experience with the maximum-volume ellipsoid problem. In Informs National Meeting, October 1998.