IDEAS home Printed from https://ideas.repec.org/p/ecl/stabus/3967.html
   My bibliography  Save this paper

Blending Advertising with Organic Content in E-Commerce: A Virtual Bids Optimization Approach

Author

Listed:
  • Carrion, Carlos

    (JD.com)

  • Wang, Zenan

    (JD.com)

  • Nair, Harikesh

    (Stanford University)

  • Luo, Xianghong

    (JD.com)

  • Lei, Yulin

    (JD.com)

  • Lin, Xiliang

    (JD.com)

  • Chen, Wenlong

    (JD.com)

  • Hu, Qiyu

    (JD.com)

  • Peng, Changping

    (JD.com)

  • Bao, Yongjun

    (JD.com)

  • Yan, Weipeng

    (JD.com)

Abstract

In e-commerce platforms, sponsored and non-sponsored content are jointly displayed to users and both may interactively influence their engagement behavior. The former content helps advertisers achieve their marketing goals and provides a stream of ad revenue to the platform. The latter content contributes to users’ engagement with the platform, which is key to its long-term health. A burning issue for e-commerce platform design is how to blend advertising with content in a way that respects these interactions and balances these multiple business objectives. This paper describes a system developed for this purpose in the context of blending personalized sponsored content with non-sponsored content on the product detail pages of JD.com, an e-commerce company. This system has three key features: (1) Optimization of multiple competing business objectives through a new virtual bids approach and the expressiveness of the latent, implicit valuation of the platform for the multiple objectives via these virtual bids. (2) Modeling of users’ click behavior as a function of their characteristics, the individual characteristics of each sponsored content and the influence exerted by other sponsored and non-sponsored content displayed alongside through a deep learning approach; (3) Consideration of externalities in the allocation of ads, thereby making it directly compatible with a Vickrey-Clarke-Groves (VCG) auction scheme for the computation of payments in the presence of these externalities. The system is currently deployed and serving all traffic through JD.coms mobile application. Experiments demonstrating the performance and advantages of the system are presented.

