Multi-Item Auctions
研究多个物品分配给多个竞拍者（每人最多得一件）时的最优均衡价格，并设计了两种动态拍卖机制，一种精确实现该均衡，另一种可任意逼近。
A collection of items is to be distributed among several bidders, and each bidder is to receive at most one item. Assuming that the bidders place some monetary value on each of the items, it has been shown that there is a unique vector of equilibrium prices that is optimal, in a suitable sense, for the bidders. In this paper we describe two dynamic auction mechanisms: one achieves this equilibrium and the other approximates it to any desired degree of accuracy.