Sciweavers

212 search results - page 2 / 43
» Competitive Online Approximation of the Optimal Search Ratio
Sort
View
WINE
2009
Springer
172views Economy» more  WINE 2009»
13 years 11 months ago
An Online Multi-unit Auction with Improved Competitive Ratio
We improve the best known competitive ratio (from 1/4 to 1/2), for the online multi-unit allocation problem, where the objective is to maximize the single-price revenue. Moreover, ...
Sourav Chakraborty, Nikhil R. Devanur
STOC
2003
ACM
152views Algorithms» more  STOC 2003»
14 years 5 months ago
Reducing truth-telling online mechanisms to online optimization
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...
Baruch Awerbuch, Yossi Azar, Adam Meyerson
SWAT
1994
Springer
117views Algorithms» more  SWAT 1994»
13 years 9 months ago
New On-Line Algorithms for the Page Replication Problem
We present improved competitive on-line algorithms for the page replication problem and concentrate on important network topologies for which algorithms with a constant competitiv...
Susanne Albers, Hisashi Koga
JCO
2006
83views more  JCO 2006»
13 years 5 months ago
Separating online scheduling algorithms with the relative worst order ratio
The relative worst order ratio is a measure for the quality of online algorithms. Unlike the competitive ratio, it compares algorithms directly without involving an optimal offline...
Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt
SIGECOM
2009
ACM
108views ECommerce» more  SIGECOM 2009»
13 years 11 months ago
Selling ad campaigns: online algorithms with cancellations
We study online pricing problems in markets with cancellations, i.e., markets in which prior allocation decisions can be revoked, but at a cost. In our model, a seller receives re...
Moshe Babaioff, Jason D. Hartline, Robert D. Klein...