203 search results - page 6 / 41 » A New Derandomization of Auctions |
COCO
2009
Springer
14 years 2 months ago
2009
Springer
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
COCO
2003
Springer
14 years 21 days ago
2003
Springer
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov comple...
WINE
2009
Springer
14 years 2 months ago
2009
Springer
Sponsored search auction is used by most search engines to select ads to display on the web page of a search result, according to advertisers’ bidding prices. The income of this ...
SODA
2003
ACM
13 years 8 months ago
2003
ACM
We consider the problem of revenue maximization in online auctions, that is, auctions in which bids are received and dealt with one-by-one. In this note, we demonstrate that resul...