Demo Data from EDBT 2026 / reviewers in the wild / expert
Aapeli Vuorinen
dblp:238/8083
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2025
0000-0002-0173-3017ORCID · reported
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 · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Algorithmic game theory and mechanism design › market design
matching markets |
0.9 | 1 | 2025 | Longer Lists Yield Better Matchings · EC 2025 |
Algorithmic game theory and mechanism design › market design › matching markets
two-sided matching |
0.9 | 1 | 2025 | Longer Lists Yield Better Matchings · EC 2025 |
Methods — techniques the papers use, named apart from their topics
theoretical analysis · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Longer Lists Yield Better MatchingsabstractMany centralized mechanisms for two-sided matching markets that enjoy strong theoretical properties assume that the planner solicits full information on the preferences of each participating agent. In particular, they expect that participants compile and communicate their complete preference lists over agents from the other side of the market. However, real-world markets are often very large and agents cannot always be expected to even produce a ranking of all options on the other side. It is therefore important to understand the impact of incomplete or truncated lists on the quality of the resultant matching. Yuri Faenza, Aapeli Vuorinen |
EC | 2 |