3 search results - page 1 / 1 » Asymptotically optimal strategy-proof mechanisms for two-fac... |
SIGECOM
2010
ACM
13 years 9 months ago
2010
ACM
TCS
2002
13 years 4 months ago
2002
In a heap model, solid blocks, or pieces, pile up according to the Tetris game mechanism. An optimal schedule is an in nite sequence of pieces minimizing the asymptotic growth rat...
ACMICEC
2007
ACM
13 years 8 months ago
2007
ACM
We investigate asymptotically optimal keyword auctions, that is, auctions which maximize revenue as the number of bidders grows. We do so under two alternative behavioral assumpti...