IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v64y2018i10p4590-4607.html
   My bibliography  Save this article

Procurement Policies for Mobile-Promotion Platforms

Author

Listed:
  • Manmohan Aseri

    (Naveen Jindal School of Management, University of Texas at Dallas, Richardson, Texas 75080)

  • Milind Dawande

    (Naveen Jindal School of Management, University of Texas at Dallas, Richardson, Texas 75080)

  • Ganesh Janakiraman

    (Naveen Jindal School of Management, University of Texas at Dallas, Richardson, Texas 75080)

  • Vijay Mookerjee

    (Naveen Jindal School of Management, University of Texas at Dallas, Richardson, Texas 75080)

Abstract

Mobile-promotion platforms enable advertisers (individual users or businesses) to directly launch their personalized mobile advertising campaigns. These platforms contract with advertisers to provide a certain number of impressions on mobile apps in their desired sets of geographic locations (usually cities or zip codes) within their desired time durations (for example, a month); the execution of each such a contract is referred to as a campaign. To fulfill the demands of the campaigns, the platform bids in real time at an ad exchange to win mobile impressions arising over the desired sets of locations of the campaigns and then allocates the acquired impressions among the ongoing campaigns. The core features that characterize this procurement problem—supply is uncertain, supply cannot be inventoried, and there are demand-side commitments to be met—are applicable to a variety of other business settings as well. Our analysis in this paper offers near-optimal policies for both a static model and a dynamic model of campaign arrivals. The static model represents a subscription-based setting, where customers provide information of their campaigns in advance to the platform. The dynamic model represents a setting where campaigns arrive randomly and the platform reacts to these arrivals in real time; for this model, our rolling-horizon policy periodically recomputes the platform’s procurement (or bidding) and allocation decisions. We establish performance bounds on our policies for both models and demonstrate the attractiveness of these bounds on real data. By isolating important structural features of a given set of campaigns, we discuss practical implementation issues and offer procurement-policy recommendations for a variety of settings based on these features.

