97 search results - page 14 / 20 » Randomized algorithms for online bounded bidding |
SIGECOM
2010
ACM
14 years 9 days 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...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
In this paper we study the online learning problem involving rested and restless multiarmed bandits with multiple plays. The system consists of a single player/user and a set of K...
COCOON
1998
Springer
13 years 11 months ago
1998
Springer
In this paper, we generalize the Ski-Rental Problem to the Bahncard Problem which is an online problem of practical relevance for all travelers. The Bahncard is a railway pass of t...
JDA
2006
13 years 7 months ago
2006
Traditionally, on-line problems have been studied under the assumption that there is a unique sequence of requests that must be served. This approach is common to most general mod...
IPPS
2000
IEEE
13 years 12 months ago
2000
IEEE
In this paper, we study the problem of on demand minimum length packet scheduling in single-hop multichannel systems. Examples of these systems are those centered around switching...