General combinatorial auctions—auctions in which bidders place unrestricted bids for bundles of goods—are the subject of increasing study. Much of this work has focused on alg...
This paper presents a method for designing bundles in a combinatorial auction protocol that is robust against false-name bids. Internet auctions have become an integral part of El...
The choice of a bidding language is crucial in auction design in order to correctly capture bidder utilities. We propose a new bidding model for the Adwords auctions of search eng...
This paper describes simulations designed to test the relative efficiency of two different sequential auction mechanisms for allocating compute resources between users in a shared...
We present a novel algorithm for computing the optimal winning bids in a combinatorial auction (CA), that is, an auction in which bidders bid for bundles of goods. All previously ...
Kevin Leyton-Brown, Yoav Shoham, Moshe Tennenholtz