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

Takayuki Ito, Makoto Yokoo, Shigeo Matsubara, Atsushi Iwasaki

研究成果: ジャーナルへの寄稿学術誌査読

抄録

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, since it allocates bundles greedily thereby avoiding an explicit combinatorial optimization problem, and (iii) it can obtain higher social surplus and revenue than can the Max-Minimal-Bundle (M-MB) protocol, which also satisfies (i) and (ii). Furthermore, this paper extends the AM-MB protocol to an open ascending-price protocol in which straight-forward bidding is an ex-post Nash equilibrium.

本文言語英語
ページ(範囲)44-51
ページ数8
ジャーナルSystems and Computers in Japan
38
9
DOI
出版ステータス出版済み - 8月 2007

!!!All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • 情報システム
  • ハードウェアとアーキテクチャ
  • 計算理論と計算数学

フィンガープリント

「Implementing a strategyproof greedy-allocation combinatorial auction and extending to ascending auction」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル