66 search results - page 14 / 14 » The Nonstochastic Multiarmed Bandit Problem |
SIGECOM
2010
ACM
13 years 10 months ago
2010
ACM
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...