Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Weitong Ou

dblp:353/7766 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
3since 2021 · last 2024
0000-0001-9088-621XORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 3 · 3 first-author · 3 since 2021Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval › online advertising
bid landscape forecasting
0.712023
Deep Landscape Forecasting in Multi-Slot Real-Time Bidding · KDD 2023
Information retrieval
online advertising
0.712023
Deep Landscape Forecasting in Multi-Slot Real-Time Bidding · KDD 2023
Information retrieval › online advertising
real-time bidding
0.712023
Deep Landscape Forecasting in Multi-Slot Real-Time Bidding · KDD 2023

Methods — techniques the papers use, named apart from their topics

deep learning · 0.7
YearPublicationVenuePosition
2024 A Survey on Bid Optimization in Real-Time Bidding Display Advertising
abstract
Real-Time Bidding (RTB) is one of the most important forms of online advertising, where an auction is hosted in real time to sell the individual ad impression. How to design an automated bidding strategy in response to the dynamic auction environment is crucial for improving user experience, protecting the interests of advertisers, and promoting the long-term development of the advertising platform. As an exciting topic in the real-world industry, it has attracted great research interest from several disciplines, most notably data science. There have been abundant studies on bidding strategy design which are based on the large volume of historical ad requests. Despite its popularity and significance, few works provide a summary for bid optimization. In this survey, we present the latest overview of the recent works to shed light on the optimization techniques where most of them are validated in practice. We first explore the optimization problem in different works, explaining how these different settings affect the bidding strategy designs. Then, some forms of bidding functions and specific optimization techniques are illustrated. Further, we specifically discuss a new trend about bidding in first-price auctions, which have gradually become popular in recent years. From this survey, both practitioners and researchers can gain insights of the challenges and future prospects of bid optimization in RTB.
Weitong Ou, Bo Chen 0023, Xinyi Dai, Weinan Zhang 0001, Weiwen Liu, Ruiming Tang, Yong Yu 0001
ACM Trans. Knowl. Discov. Data1
2023 Optimal Real-Time Bidding Strategy for Position Auctions in Online Advertising
abstract
Position auctions are widely studied in the context of sponsored search advertising, where multiple ad slots are sold in a single auction. In traditional sponsored search, bids are submitted at the keyword level, while recent works have explored transitioning to impression-level bidding using Real-Time Bidding (RTB) techniques to achieve finer bidding. However, position auctions introduce varying user appeal across different positions and more dynamic auction landscape, which RTB, originally devised for single-slot display advertising, fails to address adequately.
Weitong Ou, Bo Chen 0023, Weiwen Liu, Xinyi Dai, Weinan Zhang 0001, Wei Xia 0001, Ruiming Tang, Yong Yu 0001
CIKM1
2023 Deep Landscape Forecasting in Multi-Slot Real-Time Bidding
abstract
Real-Time Bidding (RTB) has shown remarkable success in display advertising and has been employed in other advertising scenarios, e.g., sponsored search advertising with multiple ad slots. Many current RTB techniques built for single-slot display advertising are thus no longer applicable, especially in the bid landscape forecasting. Landscape forecasting predicts market competition, including the highest bid price and winning probability, which is preliminary and crucial for the subsequent bidding strategy design. In the multi-slot advertising, predicting the winning prices for each position requires a more precise differentiation of bids among top advertisers. Furthermore, defining the winning probability and addressing censorship issues are not as straightforward as in the case of a single slot. In view of these challenges, how to forecast the bidding landscape in the multi-slot environment remains open.
Weitong Ou, Bo Chen 0023, Yingxuan Yang, Xinyi Dai, Weiwen Liu, Weinan Zhang 0001, Ruiming Tang, Yong Yu 0001
KDD1