Wuyang Mao

Wuyang Mao

Auto-generated profile, based on publicly available information

Wuyang Mao

Alibaba Group, Beijing, China

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 August 2023
Verified
Conference Paper
Open access
WMWuyang Mao
Wuyang Mao
CLChuanren Liu
Chuanren Liu
YHYundu Huang
Yundu Huang
ZZZhonglin Zu
Zhonglin Zu
MHM. Harshvardhan
M. Harshvardhan
BZBo Zheng
Bo Zheng

24 August 2024
Verified
Conference Paper
Open access
YLYan Li
Yan Li
YHYundu Huang
Yundu Huang
WMWuyang Mao
Wuyang Mao
FYFurong Ye
Furong Ye
XHXiang He
Xiang He
SCShaowei Cai
Shaowei Cai
Contemporary systems of Guaranteed Delivery (GD) advertising work with two different stages, namely, the offline selling stage and the online serving stage. The former deals with contract allocation, and the latter fulfills the impression allocation of signed contracts. Existing work usually handles these two stages separately. For example, contracts are formulated offline without concerning practical situations in the online serving stage. Therefore, we address in this paper a bi-objective contract allocation for GD advertising, which maximizes the impressions, i.e., Ad resource assignments, allocated for the new incoming advertising orders, and at the same time, controls the balance in the inventories. Since the proposed problem is high dimensional and heavily constrained, we design an efficient local search that focuses on the two objectives alternatively. The experimental results indicate that our algorithm outperforms multi-objective evolutionary algorithms and Gurobi, the former of which is commonly applied for multi-objective optimization and the latter of which is a well-known competitive commercial tool.

24 August 2024
Verified
Conference Paper
Open access
XHXiang He
Xiang He
WMWuyang Mao
Wuyang Mao
ZXZhenghang Xu
Zhenghang Xu
YGYuanzhe Gu
Yuanzhe Gu
YHYundu Huang
Yundu Huang
MZMengchuan Zou
Mengchuan Zou
The Guaranteed Delivery (GD) advertising is a crucial component of the online advertising industry, and the allocation of inventory in GD advertising is an important procedure that influences directly the ability of the publisher to fulfill the requirements and increase its revenues. Nowadays, as the requirements of advertisers become more and more diverse and fine-grained, the focus ratio requirement, which states that the portion of allocated impressions of a designated contract on focus media among all possible media should be greater than another contract, often appears in business scenarios. However, taking these requirements into account brings hardness for the GD advertising inventory allocation as the focus ratio requirements involve non-convex multilinear constraints. Existing methods which rely on the convex properties are not suitable for processing this problem, while mathematical programming or constraint-based heuristic solvers are unable to produce high-quality solutions within the time limit. Therefore, we propose a local search framework to address this challenge. It incorporates four new operators designed for handling multilinear constraints and a two-mode algorithmic architecture. Experimental results demonstrate that our algorithm is able to compute high-quality allocations with better business metrics compared to the state-of-the-art mathematical programming or constraint based heuristic solvers. Moreover, our algorithm is able to handle the general multilinear constraints and we hope it could be used to solve other problems in GD advertising with similar requirements.