Abstract:
We study the problem of optimally assigning N divisible resources to M competing tasks. This is called the Nonlinear Resource Allocation Problem (RAP). Recently, we propo...Show MoreMetadata
Abstract:
We study the problem of optimally assigning N divisible resources to M competing tasks. This is called the Nonlinear Resource Allocation Problem (RAP). Recently, we proposed a new algorithm, RAP Auction [1], which finds a near optimal solution in finite time. It works for monotonic convex cost functions and has a simple computation structure. In this paper, we propose an elegant extension which enables RAP Auction to have pseudo-polynomial complexity.
Published in: Proceedings of the 2011 American Control Conference
Date of Conference: 29 June 2011 - 01 July 2011
Date Added to IEEE Xplore: 18 August 2011
ISBN Information: