Asynchronous Auction for Distributed Nonlinear Resource Allocation Problem

OpenBU

Show simple item record

dc.contributor.author Bangla, Ajay
dc.contributor.author Castañón, David
dc.date.accessioned 2011-07-21T15:02:54Z
dc.date.available 2011-07-21T15:02:54Z
dc.date.issued 2011-07-21
dc.identifier.uri http://hdl.handle.net/2144/1429
dc.description.abstract Resource Allocation Problems (RAPs) are concerned with the optimal allocation of resources to tasks. Problems in fields such as search theory, statistics, finance, economics, logistics, sensor & wireless networks fit this formulation. In literature, several centralized/synchronous algorithms have been proposed including recently proposed auction algorithm, RAP Auction. Here we present asynchronous implementation of RAP Auction for distributed RAPs. en_US
dc.description.sponsorship Air Force Office of Scientific Research (FA9550-07-1-0361) and Office of the Director, Defense Research and Engineering (Multidisciplinary University Research Initiative Grant FA9550-06-1-0324) en_US
dc.language.iso en_US en_US
dc.title Asynchronous Auction for Distributed Nonlinear Resource Allocation Problem en_US
dc.type Image en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search OpenBU


Advanced Search

Browse

Deposit Materials