, the other on a completion-time formulation. We show their equivalence by proving that a O(n log n) greedy algorithm leads …

initially activated, and when a job is revealed the algorithm has the option to activate new machines. The objective is to … competitive ratios of 3/2 and 5/3 for m = 2, 3 cases, respectively. Then we present an online algorithm with a competitive ratio …

processing times. We mainly propose an optimal ϕ-competitive online algorithm where ϕ ≥ 1 is a solution of equation ϕ3 + (α-1)ϕ2 …

, that is b < ∞. In this paper, we provide a best possible online algorithm for the problem with a competitive ratio of …

first show a lower bound on the competitive ratio and present an online optimal algorithm for the problem. While this … optimal algorithm has non-polynomial running time, we present another online polynomial-time near optimal algorithm for the … problem. Experimental results show that our online polynomial-time algorithm produces solutions very close to the offline …

keywords using auction mechanism. We analyze a game-theoretic model to understand the interplay between organic and sponsored … search engine algorithm) may lead to either more or less aggressive bidding for sponsored link positions depending on …

operated in 2004 to sell sponsored search listings on its search engine. We present results that indicate that this auction has …