Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    On Revenue Maximization in Second-Price Ad Auctions

    Most recent papers addressing the algorithmic problem of allocating advertisement space for keywords in sponsored search auctions assume that pricing is done via a first-price auction, which does not realistic...

    Yossi Azar, Benjamin Birnbaum, Anna R. Karlin, C. Thach Nguyen in Algorithms - ESA 2009 (2009)

  2. No Access

    Chapter and Conference Paper

    Improved Approximation Algorithms for Budgeted Allocations

    We provide a 3/2-approximation algorithm for an offline budgeted allocations problem with applications to sponsored search auctions. This an improvement over the e/(e − 1) approximation of Andelman and Mansour [1...

    Yossi Azar, Benjamin Birnbaum, Anna R. Karlin in Automata, Languages and Programming (2008)

  3. Chapter and Conference Paper

    Ad Auctions – Current and Future Research

    An exploding market has emerged during the last few years on the internet, the market of sponsored search slots. Advertisers are able to buy space on the webpages produced by popular search engines and place a...

    Anna R. Karlin in Algorithmic Aspects in Information and Management (2007)

  4. No Access

    Chapter and Conference Paper

    Mechanism Design for Fun and Profit

    The emergence of the Internet as one of the most important arenas for resource sharing between parties with diverse and selfish interests has led to a number of fascinating and new algorithmic problems. In the...

    Anna R. Karlin in Algorithms — ESA 2002 (2002)

  5. No Access

    Chapter and Conference Paper

    Truthful and Competitive Double Auctions

    In this paper we consider the problem of designing a mechanism for double auctions where bidders each bid to buy or sell one unit of a single commodity. We assume that each bidder’s utility value for the item ...

    Kaustubh Deshmukh, Andrew V. Goldberg, Jason D. Hartline in Algorithms — ESA 2002 (2002)

  6. No Access

    Chapter and Conference Paper

    Web Search via Hub Synthesis

    We present a probabilistic generative model for web search which captures in a unified manner three critical components of web search: how the link structure of the web is generated, how the content of a web d...

    Anna R. Karlin in Approximation, Randomization, and Combinat… (2001)

  7. No Access

    Chapter and Conference Paper

    Spectral Analysis for Data Mining

    Experimental evidence suggests that spectral techniques are valuable for a wide range of applications. A partial list of such applications include (i) semantic analysis of documents used to cluster documents i...

    Anna R. Karlin in Algorithm Engineering and Experimentation (2001)

  8. No Access

    Chapter and Conference Paper

    An Experimental Study of Data Migration Algorithms

    The data migration problem is the problem of computing a plan for moving data objects stored on devices in a network from one configuration to another. Load balancing or changing usage patterns might necessitate ...

    Eric Anderson, Joe Hall, Jason Hartline, Michael Hobbs in Algorithm Engineering (2001)

  9. No Access

    Chapter and Conference Paper

    On List Update and Work Function Algorithms

    The list update problem, a well-studied problem in dynamic data structures, can be described abstractly as a metrical task system. In this paper, we prove that a generic metrical task system algorithm, called the...

    Eric J. Anderson, Kris Hildrum, Anna R. Karlin, April Rasala in Algorithms - ESA’ 99 (1999)

  10. No Access

    Chapter

    On the performance of competitive algorithms in practice

    Anna R. Karlin in Online Algorithms (1998)