Suggested Citation

  • Manmohan Aseri & Milind Dawande & Ganesh Janakiraman & Vijay Mookerjee, 2018. "Procurement Policies for Mobile-Promotion Platforms," Management Science, INFORMS, vol. 64(10), pages 4590-4607, October.
    • Handle: RePEc:inm:ormnsc:v:64:y:2018:i:10:p:4590-4607
    DOI: 10.287/mnsc.2017.2837
    as

    Download full text from publisher

    File URL: https://doi.org/10.287/mnsc.2017.2837
    Download Restriction: no
    File URL: https://libkey.io/10.287/mnsc.2017.2837?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Santiago R. Balseiro & Jon Feldman & Vahab Mirrokni & S. Muthukrishnan, 2014. "Yield Optimization of Display Advertising with Ad Exchange," Management Science, INFORMS, vol. 60(12), pages 2886-2907, December.
    2. Yunzeng Wang & Yigal Gerchak, 1996. "Periodic Review Production Models with Variable Capacity, Random Yield, and Uncertain Demand," Management Science, INFORMS, vol. 42(1), pages 130-137, January.
    3. James H. Bookbinder & Jin-Yan Tan, 1988. "Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints," Management Science, INFORMS, vol. 34(9), pages 1096-1108, September.
    4. Chris Forman & Anindya Ghose & Avi Goldfarb, 2009. "Competition Between Local and Electronic Markets: How the Benefit of Buying Online Depends on Where You Live," Management Science, INFORMS, vol. 55(1), pages 47-57, January.
    5. Ç Haksöz & S Seshadri, 2007. "Supply chain operations in the presence of a spot market: a review with discussion," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(11), pages 1412-1429, November.
    6. Sridhar Bashyam & Michael C. Fu, 1998. "Optimization of (s, S) Inventory Systems with Random Lead Times and a Service Level Constraint," Management Science, INFORMS, vol. 44(12-Part-2), pages 243-256, December.
    7. L. Elisa Celis & Gregory Lewis & Markus Mobius & Hamid Nazerzadeh, 2014. "Buy-It-Now or Take-a-Chance: Price Discrimination Through Randomized Auctions," Management Science, INFORMS, vol. 60(12), pages 2927-2948, December.
    8. Youhua (Frank) Chen & Weili Xue & Jian Yang, 2013. "Technical Note---Optimal Inventory Policy in the Presence of a Long-Term Supplier and a Spot Market," Operations Research, INFORMS, vol. 61(1), pages 88-97, February.
    9. Jing-Sheng Song & Paul Zipkin, 1993. "Inventory Control in a Fluctuating Demand Environment," Operations Research, INFORMS, vol. 41(2), pages 351-370, April.
    10. Sami Najafi-Asadolahi & Kristin Fridgeirsdottir, 2014. "Cost-per-Click Pricing for Display Advertising," Manufacturing & Service Operations Management, INFORMS, vol. 16(4), pages 482-497, October.
    11. Stefanus Jasin, 2014. "Reoptimization and Self-Adjusting Price Control for Network Revenue Management," Operations Research, INFORMS, vol. 62(5), pages 1168-1178, October.
    12. Nick Arnosti & Marissa Beck & Paul Milgrom, 2016. "Adverse Selection and Auction Design for Internet Display Advertising," American Economic Review, American Economic Association, vol. 106(10), pages 2852-2866, October.
    13. Candace Arai Yano & Hau L. Lee, 1995. "Lot Sizing with Random Yields: A Review," Operations Research, INFORMS, vol. 43(2), pages 311-334, April.
    14. Hari S. Abhyankar & Stephen C. Graves, 2001. "Creating an Inventory Hedge for Markov-Modulated Poisson Demand: An Application and Model," Manufacturing & Service Operations Management, INFORMS, vol. 3(4), pages 306-320, April.
    15. John Turner, 2012. "The Planning of Guaranteed Targeted Display Advertising," Operations Research, INFORMS, vol. 60(1), pages 18-33, February.
    16. David Maxwell Chickering & David Heckerman, 2003. "Targeted Advertising on the Web with Inventory Management," Interfaces, INFORMS, vol. 33(5), pages 71-77, October.
    17. Zheng Fang & Bin Gu & Xueming Luo & Yunjie Xu, 2015. "Contemporaneous and Delayed Sales Impact of Location-Based Mobile Promotions," Information Systems Research, INFORMS, vol. 26(3), pages 552-564, September.
    18. Stefanus Jasin & Sunil Kumar, 2012. "A Re-Solving Heuristic with Bounded Revenue Loss for Network Revenue Management with Customer Choice," Mathematics of Operations Research, INFORMS, vol. 37(2), pages 313-345, May.
    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. Abhijeet Ghoshal & Radha Mookerjee & Zhen Sun, 2023. "Serving two masters? Optimizing mobile ad contracts with heterogeneous advertisers," Production and Operations Management, Production and Operations Management Society, vol. 32(2), pages 618-636, February.

    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. Hana Choi & Carl F. Mela & Santiago R. Balseiro & Adam Leary, 2020. "Online Display Advertising Markets: A Literature Review and Future Directions," Information Systems Research, INFORMS, vol. 31(2), pages 556-575, June.
    2. Shen, Yuelin, 2018. "Pricing contracts and planning stochastic resources in brand display advertising," Omega, Elsevier, vol. 81(C), pages 183-194.
    3. Ali Hojjat & John Turner & Suleyman Cetintas & Jian Yang, 2017. "A Unified Framework for the Scheduling of Guaranteed Targeted Display Advertising Under Reach and Frequency Requirements," Operations Research, INFORMS, vol. 65(2), pages 289-313, April.
    4. Santiago R. Balseiro & Omar Besbes & Gabriel Y. Weintraub, 2015. "Repeated Auctions with Budgets in Ad Exchanges: Approximations and Design," Management Science, INFORMS, vol. 61(4), pages 864-884, April.
    5. Shinjini Pandey & Goutam Dutta & Harit Joshi, 2017. "Survey on Revenue Management in Media and Broadcasting," Interfaces, INFORMS, vol. 47(3), pages 195-213, June.
    6. Arifoglu, Kenan & Özekici, Süleyman, 2011. "Inventory management with random supply and imperfect information: A hidden Markov model," International Journal of Production Economics, Elsevier, vol. 134(1), pages 123-137, November.
    7. Radha Mookerjee & Subodha Kumar & Vijay S. Mookerjee, 2017. "Optimizing Performance-Based Internet Advertisement Campaigns," Operations Research, INFORMS, vol. 65(1), pages 38-54, February.
    8. Arifoglu, Kenan & Özekici, Süleyman, 2010. "Optimal policies for inventory systems with finite capacity and partially observed Markov-modulated demand and supply processes," European Journal of Operational Research, Elsevier, vol. 204(3), pages 421-438, August.
    9. Radha Mookerjee & Subodha Kumar & Vijay S. Mookerjee, 2017. "Optimizing Performance-Based Internet Advertisement Campaigns," Operations Research, INFORMS, vol. 65(1), pages 38-54, February.
    10. Erdem, Asli Sencer & Ozekici, Suleyman, 2002. "Inventory models with random yield in a random environment," International Journal of Production Economics, Elsevier, vol. 78(3), pages 239-253, August.
    11. Argon, Nilay Tanik & Gullu, Refik & Erkip, Nesim, 2001. "Analysis of an inventory system under backorder correlated deterministic demand and geometric supply process," International Journal of Production Economics, Elsevier, vol. 71(1-3), pages 247-254, May.
    12. He, Yuanjie & Zhang, Jiang, 2010. "Random yield supply chain with a yield dependent secondary market," European Journal of Operational Research, Elsevier, vol. 206(1), pages 221-230, October.
    13. Song, Yuyue & Wang, Yunzeng, 2017. "Periodic review inventory systems with fixed order cost and uniform random yield," European Journal of Operational Research, Elsevier, vol. 257(1), pages 106-117.
    14. Yiwei Chen & Nikolaos Trichakis, 2021. "Technical Note—On Revenue Management with Strategic Customers Choosing When and What to Buy," Operations Research, INFORMS, vol. 69(1), pages 175-187, January.
    15. Sami Najafi-Asadolahi & Kristin Fridgeirsdottir, 2014. "Cost-per-Click Pricing for Display Advertising," Manufacturing & Service Operations Management, INFORMS, vol. 16(4), pages 482-497, October.
    16. Mahsa Derakhshan & Negin Golrezaei & Renato Paes Leme, 2022. "Linear Program-Based Approximation for Personalized Reserve Prices," Management Science, INFORMS, vol. 68(3), pages 1849-1864, March.
    17. Visentin, Andrea & Prestwich, Steven & Rossi, Roberto & Tarim, S. Armagan, 2021. "Computing optimal (R,s,S) policy parameters by a hybrid of branch-and-bound and stochastic dynamic programming," European Journal of Operational Research, Elsevier, vol. 294(1), pages 91-99.
    18. Gullu, Refik, 1998. "Base stock policies for production/inventory problems with uncertain capacity levels," European Journal of Operational Research, Elsevier, vol. 105(1), pages 43-51, February.
    19. Qi (George) Chen & Stefanus Jasin & Izak Duenyas, 2016. "Real-Time Dynamic Pricing with Minimal and Flexible Price Adjustment," Management Science, INFORMS, vol. 62(8), pages 2437-2455, August.
    20. Canyakmaz, Caner & Özekici, Süleyman & Karaesmen, Fikri, 2019. "An inventory model where customer demand is dependent on a stochastic price process," International Journal of Production Economics, Elsevier, vol. 212(C), pages 139-152.

    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:inm:ormnsc:v:64:y:2018:i:10:p:4590-4607. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.