A double-sided multiunit combinatorial auction for substitutes: Theory and algorithms
Combinatorial exchanges have existed for a long time in securities markets. In these auctions buyers and sellers can place orders on combinations, or bundles of different securities. These orders are conjunctive: they are matched only if the full bundle is available. On business-to-business (B2B) exchanges, buyers have the choice to receive the same product with different attributes; for instance the same product can be produced by different sellers. A buyer indicates his preference by submitting a disjunctive order, where he specifies the quantity he wants of each particular good and what limit price he is willing to pay for each good, thus providing a subjective valuation of each attribute. Only the goods with the best prices will be traded. This article considers a doubled-sided multiunit combinatorial auction for substitutes, that is, a uniform price auction where buyers and sellers place both types of orders, conjunctive (AND orders) and disjunctive (XOR orders). We show that linear competitive prices exist. We also propose an algorithm to clear the market, which is particularly efficient when the number of traders is large, and the goods are divisible.
combinatorial auctions economic equilibrium