About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
ACM Conference on Electronic Commerce 2003
Conference paper
Polyhedral sampling for multiattribute preference elicitation
Abstract
A basic requirement for running multiattribute auctions is knowledge of the utility function of the buyer that trades off nonprice attributes against price. We present and study an approach that elicits this preference structure based on a markovian polyhedral sampling scheme called the " Hit-and-Run" algorithm. An advantage of this technique is its relative simplicity - it relies only on matrix algebra as opposed to the use of nonlinear optimization techniques by other methods in the literature. Computational results suggest that this method is fast and accurate.