✦ LIBER ✦

Iterative Dutch combinatorial auctions

✍ Scribed by Shantanu Biswas; Y. Narahari

Publisher: Springer Netherlands
Year: 2005
Tongue: English
Weight: 326 KB
Volume: 44
Category: Article
ISSN: 1012-2443
DOI: 10.1007/s10472-005-4687-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Combinatorial auctions

✍ Jawad Abrache; Teodor Gabriel Crainic; Michel Gendreau; Monia Rekik 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 602 KB

Design issues for combinatorial auctions

✍ Jawad Abrache; TeodorGabriel Crainic; Michel Gendreau 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 205 KB

Exact methods for combinatorial auctions

✍ Dries Goossens 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 65 KB

Integrating auction and search markets:

Integrating auction and search markets: The slow Dutch auction

✍ Paul D. Adams; Brian D. Kluger; Steve B. Wyatt 📂 Article 📅 1992 🏛 Springer US 🌐 English ⚖ 660 KB

Characterizing the Vickrey combinatorial

Characterizing the Vickrey combinatorial auction by induction

✍ Soo Hong Chew; Shigehiro Serizawa 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 171 KB

Implementing a strategyproof greedy-allo

Implementing a strategyproof greedy-allocation combinatorial auction and extending to ascending auction

✍ Takayuki Ito; Makoto Yokoo; Shigeo Matsubara; Atsushi Iwasaki 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 482 KB

## Abstract This paper proposes a new combinatorial auction protocol called Average‐Max‐Minimal‐Bundle (AM‐MB) protocol. The characteristics of the AM‐MB protocol are as follows: (i) it is strategyproof, that is, truth‐telling is a dominant strategy, (ii) the computational overhead is very low, sin