Substitute valuations: Generation and structure

Substitute valuations (in some contexts called gross substitute valuations) are prominent in combinatorial auction theory. An algorithm is given in this paper for generating a substitute valuation using a random number generator. 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 polyhedrons increases with K nearly as fast as two to the power K. Consequently, under broad conditions, if a combinatorial algorithm can present an arbitrary substitute valuation given a list of input numbers, the list must grow nearly as fast as two to the power K.

[1]  Lawrence M. Ausubel,et al.  The Lovely but Lonely Vickrey Auction , 2004 .

[2]  A. Roth.  Stability and Polarization of Interests in Job Matching , 1984 .

[3]  K. Arrow,et al.  EXISTENCE OF AN EQUILIBRIUM FOR A COMPETITIVE ECONOMY , 1954 .

[4]  N. J. A. Sloane,et al.  A new table of constant weight codes , 1990, IEEE Trans. Inf. Theory.

[5]  Faruk Gul,et al.  WALRASIAN EQUILIBRIUM WITH GROSS SUBSTITUTES , 1999 .

[6]  J. Potters,et al.  Verifying gross substitutability , 2002 .

[7]  Paul R. Milgrom,et al.  Putting Auction Theory to Work: The Simultaneous Ascending Auction , 1999, Journal of Political Economy.

[8]  N. J. A. Sloane,et al.  Lower bounds for constant weight codes , 1980, IEEE Trans. Inf. Theory.

[9]  L. Hurwicz,et al.  ON THE STABILITY OF THE COMPETITIVE EQUILIBRIUM, I1 , 1958 .

[10]  Sven de Vries,et al.  Combinatorial Auctions: A Survey , 2003, INFORMS J. Comput..

[11]  Yoav Shoham,et al.  Combinatorial Auctions , 2005, Encyclopedia of Wireless Networks.

[12]  Paul R. Milgrom,et al.  Matching with Contracts , 2005 .

[13]  Kazuo Murota,et al.  M-Convex Function on Generalized Polymatroid , 1999, Math. Oper. Res..

[14]  D. Gale.  Optimal assignments in an ordered set: An application of matroid theory , 1968 .

[15]  A. Wald.  On Some Systems of Equations of Mathematical Economics , 1951 .

[16]  Paul Milgrom,et al.  Putting Auction Theory to Work , 2004 .

[17]  Bruno Strulovici,et al.  Substitute Valuations, Auctions, and Equilibrium with Discrete Goods , 2006 .

[18]  Lawrence M. Ausubel,et al.  Ascending Auctions with Package Bidding , 2002 .

[19]  Lawrence M. Ausubel.  An efficient dynamic auction for heterogeneous commodities , 2006 .

[20]  K. Murota.  Convexity and Steinitz's Exchange Property , 1996 .

[21]  Bruno Strulovici,et al.  Substitutes Valuations with Divisible Goods , 2006 .

[22]  A. Smithies.  The Stability of Competitive Equilibrium , 1942 .

[23]  Federico Echenique.  Counting combinatorial choice rules , 2007, Games Econ. Behav..

[24]  Zaifu Yang,et al.  A Note on Kelso and Crawford's Gross Substitutes Condition , 2003, Math. Oper. Res..

[25]  Daniel Lehmann,et al.  Combinatorial auctions with decreasing marginal utilities , 2001, EC '01.

[26]  Daniel Lehmann,et al.  Presentation and structure of substitutes valuations , 2004, EC '04.

[27]  Walter Wenzel,et al.  Valuated matroids: a new look at the greedy algorithm , 1989 .

[28]  Yoav Shoham,et al.  A Test Suite for Combinatorial Auctions , 2005 .

[29]  D. M. Topkis.  Supermodularity and Complementarity , 1998 .

[30]  D. Gale,et al.  Multi-Item Auctions , 1986, Journal of Political Economy.

[31]  V. Crawford,et al.  Job Matching, Coalition Formation, and Gross Substitutes , 1982 .