Selective call out and real time bidding

Tanmoy Chakraborty, Eyal Even-Dar, Sudipto Guha, Yishay Mansour, Shanmugavelayutham Muthukrishnan

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

    Abstract

    Ads on the Internet are increasingly sold via ad exchanges such as RightMedia, AdECN and Doubleclick Ad Exchange. These exchanges allow real-time bidding, that is, each time the publisher contacts the exchange, the exchange "calls out" to solicit bids from ad networks. This solicitation introduces a novel aspect, in contrast to existing literature. This suggests developing a joint optimization framework which optimizes over the allocation and well as solicitation. We model this selective call out as an online recurrent Bayesian decision framework with bandwidth type constraints. We obtain natural algorithms with bounded performance guarantees for several natural optimization criteria. We show that these results hold under different call out constraint models, and different arrival processes. Interestingly, the paper shows that under MHR assumptions, the expected revenue of generalized second price auction with reserve is constant factor of the expected welfare. Also the analysis herein allow us prove adaptivity gap type results for the adwords problem.

    Original languageEnglish (US)
    Title of host publicationInternet and Network Economics - 6th International Workshop, WINE 2010, Proceedings
    Pages145-157
    Number of pages13
    DOIs
    StatePublished - Dec 1 2010
    Event6th International Workshop on Internet and Network Economics, WINE 2010 - Stanford, CA, United States
    Duration: Dec 13 2010Dec 17 2010

    Publication series

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

    Conference

    Conference6th International Workshop on Internet and Network Economics, WINE 2010
    CountryUnited States
    CityStanford, CA
    Period12/13/1012/17/10

    Fingerprint

    Bidding
    Internet
    Bandwidth
    Performance Guarantee
    Optimization
    Adaptivity
    Auctions
    Welfare
    Optimise
    Contact
    Real-time
    Model

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computer Science(all)

    Cite this

    Chakraborty, T., Even-Dar, E., Guha, S., Mansour, Y., & Muthukrishnan, S. (2010). Selective call out and real time bidding. In Internet and Network Economics - 6th International Workshop, WINE 2010, Proceedings (pp. 145-157). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6484 LNCS). https://doi.org/10.1007/978-3-642-17572-5_12

    Selective call out and real time bidding. / Chakraborty, Tanmoy; Even-Dar, Eyal; Guha, Sudipto; Mansour, Yishay; Muthukrishnan, Shanmugavelayutham.

    Internet and Network Economics - 6th International Workshop, WINE 2010, Proceedings. 2010. p. 145-157 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6484 LNCS).

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

    Chakraborty, T, Even-Dar, E, Guha, S, Mansour, Y & Muthukrishnan, S 2010, Selective call out and real time bidding. in Internet and Network Economics - 6th International Workshop, WINE 2010, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6484 LNCS, pp. 145-157, 6th International Workshop on Internet and Network Economics, WINE 2010, Stanford, CA, United States, 12/13/10. https://doi.org/10.1007/978-3-642-17572-5_12
    Chakraborty T, Even-Dar E, Guha S, Mansour Y, Muthukrishnan S. Selective call out and real time bidding. In Internet and Network Economics - 6th International Workshop, WINE 2010, Proceedings. 2010. p. 145-157. (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-17572-5_12
    Chakraborty, Tanmoy ; Even-Dar, Eyal ; Guha, Sudipto ; Mansour, Yishay ; Muthukrishnan, Shanmugavelayutham. / Selective call out and real time bidding. Internet and Network Economics - 6th International Workshop, WINE 2010, Proceedings. 2010. pp. 145-157 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{49b101d93533439289c545f0efebb34c,
    title = "Selective call out and real time bidding",
    abstract = "Ads on the Internet are increasingly sold via ad exchanges such as RightMedia, AdECN and Doubleclick Ad Exchange. These exchanges allow real-time bidding, that is, each time the publisher contacts the exchange, the exchange {"}calls out{"} to solicit bids from ad networks. This solicitation introduces a novel aspect, in contrast to existing literature. This suggests developing a joint optimization framework which optimizes over the allocation and well as solicitation. We model this selective call out as an online recurrent Bayesian decision framework with bandwidth type constraints. We obtain natural algorithms with bounded performance guarantees for several natural optimization criteria. We show that these results hold under different call out constraint models, and different arrival processes. Interestingly, the paper shows that under MHR assumptions, the expected revenue of generalized second price auction with reserve is constant factor of the expected welfare. Also the analysis herein allow us prove adaptivity gap type results for the adwords problem.",
    author = "Tanmoy Chakraborty and Eyal Even-Dar and Sudipto Guha and Yishay Mansour and Shanmugavelayutham Muthukrishnan",
    year = "2010",
    month = "12",
    day = "1",
    doi = "10.1007/978-3-642-17572-5_12",
    language = "English (US)",
    isbn = "3642175716",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    pages = "145--157",
    booktitle = "Internet and Network Economics - 6th International Workshop, WINE 2010, Proceedings",

    }

    TY - GEN

    T1 - Selective call out and real time bidding

    AU - Chakraborty, Tanmoy

    AU - Even-Dar, Eyal

    AU - Guha, Sudipto

    AU - Mansour, Yishay

    AU - Muthukrishnan, Shanmugavelayutham

    PY - 2010/12/1

    Y1 - 2010/12/1

    N2 - Ads on the Internet are increasingly sold via ad exchanges such as RightMedia, AdECN and Doubleclick Ad Exchange. These exchanges allow real-time bidding, that is, each time the publisher contacts the exchange, the exchange "calls out" to solicit bids from ad networks. This solicitation introduces a novel aspect, in contrast to existing literature. This suggests developing a joint optimization framework which optimizes over the allocation and well as solicitation. We model this selective call out as an online recurrent Bayesian decision framework with bandwidth type constraints. We obtain natural algorithms with bounded performance guarantees for several natural optimization criteria. We show that these results hold under different call out constraint models, and different arrival processes. Interestingly, the paper shows that under MHR assumptions, the expected revenue of generalized second price auction with reserve is constant factor of the expected welfare. Also the analysis herein allow us prove adaptivity gap type results for the adwords problem.

    AB - Ads on the Internet are increasingly sold via ad exchanges such as RightMedia, AdECN and Doubleclick Ad Exchange. These exchanges allow real-time bidding, that is, each time the publisher contacts the exchange, the exchange "calls out" to solicit bids from ad networks. This solicitation introduces a novel aspect, in contrast to existing literature. This suggests developing a joint optimization framework which optimizes over the allocation and well as solicitation. We model this selective call out as an online recurrent Bayesian decision framework with bandwidth type constraints. We obtain natural algorithms with bounded performance guarantees for several natural optimization criteria. We show that these results hold under different call out constraint models, and different arrival processes. Interestingly, the paper shows that under MHR assumptions, the expected revenue of generalized second price auction with reserve is constant factor of the expected welfare. Also the analysis herein allow us prove adaptivity gap type results for the adwords problem.

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

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

    U2 - 10.1007/978-3-642-17572-5_12

    DO - 10.1007/978-3-642-17572-5_12

    M3 - Conference contribution

    SN - 3642175716

    SN - 9783642175718

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

    SP - 145

    EP - 157

    BT - Internet and Network Economics - 6th International Workshop, WINE 2010, Proceedings

    ER -