✦ LIBER ✦

Combinatorial auctions

✍ Scribed by Jawad Abrache; Teodor Gabriel Crainic; Michel Gendreau; Monia Rekik

Publisher: Springer US
Year: 2007
Tongue: English
Weight: 602 KB
Volume: 153
Category: Article
ISSN: 0254-5330
DOI: 10.1007/s10479-007-0179-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Iterative Dutch combinatorial auctions

✍ Shantanu Biswas; Y. Narahari 📂 Article 📅 2005 🏛 Springer Netherlands 🌐 English ⚖ 326 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

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

Using homomorphic encryption to secure t

Using homomorphic encryption to secure the combinatorial spectrum auction without the trustworthy auctioneer

✍ Miao Pan; Xiaoyan Zhu; Yuguang Fang 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 642 KB