An Algorithmic Approach to Multi-Item Auctions with Indivisibles
In this essay the problem of finding fair equilibria in auctions with multiple heterogeneous and indivisible items is investigated. We assume an equal number of bidders demanding items as number of items, and that every bidder is assigned exactly one item. Among the theoretical results we show the existence of an equilibrium, strategy-proofness for a particular set of prices and convergence of the