Optimal allocation in combinatorial auctions with quadratic utility functions

Akiyoshi Shioura, Shunya Suzuki

研究成果: Conference contribution

1 被引用数 (Scopus)

抄録

We discuss the optimal allocation problem in combinatorial auction, where the items are allocated to bidders so that the sum of the bidders' utilities is maximized. In this paper, we consider the case where utility functions are given by quadratic functions; the class of quadratic utility functions has a succinct representation but is sufficiently general. The main aim of this paper is to show the computational complexity of the optimal allocation problem with quadratic utility functions. We consider the cases where utility functions are submodular and supermodular, and show NP-hardness and/or polynomial-time exact/approximation algorithm. These results are given by using the relationship with graph cut problems such as the min/max cut problem and the multiway cut problem.

本文言語English
ホスト出版物のタイトルTheory and Applications of Models of Computation - 8th Annual Conference, TAMC 2011, Proceedings
ページ142-153
ページ数12
DOI
出版ステータスPublished - 2011 5月 13
イベント8th Annual Conference on Theory and Applications of Models of Computation, TAMC 2011 - Tokyo, Japan
継続期間: 2011 5月 232011 5月 25

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
6648 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other8th Annual Conference on Theory and Applications of Models of Computation, TAMC 2011
国/地域Japan
CityTokyo
Period11/5/2311/5/25

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Optimal allocation in combinatorial auctions with quadratic utility functions」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル