Virtual worlds: fast and strategyproof auctions for dynamic resource allocation

We consider the problem of designing fast and strategyproof exchanges for dynamic resource allocation problems in distributed systems. The exchange is implemented as a sequence of auctions, with dynamically arriving requests from agents matched with each auction. Each auction is associated with some consignment of the resources from a single seller. We… CONTINUE READING

1 Figure or Table



Citations per Year

66 Citations

Semantic Scholar estimates that this publication has 66 citations based on the available data.

See our FAQ for additional information.