Demo Data from VLDB 2026 / reviewers in the wild / expert
Weijie Zhong
dblp:263/6758
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Theory of computation · 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 · 72% Information theory · 28% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information theory
moment constraints |
0.5 | 1 | 2021 | Robustly-Optimal Mechanism for Selling Multiple Goods · EC 2021 |
Algorithmic game theory and mechanism design › auction theory
multi-item auctions |
0.5 | 1 | 2021 | Robustly-Optimal Mechanism for Selling Multiple Goods · EC 2021 |
Algorithmic game theory and mechanism design › mechanism design
robust mechanism design |
0.5 | 1 | 2021 | Robustly-Optimal Mechanism for Selling Multiple Goods · EC 2021 |
Algorithmic game theory and mechanism design › mechanism design
auction design |
0.1 | 1 | 2021 | Robustly-Optimal Mechanism for Selling Multiple Goods · EC 2021 |
Algorithmic game theory and mechanism design › pricing
bundling |
0.1 | 1 | 2021 | Robustly-Optimal Mechanism for Selling Multiple Goods · EC 2021 |
Methods — techniques the papers use, named apart from their topics
robust optimization · 0.5mechanism design · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | Robustly-Optimal Mechanism for Selling Multiple GoodsabstractWe study robustly-optimal mechanisms for selling multiple items. The seller maximizes revenue against a worst-case distribution of a buyer's valuations within a set of distributions, called an "ambiguity" set. We identify the exact forms of robustly-optimal selling mechanisms and the worst-case distributions when the ambiguity set satisfies a variety of moment conditions on the values of subsets of goods. We also identify general properties of the ambiguity set that lead to the robust optimality of partial bundling which includes separate sales and pure bundling as special cases. Yeon-Koo Che, Weijie Zhong |
EC | 2 |