In a sponsored search auction, decisions about how to rank ads impose tradeoffs between objectives such as revenue and welfare. In this paper, we examine how these tradeoffs should be made. We begin by arguing that the most natural solution concept to evaluate these tradeoffs is the lowest symmetric Nash equilibrium (SNE). As part of this argument, we generalise the well known connection between the lowest SNE and the VCG outcome. We then propose a new ranking algorithm, loosely based on the revenue-optimal auction, that uses a reserve price to order the ads (not just to filter them) and give conditions under which it raises more revenue than simply applying that reserve price. Finally, we conduct extensive simulations examining the tradeoffs enabled by different ranking algorithms and show that our proposed algorithm enables superior operating points by a variety of metrics.

Three high-performance circuit blocks of the i486 processor are described: a large, on-chip cache; a 1* clock generator; and a high-speed, 32-b adder. In addition, a summary of the methodology used to design these circuits are given. The circuit used to regulate the clock duty cycle used a feedback technique to adjust timer delays, preventing clock overlap. The timer circuit uses current mirror transistors and capacitors to create a delay interval controlled by the reference voltages. The 1* clock circuit on the i486 processor eases board design requirements by eliminating the need for double frequency clocks with tight timing.>