Polyhedral sampling for multiattribute preference elicitation

  • Authors:
  • Soumyadip Ghosh;Jayant Kalagnanam

  • Affiliations:
  • ORIE, Cornell University, NY;IBM T. J. Watson Center, NY

  • Venue:
  • Proceedings of the 4th ACM conference on Electronic commerce
  • Year:
  • 2003

Quantified Score

Hi-index 0.01

Visualization

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.