Online Ad assignment with free disposal

Jon Feldman, Nitish Korula, Vahab Mirrokni, Shanmugavelayutham Muthukrishnan, Martin Pál

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    We study an online weighted assignment problem with a set of fixed nodes corresponding to advertisers and online arrival of nodes corresponding to ad impressions. Advertiser a has a contract for n(a) impressions, and each impression has a set of weighted edges to advertisers. The problem is to assign the impressions online so that while each advertiser a gets n(a) impressions, the total weight of edges assigned is maximized. Our insight is that ad impressions allow for free disposal, that is, advertisers are indifferent to, or prefer being assigned more than n(a) impressions without changing the contract terms. This means that the value of an assignment only includes the n(a) highest-weighted items assigned to each node a. With free disposal, we provide an algorithm for this problem that achieves a competitive ratio of 1-1/e against the offline optimum, and show that this is the best possible ratio. We use a primal/dual framework to derive our results, applying a novel exponentially-weighted dual update rule. Furthermore, our algorithm can be applied to a general set of assignment problems including the ad words problem as a special case, matching the previously known 1-1/e competitive ratio.

    Original languageEnglish (US)
    Title of host publicationInternet and Network Economics - 5th International Workshop, WINE 2009, Proceedings
    Pages374-385
    Number of pages12
    DOIs
    StatePublished - Dec 1 2009
    Event5th International Workshop on Internet and Network Economics, WINE 2009 - Rome, Italy
    Duration: Dec 14 2009Dec 18 2009

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume5929 LNCS
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Conference

    Conference5th International Workshop on Internet and Network Economics, WINE 2009
    CountryItaly
    CityRome
    Period12/14/0912/18/09

    Fingerprint

    Assignment
    Competitive Ratio
    Assignment Problem
    Vertex of a graph
    Word problem
    Primal-dual
    Assign
    Update
    Term
    Framework

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computer Science(all)

    Cite this

    Feldman, J., Korula, N., Mirrokni, V., Muthukrishnan, S., & Pál, M. (2009). Online Ad assignment with free disposal. In Internet and Network Economics - 5th International Workshop, WINE 2009, Proceedings (pp. 374-385). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5929 LNCS). https://doi.org/10.1007/978-3-642-10841-9_34

    Online Ad assignment with free disposal. / Feldman, Jon; Korula, Nitish; Mirrokni, Vahab; Muthukrishnan, Shanmugavelayutham; Pál, Martin.

    Internet and Network Economics - 5th International Workshop, WINE 2009, Proceedings. 2009. p. 374-385 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5929 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Feldman, J, Korula, N, Mirrokni, V, Muthukrishnan, S & Pál, M 2009, Online Ad assignment with free disposal. in Internet and Network Economics - 5th International Workshop, WINE 2009, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5929 LNCS, pp. 374-385, 5th International Workshop on Internet and Network Economics, WINE 2009, Rome, Italy, 12/14/09. https://doi.org/10.1007/978-3-642-10841-9_34
    Feldman J, Korula N, Mirrokni V, Muthukrishnan S, Pál M. Online Ad assignment with free disposal. In Internet and Network Economics - 5th International Workshop, WINE 2009, Proceedings. 2009. p. 374-385. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-10841-9_34
    Feldman, Jon ; Korula, Nitish ; Mirrokni, Vahab ; Muthukrishnan, Shanmugavelayutham ; Pál, Martin. / Online Ad assignment with free disposal. Internet and Network Economics - 5th International Workshop, WINE 2009, Proceedings. 2009. pp. 374-385 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{ca9a9143854740548e72f7eab79867a3,
    title = "Online Ad assignment with free disposal",
    abstract = "We study an online weighted assignment problem with a set of fixed nodes corresponding to advertisers and online arrival of nodes corresponding to ad impressions. Advertiser a has a contract for n(a) impressions, and each impression has a set of weighted edges to advertisers. The problem is to assign the impressions online so that while each advertiser a gets n(a) impressions, the total weight of edges assigned is maximized. Our insight is that ad impressions allow for free disposal, that is, advertisers are indifferent to, or prefer being assigned more than n(a) impressions without changing the contract terms. This means that the value of an assignment only includes the n(a) highest-weighted items assigned to each node a. With free disposal, we provide an algorithm for this problem that achieves a competitive ratio of 1-1/e against the offline optimum, and show that this is the best possible ratio. We use a primal/dual framework to derive our results, applying a novel exponentially-weighted dual update rule. Furthermore, our algorithm can be applied to a general set of assignment problems including the ad words problem as a special case, matching the previously known 1-1/e competitive ratio.",
    author = "Jon Feldman and Nitish Korula and Vahab Mirrokni and Shanmugavelayutham Muthukrishnan and Martin P{\'a}l",
    year = "2009",
    month = "12",
    day = "1",
    doi = "10.1007/978-3-642-10841-9_34",
    language = "English (US)",
    isbn = "3642108407",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    pages = "374--385",
    booktitle = "Internet and Network Economics - 5th International Workshop, WINE 2009, Proceedings",

    }

    TY - GEN

    T1 - Online Ad assignment with free disposal

    AU - Feldman, Jon

    AU - Korula, Nitish

    AU - Mirrokni, Vahab

    AU - Muthukrishnan, Shanmugavelayutham

    AU - Pál, Martin

    PY - 2009/12/1

    Y1 - 2009/12/1

    N2 - We study an online weighted assignment problem with a set of fixed nodes corresponding to advertisers and online arrival of nodes corresponding to ad impressions. Advertiser a has a contract for n(a) impressions, and each impression has a set of weighted edges to advertisers. The problem is to assign the impressions online so that while each advertiser a gets n(a) impressions, the total weight of edges assigned is maximized. Our insight is that ad impressions allow for free disposal, that is, advertisers are indifferent to, or prefer being assigned more than n(a) impressions without changing the contract terms. This means that the value of an assignment only includes the n(a) highest-weighted items assigned to each node a. With free disposal, we provide an algorithm for this problem that achieves a competitive ratio of 1-1/e against the offline optimum, and show that this is the best possible ratio. We use a primal/dual framework to derive our results, applying a novel exponentially-weighted dual update rule. Furthermore, our algorithm can be applied to a general set of assignment problems including the ad words problem as a special case, matching the previously known 1-1/e competitive ratio.

    AB - We study an online weighted assignment problem with a set of fixed nodes corresponding to advertisers and online arrival of nodes corresponding to ad impressions. Advertiser a has a contract for n(a) impressions, and each impression has a set of weighted edges to advertisers. The problem is to assign the impressions online so that while each advertiser a gets n(a) impressions, the total weight of edges assigned is maximized. Our insight is that ad impressions allow for free disposal, that is, advertisers are indifferent to, or prefer being assigned more than n(a) impressions without changing the contract terms. This means that the value of an assignment only includes the n(a) highest-weighted items assigned to each node a. With free disposal, we provide an algorithm for this problem that achieves a competitive ratio of 1-1/e against the offline optimum, and show that this is the best possible ratio. We use a primal/dual framework to derive our results, applying a novel exponentially-weighted dual update rule. Furthermore, our algorithm can be applied to a general set of assignment problems including the ad words problem as a special case, matching the previously known 1-1/e competitive ratio.

    UR - http://www.scopus.com/inward/record.url?scp=76749168646&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=76749168646&partnerID=8YFLogxK

    U2 - 10.1007/978-3-642-10841-9_34

    DO - 10.1007/978-3-642-10841-9_34

    M3 - Conference contribution

    SN - 3642108407

    SN - 9783642108402

    T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    SP - 374

    EP - 385

    BT - Internet and Network Economics - 5th International Workshop, WINE 2009, Proceedings

    ER -