Finding dense and isolated submarkets in a sponsored search spending graph

  • Lang K.J. A
  • 16

    Readers

    Mendeley users who have this article in their library.
  • 3

    Citations

    Citations of this article.

Abstract

Methods for improving sponsored search revenue are often tested or deployed within a small submarket of the larger marketplace. For many applications, the ideal submarket contains a small number of nodes, a large amount of spend-ing within the submarket, and a small amount of spending leaving the submarket. We introduce an efficient algorithm for finding submarkets that are optimal for a user-specified tradeoff between these three quantities. We apply our algo-rithm to find submarkets that are both dense and isolated in a large spending graph from Yahoo! sponsored search.

Author-supplied keywords

  • Experimentation Keywords e-commerce
  • Graph Theory—Network Problems
  • H33 [Information Systems]
  • Theory
  • dense subgraphs
  • parametric flow
  • pareto-optimality
  • sparse cuts
  • sponsored search
  • vector-valued optimization

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Andersen R Lang K.J.

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free