Substitute Valuations: Generation and Structure

Bruce Hajek
Department of Electrical and Computer Engineering
University of Illinois, Urbana-Champaign


Wednesday, March 19, 2008
4:30 - 5:30 PM
Terman Engineering Center, Room 453


Abstract:

Substitute valuations (in some contexts called gross substitute valuations) are prominent in combinatorial auction theory. An algorithm is given for generating a substitute valuation through Monte Carlo simulation. In addition, the geometry of the set of all substitute valuations for a fixed number of goods K is investigated. The set consists of a union of polyhedrons, and the maximal polyhedrons are identified for K = 4. It is shown that the maximum dimension of the maximal polyhedrons increases with K nearly as fast as two to the power K. A negative implication for the problem of finding algorithms to efficiently present arbitrary substitute valuations is given.

(Available at http://arxiv.org/pdf/0712.3870v2.)








Operations Research Colloquia: http://or.stanford.edu/oras_seminars.html