Optimal display-ad allocation with guaranteed contracts and supply side platforms

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

Uittreksel

We study a variant of the display-ad allocation problem where an online publisher needs to decide which subset of advertisement slots should be used in order to fulfill guaranteed contracts and which subset should be sold on supply side platforms (SSPs) in order to maximize the expected revenue. Our modeling approach also takes the uncertainty associated with the sale of an impression by an SSP into account. The way that information is revealed over time allows us to model the display-ad allocation problem as a two-stage stochastic program. We refer to our model as the Stochastic Programming (SP) model. Numerical experiments show that the SP model performs well in most cases. We compare the solutions of the SP model with the solutions of an allocation policy (the Priority Assignment (PA) heuristic) that is used in practice. We find that the performance gap between the PA heuristic and the SP model depends on the fraction of total impressions that need to be allocated to the guaranteed contracts. The results suggest that the benefit of using the SP model is highest in periods where the website traffic is high compared with the targets for the guaranteed contracts.

TaalEngels
Artikelnummer106071
Aantal pagina's13
TijdschriftComputers and Industrial Engineering
Volume137
DOI's
StatusGepubliceerd - 1 nov 2019

Vingerafdruk

Stochastic programming
Display devices
Websites
Sales
Experiments

Trefwoorden

    Citeer dit

    @article{aeccab8a026d45ec9a24f7383e957a3d,
    title = "Optimal display-ad allocation with guaranteed contracts and supply side platforms",
    abstract = "We study a variant of the display-ad allocation problem where an online publisher needs to decide which subset of advertisement slots should be used in order to fulfill guaranteed contracts and which subset should be sold on supply side platforms (SSPs) in order to maximize the expected revenue. Our modeling approach also takes the uncertainty associated with the sale of an impression by an SSP into account. The way that information is revealed over time allows us to model the display-ad allocation problem as a two-stage stochastic program. We refer to our model as the Stochastic Programming (SP) model. Numerical experiments show that the SP model performs well in most cases. We compare the solutions of the SP model with the solutions of an allocation policy (the Priority Assignment (PA) heuristic) that is used in practice. We find that the performance gap between the PA heuristic and the SP model depends on the fraction of total impressions that need to be allocated to the guaranteed contracts. The results suggest that the benefit of using the SP model is highest in periods where the website traffic is high compared with the targets for the guaranteed contracts.",
    keywords = "Display-ad allocation, Integer programming, Online advertising, Stochastic programming, Supply side platforms",
    author = "Jason Rhuggenaath and Alp Akcay and Yingqian Zhang and Uzay Kaymak",
    year = "2019",
    month = "11",
    day = "1",
    doi = "10.1016/j.cie.2019.106071",
    language = "English",
    volume = "137",
    journal = "Computers & Industrial Engineering",
    issn = "0360-8352",
    publisher = "Elsevier",

    }

    TY - JOUR

    T1 - Optimal display-ad allocation with guaranteed contracts and supply side platforms

    AU - Rhuggenaath,Jason

    AU - Akcay,Alp

    AU - Zhang,Yingqian

    AU - Kaymak,Uzay

    PY - 2019/11/1

    Y1 - 2019/11/1

    N2 - We study a variant of the display-ad allocation problem where an online publisher needs to decide which subset of advertisement slots should be used in order to fulfill guaranteed contracts and which subset should be sold on supply side platforms (SSPs) in order to maximize the expected revenue. Our modeling approach also takes the uncertainty associated with the sale of an impression by an SSP into account. The way that information is revealed over time allows us to model the display-ad allocation problem as a two-stage stochastic program. We refer to our model as the Stochastic Programming (SP) model. Numerical experiments show that the SP model performs well in most cases. We compare the solutions of the SP model with the solutions of an allocation policy (the Priority Assignment (PA) heuristic) that is used in practice. We find that the performance gap between the PA heuristic and the SP model depends on the fraction of total impressions that need to be allocated to the guaranteed contracts. The results suggest that the benefit of using the SP model is highest in periods where the website traffic is high compared with the targets for the guaranteed contracts.

    AB - We study a variant of the display-ad allocation problem where an online publisher needs to decide which subset of advertisement slots should be used in order to fulfill guaranteed contracts and which subset should be sold on supply side platforms (SSPs) in order to maximize the expected revenue. Our modeling approach also takes the uncertainty associated with the sale of an impression by an SSP into account. The way that information is revealed over time allows us to model the display-ad allocation problem as a two-stage stochastic program. We refer to our model as the Stochastic Programming (SP) model. Numerical experiments show that the SP model performs well in most cases. We compare the solutions of the SP model with the solutions of an allocation policy (the Priority Assignment (PA) heuristic) that is used in practice. We find that the performance gap between the PA heuristic and the SP model depends on the fraction of total impressions that need to be allocated to the guaranteed contracts. The results suggest that the benefit of using the SP model is highest in periods where the website traffic is high compared with the targets for the guaranteed contracts.

    KW - Display-ad allocation

    KW - Integer programming

    KW - Online advertising

    KW - Stochastic programming

    KW - Supply side platforms

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

    U2 - 10.1016/j.cie.2019.106071

    DO - 10.1016/j.cie.2019.106071

    M3 - Article

    VL - 137

    JO - Computers & Industrial Engineering

    T2 - Computers & Industrial Engineering

    JF - Computers & Industrial Engineering

    SN - 0360-8352

    M1 - 106071

    ER -