We discuss the design of multi-dimensional tender and auction mechanisms that combine Data Envelopment Analysis (DEA) and auction theory. The mechanisms select an agent to perform...
We study the recognized open problem of designing revenuemaximizing combinatorial auctions. It is unsolved even for two bidders and two items for sale. Rather than pursuing the pu...
The Combinatorial Public Projects Problem s an abstraction of resource allocation problems in which agents have preferences over alternatives, and an outcome that is to be collect...
Abstract. In a multicore transactional memory (TM) system, concurrent execution threads interact and interfere with each other through shared memory. The less interference a progra...
We revisit the problem of designing the profit-maximizing single-item auction, solved by Myerson in his seminal paper for the case in which bidder valuations are independently dis...