EDBT 2026 Demo / reviewers in the wild / expert
Dejian Wang
dblp:19/10481
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2021
0000-0002-6724-1859ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 2 · 2 since 2021Artificial intelligence and machine learning · 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.
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Computational finance and economics · 50% Smart cities and intelligent transportation · 50% | |
| Theoretical computer science
1 paper |
Algorithmic game theory and mechanism design · 50% Mathematical optimization · 50% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Smart cities and intelligent transportation
mobility-on-demand |
0.5 | 1 | 2021 | Improving the Information Disclosure in Mobility-on-Demand Systems · KDD 2021 |
Computational finance and economics › platform economics
sharing economy |
0.5 | 1 | 2021 | Improving the Information Disclosure in Mobility-on-Demand Systems · KDD 2021 |
Mathematical optimization
combinatorial optimization |
0.5 | 1 | 2021 | Improving the Information Disclosure in Mobility-on-Demand Systems · KDD 2021 |
Algorithmic game theory and mechanism design › mechanism design › information design
information disclosure |
0.5 | 1 | 2021 | Improving the Information Disclosure in Mobility-on-Demand Systems · KDD 2021 |
Methods — techniques the papers use, named apart from their topics
minimal-loss edge cutting · 1.0choice modeling · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | Improving the Information Disclosure in Mobility-on-Demand SystemsabstractNowadays, the ubiquity of sharing economy and the booming of ride-sharing services prompt Mobility-on-Demand (MoD) platforms to explore and develop new business modes. Different from forcing full-time drivers to serve the dispatched orders, these modes usually aim to attract part-time drivers to share their vehicles and employ a 'driver-choose-order' pattern by displaying a sequence of orders to drivers as a candidate set. A key issue here is to determine which orders should be displayed to each driver. In this work, we propose a novel framework to tackle this issue, known as the Information Disclosure problem in MoD systems. The problem is solved in two steps combining estimation with optimization: 1) in the estimation step, we investigate the drivers' choice behavior and estimate the probability of choosing an order or ignoring the displayed candidate set. 2) in the optimization step, we transform the problem into determining the optimal edge configuration in a bipartite graph, then we develop a Minimal-Loss Edge Cutting (MLEC) algorithm to solve it. Through extensive experiments on both the simulation and the real-world data from Huolala business, the proposed method remarkably improves users experience and platform efficiency. Based on these promising results, the proposed framework has been successfully deployed in the real-world MoD system in Huolala. Yue Yang 0033, Dejian Wang, Qisheng Chen, Lei Xu 0052, Hanqian Li, Zhouyu Fu |
KDD | 3 |
| 2021 | Dual attention guided multi-scale CNN for fine-grained image classification
Xiaozhang Liu, Tao Li 0043, Dejian Wang |
Inf. Sci. | 4 |