𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Informational limitations of ascending combinatorial auctions

✍ Scribed by Liad Blumrosen; Noam Nisan

Book ID
113708137
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
242 KB
Volume
145
Category
Article
ISSN
0022-0531

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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