We investigate the design of iterative, limited-precision mechanisms for single-good auctions with dominant strategy equilibria. Our aim is to design mechanisms that minimize the ...
Abstract. We introduce take-it-or-leave-it auctions (TLAs) as an allocation mechanism that allows buyers to retain much of their private valuation information, yet generates close-...
This paper develops a new combinatorial auction protocol called the Groves Mechanism with SubModular Approximation (GM-SMA). This protocol satisfies the following characteristics:...
We study the combinatorial auction (CA) problem, in which m objects are sold to rational agents and the goal is to maximize social welfare. Of particular interest is the special ca...
In this paper, we propose a novel general framework for analysing competing double auction markets that vie for traders, who then need to choose which market to go to. Based on th...
Bing Shi, Enrico H. Gerding, Perukrishnen Vyteling...