OPTIMAL ALLOCATION PROBLEM WITH QUADRATIC UTILITY FUNCTIONS AND ITS RELATIONSHIP WITH GRAPH CUT PROBLEM

スポンサーリンク

概要

• 論文の詳細を見る

• We discuss the optimal allocation problem in combinatorial auctions, 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 such 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 algorithms. These results are given by using the relationship with graph cut problems such as the min/max cut problem and the multiway cut problem.

著者

• Shioura Akiyoshi

  Tohoku Univ.

• Suzuki Shunya

  Tohoku University

関連論文

• EFFICIENT STRATEGY PROOF FAIR ALLOCATION ALGORITHMS
• NOTE ON THE CONTINUITY OF M-CONVEX AND L-CONVEX FUNCTIONS IN CONTINUOUS VARIABLES
• OPTIMAL ALLOCATION PROBLEM WITH QUADRATIC UTILITY FUNCTIONS AND ITS RELATIONSHIP WITH GRAPH CUT PROBLEM

スポンサーリンク