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.

Tianyan Long

dblp:412/5912 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
0009-0005-0567-3938ORCID · reported

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

Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 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.

Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%
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
Algorithmic game theory and mechanism design › mechanism design
auction design
0.912025
Beyond Advertising: Mechanism Design for Platform-Wide Marketing Service "QuanZhanTui" · KDD (2) 2025
Algorithmic game theory and mechanism design › auction theory › bidding strategy
auto-bidding
0.912025
Beyond Advertising: Mechanism Design for Platform-Wide Marketing Service "QuanZhanTui" · KDD (2) 2025
Information retrieval
online advertising
0.312025
Beyond Advertising: Mechanism Design for Platform-Wide Marketing Service "QuanZhanTui" · KDD (2) 2025

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

multi-objective optimization · 1.7incentive compatibility · 1.7
YearPublicationVenuePosition
2025 Beyond Advertising: Mechanism Design for Platform-Wide Marketing Service "QuanZhanTui"
abstract
On e-commerce platforms, sellers typically bid for impressions from ad traffic to promote their products. However, for most sellers, the majority of their sales come from organic traffic. Consequently, the relationship between their ad spending and total sales remains uncertain, resulting in operational inefficiency. To address this issue, e-commerce platforms have recently introduced a novel platform-wide marketing service known as QuanZhanTui, which has reportedly enhanced marketing efficiency for sellers and driven substantial revenue growth for platforms. QuanZhanTui allows sellers to bid for impressions from the platform's entire traffic to boost their total sales without compromising the platform's user experience. In this paper, we investigate the mechanism design problem that arises from QuanZhanTui. The problem is formulated as a multi-objective optimization to balance sellers' welfare and platform's user experience. We first introduce the stock-constrained value maximizer model, which reflects sellers' dual requirements on marketing efficiency and platform-wide ROI. Then, we propose the Liquid Payment Auction (LPA), an auction designed to optimize the balanced objectives while accounting for sellers' requirements in the auto-bidding environment. It employs a simple payment rule based on sellers' liquid welfare, providing a clearer link between their investment and total sales. Under mild assumptions, we theoretically prove desirable properties of LPA, such as optimality and incentive compatibility. Extensive experiments demonstrate LPA's superior performance over conventional auctions in QuanZhanTui.
Ningyuan Li 0001, Zhilin Zhang 0003, Tianyan Long, Yuyao Liu, Rongquan Bai, Yurong Chen 0002, Xiaotie Deng, Pengjie Wang 0002, Chuan Yu 0002, Jian Xu 0015, Bo Zheng 0007
KDD (2)3