Multi-Bid Auctions for Resource Allocation

How to allocate multi-resource for multi-tasks in a limited resource system is a big challenge. In order to solve this problem, a resource allocation method based on multi-bid auctions theorem was proposed. Firstly, multi-bids were created for each task based on resource-utility curves. Then the system collected all bids and set a market clearing price to allocate resources for tasks. Finally, the maximum bid of the task was adjusted to obtain the approximate optimal system utility. Simulation results show that the proposed method prefers to allocate resources to the task with highest bid. Compared with the 0-1 integer programming algorithm, this method has lower complexity and can obtain approximate optimal system utility.