Optimal allocation in combinatorial auctions with quadratic utility functions

Akiyoshi Shioura, Shunya Suzuki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish
Title of host publicationTheory and Applications of Models of Computation - 8th Annual Conference, TAMC 2011, Proceedings
Pages142-153
Number of pages12
DOIs
Publication statusPublished - 2011 May 13
Event8th Annual Conference on Theory and Applications of Models of Computation, TAMC 2011 - Tokyo, Japan
Duration: 2011 May 232011 May 25

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6648 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other8th Annual Conference on Theory and Applications of Models of Computation, TAMC 2011
Country/TerritoryJapan
CityTokyo
Period11/5/2311/5/25

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Optimal allocation in combinatorial auctions with quadratic utility functions'. Together they form a unique fingerprint.

Cite this