IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2512.15717.html

Strategic Bid Shading in Real-Time Bidding Auctions in Ad Exchange Using Minority Game Theory

Author

Listed:
  • Dipankar Das

Abstract

Traditional auction theory posits that bid value exhibits a positive correlation with the probability of securing the auctioned object in ascending auctions. However, under uncertainty and incomplete information, as is characteristic in real-time advertising markets, truthful bidding may not always represent a dominant strategy or yield a Pure Strategy Nash Equilibrium. Real-Time Bidding (RTB) platforms operationalize impression-level auctions via programmatic interfaces, where advertisers compete in first-price auction settings and often resort to bid shading, i.e., strategically submitting bids below their private valuations to optimize payoff. This paper empirically investigates bid shading behaviors and strategic adaptation using large-scale RTB auction data from the Yahoo Webscope dataset. Integrating Minority Game Theory with clustering algorithms and variance-scaling diagnostics, we analyze equilibrium bidding behavior across temporally segmented impression markets. Our results reveal the emergence of minority-based bidding strategies, wherein agents partition hourly ad slots into submarkets and place bids strategically where they anticipate being in the numerical minority. This strategic heterogeneity facilitates reduced expenditure while enhancing win probability, functioning as an endogenous bid shading mechanism. The analysis highlights the computational and economic implications of minority strategies in shaping bidder dynamics and pricing outcomes in decentralized, high-frequency auction environments.

Suggested Citation

  • Dipankar Das, 2025. "Strategic Bid Shading in Real-Time Bidding Auctions in Ad Exchange Using Minority Game Theory," Papers 2512.15717, arXiv.org.
  • Handle: RePEc:arx:papers:2512.15717
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2512.15717
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Kimia Keshanian & Narayan Ramasubbu & Kaushik Dutta, 2023. "Mobile advertisement campaigns for boosting in‐store visits: A design framework and case study," Production and Operations Management, Production and Operations Management Society, vol. 32(8), pages 2438-2454, August.
    2. 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.
    3. Amin Sayedi, 2018. "Real-Time Bidding in Online Display Advertising," Marketing Science, INFORMS, vol. 37(4), pages 553-568, August.
    4. W. Jason Choi & Amin Sayedi, 2019. "Learning in Online Advertising," Marketing Science, INFORMS, vol. 38(4), pages 584-608, July.
    5. Shalinda Adikari & Kaushik Dutta, 2019. "A New Approach to Real-Time Bidding in Online Advertisements: Auto Pricing Strategy," INFORMS Journal on Computing, INFORMS, vol. 31(1), pages 66-82, February.
    6. Michael Ostrovsky & Michael Schwarz, 2023. "Reserve Prices in Internet Advertising Auctions: A Field Experiment," Journal of Political Economy, University of Chicago Press, vol. 131(12), pages 3352-3376.
    Full references (including those not matched with items on IDEAS)

    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. Duan, Yongrui & Liu, Peng & Feng, Yixuan, 2022. "Pricing strategies of two-sided platforms considering privacy concerns," Journal of Retailing and Consumer Services, Elsevier, vol. 64(C).
    2. W. Jason Choi & Amin Sayedi, 2023. "Open and Private Exchanges in Display Advertising," Marketing Science, INFORMS, vol. 42(3), pages 451-475, May.
    3. Ming Chen & Sareh Nabi & Marciano Siniscalchi, 2023. "Advancing Ad Auction Realism: Practical Insights & Modeling Implications," Papers 2307.11732, arXiv.org, revised Apr 2024.
    4. Omid Rafieian & Hema Yoganarasimhan, 2021. "Targeting and Privacy in Mobile Advertising," Marketing Science, INFORMS, vol. 40(2), pages 193-218, March.
    5. Jason Rhuggenaath & Alp Akcay & Yingqian Zhang & Uzay Kaymak, 2022. "Setting Reserve Prices in Second-Price Auctions with Unobserved Bids," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 2950-2967, November.
    6. Syngjoo Choi & Lars Nesheim & Imran Rasul, 2016. "Reserve Price Effects In Auctions: Estimates From Multiple Regression-Discontinuity Designs," Economic Inquiry, Western Economic Association International, vol. 54(1), pages 294-314, January.
    7. Jonathan Levin, 2011. "The Economics of Internet Markets," Discussion Papers 10-018, Stanford Institute for Economic Policy Research.
    8. Zhao, Yuxuan & Li, Xiangyong & Luo, Lan, 2025. "Dynamic allocation of display advertising impressions in dual sales channels," Omega, Elsevier, vol. 131(C).
    9. Tonghui Qi, 2025. "Identification in Auctions with Truncated Transaction Prices," Papers 2510.04464, arXiv.org, revised Oct 2025.
    10. Rutz, Oliver & Aravindakshan, Ashwin & Rubel, Olivier, 2019. "Measuring and forecasting mobile game app engagement," International Journal of Research in Marketing, Elsevier, vol. 36(2), pages 185-199.
    11. Inyoung Chae & Jihyeon Ha & David A. Schweidel, 2023. "Paywall Suspensions and Digital News Subscriptions," Marketing Science, INFORMS, vol. 42(4), pages 729-745, July.
    12. W. Jason Choi & Amin Sayedi, 2019. "Learning in Online Advertising," Marketing Science, INFORMS, vol. 38(4), pages 584-608, July.
    13. Yash Kanoria & Hamid Nazerzadeh, 2020. "Dynamic Reserve Prices for Repeated Auctions: Learning from Bids," Papers 2002.07331, arXiv.org.
    14. Eric Bax, 2020. "Heavy Tails Make Happy Buyers," Papers 2002.09014, arXiv.org.
    15. Yanqing Xia & Zijian Liu & Siqin Wang & Chenxi Huang & Wenqiang Zhao, 2025. "RETRACTED ARTICLE: Unlocking the Impact of User Experience on AI-Powered Mobile Advertising Engagement," Journal of the Knowledge Economy, Springer;Portland International Center for Management of Engineering and Technology (PICMET), vol. 16(1), pages 4818-4854, March.
    16. Xiang He & Li Li & Di Wang & Zonghuo Li, 2025. "Advertising bidding involving consumer information sharing," Electronic Commerce Research, Springer, vol. 25(2), pages 1033-1066, April.
    17. L. Elisa Celis & Gregory Lewis & Markus Mobius & Hamid Nazerzadeh, 2011. "Buy-it-now or Take-a-chance: A New Pricing Mechanism for Online Advertising," Working Papers 11-21, NET Institute, revised Nov 2011.
    18. Jingzhe Gao & Haixiao Wei, 2025. "The battle between channel distribution and traffic purchases: a perspective of the mobile application market," Operational Research, Springer, vol. 25(2), pages 1-25, June.
    19. Joo, Mingyu & Kim, Seung Hyun & Ghose, Anindya & Wilbur, Kenneth C., 2023. "Designing Distributed Ledger technologies, like Blockchain, for advertising markets," International Journal of Research in Marketing, Elsevier, vol. 40(1), pages 12-21.
    20. 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.

    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:arx:papers:2512.15717. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.