|
Abstract : |
We consider the problem of designing fast and strategyproof auction mechanisms for dynamic resource allocation problems in distributed systems. We propose a scalable design for an exchange for data staging between multiple request and service agents. Incoming jobs are distributed into auction pools and matched against sequences of auctions. We introduce a novel virtual worlds construction to extend a fast and strat-egyproof mechanism to our setting, and retain strategyproofness over a sequence of auctions. The goods for sale in an individual auction are selected by partitioning a service provider's available capacity into smaller consignments. A fair sharing method is used to assign an individual seller to each auction. We present experimental results to demonstrate the efficiency and strategyproofness of the mechanism in an implemented system. i, |
