A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
OPTIMAL ALLOCATION PROBLEM WITH QUADRATIC UTILITY FUNCTIONS AND ITS RELATIONSHIP WITH GRAPH CUT PROBLEM
2012
Journal of the Operations Research Society of Japan
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 glven by quadratic functions; the class of such utility functions has a succinct representation but is suMciently general. The main airn of this paper is to show the computational complexlty of the optimal allocation problem with quadratic utility functions, We
doi:10.15807/jorsj.55.92
fatcat:bgcszeb4vjdtxfh7n7m2znrh2y