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 …

We develop a Bayes–Nash analysis of the generalized second-price (GSP) auction, the multi-unit auction used by search … first. When an efficient equilibrium exists, we provide a necessary and sufficient condition for the auction revenue to …

social welfare. They persist in current auction-based PPA mechanisms, such as the ones used by Google, Yahoo!, and Microsoft …

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 …

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 …

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

Yahoo! employ an auction mechanism wherein firms can bid, for a better placement in the (sponsored) search results, on …