Robustness of the Incentive Compatible Combinatorial Auction
将理论上需求揭示的Vickrey拍卖置于实验环境中，检验其在组合商品分配中的效率表现，并与替代机制比较，发现即使存在误报也能保持高效率。
Abstract Goods are said to be combinatorial when the value of a bundle of goods is not equal to the sum of the values of the same goods unbundled. Investigations of combinatorial allocation problems should recognize that there are two separate aspects of such problems: an environmental distinction between multiple-unit allocation problems which involve combinatorial goods and those which do not do so, and an institutional distinction between auctions in which combinatorial values can be expressed as part of the bidding rules and those in which they cannot. Forsythe and Isaac (Research in Experimental Economics, Vol. 2 (1982). Greenwich, Conn.: JAI Press, Inc.) reports the extension of the Vickrey auction into a demand-revealing, multiple unit, private goods auction that can incorporate combinatorial values. This current paper places that theoretically demand-revealing institution in a series of experimental environments in order to generate results (e.g. efficiencies) which may serve as a benchmark for other auctions (combinatorial or otherwise) whose implementation characteristics may be more favorable. To aid in interpretation of our Vickrey experimental results, we also provide results of alternatives to Vickrey allocations from both institutional and heuristic sources, as well as a discussion of the source of the Vickrey auctions high efficiencies even in the presence of misrevelation.