97 search results - page 4 / 20 » Randomized algorithms for online bounded bidding |
LATIN
2010
Springer
13 years 9 months ago
2010
Springer
We study the problem of designing truthful algorithms for scheduling a set of tasks, each one owned by a selfish agent, to a set of parallel (identical or unrelated) machines in or...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
ALT
2010
Springer
13 years 9 months ago
2010
Springer
Online learning and kernel learning are two active research topics in machine learning. Although each of them has been studied extensively, there is a limited effort in addressing ...
WEA
2005
Springer
14 years 28 days ago
2005
Springer
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...
ALGORITHMICA
2010
13 years 7 months ago
2010
We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fash...