Sciweavers

SIGECOM
2003
ACM
110views ECommerce» more  SIGECOM 2003»
13 years 9 months ago
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...
Chaki Ng, David C. Parkes, Margo I. Seltzer
AMEC
2004
Springer
13 years 10 months ago
An Options-Based Method to Solve the Composability Problem in Sequential Auctions
Abstract. Current auctions often expose bidding agents to two difficult, yet common, problems. First, bidding agents often have the opportunity to participate in successive auctio...
Adam I. Juda, David C. Parkes