Polyhedral sampling for multiattribute preference elicitation
暂无分享,去创建一个
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.
[1] Murray Campbell,et al. Evaluating multiple attribute items using queries , 2001, EC '01.
[2] John R. Hauser,et al. Fast Polyhedral Adaptive Conjoint Estimation , 2002 .