HMAF: A Hierarchical Multi-Slot GD-RTB Allocation Framework

• URL: http://arxiv.org/abs/2606.09896v1
• Date: Thu, 04 Jun 2026 22:50:38 GMT
• Title: HMAF: A Hierarchical Multi-Slot GD-RTB Allocation Framework
• Abstract summary: We propose a unified framework designed to optimize impression allocation in GD-RTB advertising platforms.<n>HMAF has been implemented in multiple marketing scenarios at Meituan, one of the world's largest online food delivery platforms.
• Score: 18.803846150996197
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In modern online advertising platforms, Guaranteed Delivery (GD) contracts coexist and bid with Real-Time Bidding (RTB) auctions. Recent approaches either decouple GD and RTB optimization or rely on heuristic priority rules, and thus fail to effectively balance short-term revenue maximization with long-term contract delivery under complex multi-slot delivery and impression constraints. To address these challenges, we propose HMAF (Hierarchical Multi-Slot Allocation Framework), a unified framework designed to optimize impression allocation in GD--RTB advertising platforms. HMAF employs the Plan--Calibrate--Execute paradigm as its core structure, and integrates offline constraint optimization with online decision-making, balancing offline GD resource planning, dynamically calibrating GD--RTB competitiveness, and making real-time listwise rank decisions across multi-slot environments. HMAF has been implemented in multiple marketing scenarios at Meituan, one of the world's largest online food delivery platforms, leading to a 3.72% increase in GD delivery rate and a 1.59% increase in total advertisement revenue.

Related papers

• HOBA: Hierarchical On-Policy Bidding Agents for Adaptive Online Advertising [4.325040293861279]
  HOBA is a hierarchical reinforcement learning framework that decouples strategic reasoning, model selection, and bid execution across three time scales.<n> Experiments on the AuctionNet benchmark and a large-scale A/B test demonstrate consistent improvements over state-of-the-art baselines.
  arXiv  Detail & Related papers  (2026-06-17T15:00:34Z)
• Beyond Single Slot: Joint Optimization for Multi-Slot Guaranteed Display Advertising [19.913909474194934]
  We propose a novel joint optimization framework for multi-slot GD allocation, addressing key challenges such as slot-level redundancy, contract imbalance, and exposure concentration.<n>Our approach formulates the allocation as an offline bipartite matching problem with a contract roulette mechanism for slot exclusivity and Page View constraints.
  arXiv  Detail & Related papers  (2026-05-20T13:32:47Z)
• HAD: Combining Hierarchical Diffusion with Metric-Decoupled RL for End-to-End Driving [51.268878540511054]
  We propose HAD, an end-to-end planning framework with a Hierarchical Diffusion Policy.<n>We show that HAD achieves new state-of-the-art performance on both NAVSIM and HUGSIM.
  arXiv  Detail & Related papers  (2026-04-04T04:12:47Z)
• Diffusing to Coordinate: Efficient Online Multi-Agent Diffusion Policies [51.24079409973799]
  Diffusion-based generative models are well-positioned to meet the needs of online Multi-Agent Reinforcement Learning (MARL)<n>We propose among the first underlineOnline off-policy underlineMARL framework using underlineDiffusion policies to orchestrate coordination.<n>Our key innovation is a relaxed policy objective that maximizes scaled joint entropy, facilitating effective exploration without relying on tractable likelihood.
  arXiv  Detail & Related papers  (2026-02-20T15:38:02Z)
• HOB: A Holistically Optimized Bidding Strategy under Heterogeneous Auction Mechanisms with Organic Traffic [23.230940625345372]
  E-commerce advertising platforms typically sell commercial traffic through either second-price auction (SPA) or first-price auction (FPA)<n>For automated bidding systems, such a trend poses a critical challenge: determining optimal strategies across heterogeneous auction channels to fulfill diverse advertiser objectives.<n>We derive an efficient solution for optimal bidding under FPA channels, which takes into account the presence of organic traffic - traffic can be won for free.
  arXiv  Detail & Related papers  (2025-10-17T02:00:09Z)
• A Unified Multi-Task Learning Framework for Generative Auto-Bidding with Validation-Aligned Optimization [51.27959658504722]
  Multi-task learning offers a principled framework to train these tasks jointly through shared representations.<n>Existing multi-task optimization strategies are primarily guided by training dynamics and often generalize poorly in volatile bidding environments.<n>We present Validation-Aligned Multi-task Optimization (VAMO), which adaptively assigns task weights based on the alignment between per-task training gradients and a held-out validation gradient.
  arXiv  Detail & Related papers  (2025-10-09T03:59:51Z)
• Multi-task Offline Reinforcement Learning for Online Advertising in Recommender Systems [54.709976343045824]
  Current offline reinforcement learning (RL) methods face substantial challenges when applied to sparse advertising scenarios.<n>We propose MTORL, a novel multi-task offline RL model that targets two key objectives.<n>We employ multi-task learning to decode actions and rewards, simultaneously addressing channel recommendation and budget allocation.
  arXiv  Detail & Related papers  (2025-06-29T05:05:13Z)
• Session-Level Dynamic Ad Load Optimization using Offline Robust Reinforcement Learning [14.410333601657172]
  Session-level dynamic ad load optimization aims to personalize the density and types of delivered advertisements in real time during a user's online session.<n>Traditional causal learning-based approaches struggle with key technical challenges.<n>We develop an offline deep Q-network (DQN)-based framework that effectively mitigates confounding bias in dynamic systems.
  arXiv  Detail & Related papers  (2025-01-09T21:53:03Z)
• HiBid: A Cross-Channel Constrained Bidding System with Budget Allocation by Hierarchical Offline Deep Reinforcement Learning [31.88174870851001]
  We propose a hierarchical offline deep reinforcement learning (DRL) framework called HiBid'' HiBid consists of a high-level planner equipped with auxiliary loss for non-competitive budget allocation. A CPC-guided action selection mechanism is introduced to satisfy the cross-channel CPC constraint.
  arXiv  Detail & Related papers  (2023-12-29T07:52:46Z)
• VFed-SSD: Towards Practical Vertical Federated Advertising [53.08038962443853]
  We propose a semi-supervised split distillation framework VFed-SSD to alleviate the two limitations. Specifically, we develop a self-supervised task MatchedPair Detection (MPD) to exploit the vertically partitioned unlabeled data. Our framework provides an efficient federation-enhanced solution for real-time display advertising with minimal deploying cost and significant performance lift.
  arXiv  Detail & Related papers  (2022-05-31T17:45:30Z)
• Dynamic Knapsack Optimization Towards Efficient Multi-Channel Sequential Advertising [52.3825928886714]
  We formulate the sequential advertising strategy optimization as a dynamic knapsack problem. We propose a theoretically guaranteed bilevel optimization framework, which significantly reduces the solution space of the original optimization space. To improve the exploration efficiency of reinforcement learning, we also devise an effective action space reduction approach.
  arXiv  Detail & Related papers  (2020-06-29T18:50:35Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.