Suggested Citation

  • Carrion, Carlos & Wang, Zenan & Nair, Harikesh & Luo, Xianghong & Lei, Yulin & Lin, Xiliang & Chen, Wenlong & Hu, Qiyu & Peng, Changping & Bao, Yongjun & Yan, Weipeng, 2021. "Blending Advertising with Organic Content in E-Commerce: A Virtual Bids Optimization Approach," Research Papers 3967, Stanford University, Graduate School of Business.
  • Handle: RePEc:ecl:stabus:3967
    as

    Download full text from publisher

    File URL: https://www.gsb.stanford.edu/faculty-research/working-papers/blending-advertising-organic-content-e-commerce-virtual-bids
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Hal R. Varian & Christopher Harris, 2014. "The VCG Auction in Theory and Practice," American Economic Review, American Economic Association, vol. 104(5), pages 442-445, May.
    2. Stephen A. Rhoades, 1993. "The Herfindahl-Hirschman index," Federal Reserve Bulletin, Board of Governors of the Federal Reserve System (U.S.), issue Mar, pages 188-189.
    3. repec:cup:cbooks:9781316779309 is not listed on IDEAS
    4. Roughgarden,Tim, 2016. "Twenty Lectures on Algorithmic Game Theory," Cambridge Books, Cambridge University Press, number 9781316624791, January.
    5. Roughgarden,Tim, 2016. "Twenty Lectures on Algorithmic Game Theory," Cambridge Books, Cambridge University Press, number 9781107172661, January.
    6. Marshall L. Fisher, 1981. "The Lagrangian Relaxation Method for Solving Integer Programming Problems," Management Science, INFORMS, vol. 27(1), pages 1-18, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. George Z. Gui, 2024. "Combining Observational and Experimental Data to Improve Efficiency Using Imperfect Instruments," Marketing Science, INFORMS, vol. 43(2), pages 378-391, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Konstantinos Georgalos & Indrajit Ray & Sonali SenGupta, 2020. "Nash versus coarse correlation," Experimental Economics, Springer;Economic Science Association, vol. 23(4), pages 1178-1204, December.
    2. Tommaso Denti & Doron Ravid, 2023. "Robust Predictions in Games with Rational Inattention," Papers 2306.09964, arXiv.org.
    3. Emerson Melo, 2021. "Learning in Random Utility Models Via Online Decision Problems," Papers 2112.10993, arXiv.org, revised Aug 2022.
    4. Ben Amiet & Andrea Collevecchio & Marco Scarsini & Ziwen Zhong, 2021. "Pure Nash Equilibria and Best-Response Dynamics in Random Games," Mathematics of Operations Research, INFORMS, vol. 46(4), pages 1552-1572, November.
    5. Berliant, Marcus, 2017. "Commuting and internet traffic congestion," MPRA Paper 77378, University Library of Munich, Germany.
    6. Peyman Khezr & Vijay Mohan & Lionel Page, 2024. "Strategic Bidding in Knapsack Auctions," Papers 2403.07928, arXiv.org, revised Apr 2024.
    7. Campbell, Michael, 2020. "Speculative and hedging interaction model in oil and U.S. dollar markets—Long-term investor dynamics and phases," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 540(C).
    8. Nakayama, Kazuaki & Nakamura, Ryuzo & Hisakado, Masato & Mori, Shintaro, 2020. "Optimal learning dynamics of multiagent system in restless multiarmed bandit game," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 549(C).
    9. Fuga Kiyosue & Kenjiro Takazawa, 2024. "A common generalization of budget games and congestion games," Journal of Combinatorial Optimization, Springer, vol. 48(3), pages 1-18, October.
    10. Ueda, Masahiko, 2023. "Memory-two strategies forming symmetric mutual reinforcement learning equilibrium in repeated prisoners’ dilemma game," Applied Mathematics and Computation, Elsevier, vol. 444(C).
    11. Paul Duetting & Michal Feldman & Inbal Talgam-Cohen, 2024. "Algorithmic Contract Theory: A Survey," Papers 2412.16384, arXiv.org.
    12. Etessami, Kousha, 2021. "The complexity of computing a (quasi-)perfect equilibrium for an n-player extensive form game," Games and Economic Behavior, Elsevier, vol. 125(C), pages 107-140.
    13. Mu'alem, Ahuva & Schapira, Michael, 2018. "Setting lower bounds on truthfulness," Games and Economic Behavior, Elsevier, vol. 110(C), pages 174-193.
    14. Vijay Mohan & Peyman Khezr, 2024. "Blockchains, MEV and the knapsack problem: a primer," Papers 2403.19077, arXiv.org.
    15. Xiaotie Deng & Xinyan Hu & Tao Lin & Weiqiang Zheng, 2021. "Nash Convergence of Mean-Based Learning Algorithms in First Price Auctions," Papers 2110.03906, arXiv.org, revised Feb 2023.
    16. Emerson Melo, 2022. "On the uniqueness of quantal response equilibria and its application to network games," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 74(3), pages 681-725, October.
    17. Benjamin Heymann & Alejandro Jofr'e, 2019. "Optimal auctions for networked markets with externalities," Papers 1907.10080, arXiv.org.
    18. Tom Johnston & Michael Savery & Alex Scott & Bassel Tarbush, 2023. "Game Connectivity and Adaptive Dynamics," Papers 2309.10609, arXiv.org, revised Oct 2024.
    19. Tim Roughgarden, 2018. "Complexity Theory, Game Theory, and Economics: The Barbados Lectures," Papers 1801.00734, arXiv.org, revised Feb 2020.
    20. Austin Knies & Jorge Lorca & Emerson Melo, 2020. "A Recursive Logit Model with Choice Aversion and Its Application to Transportation Networks," Papers 2010.02398, arXiv.org, revised Oct 2021.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ecl:stabus:3967. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: the person in charge (email available below). General contact details of provider: https://edirc.repec.org/data/gsstaus.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.