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

Shaojie Ding

dblp:163/0604 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2026
—ORCID · none

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

Artificial intelligence and machine learning · 1Computer networks · 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 · 67% Approximation and online algorithms · 33%
Artificial intelligence
1 paper
Reinforcement learning · 100%

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

TopicWeightPapersLastEvidence papers
Algorithmic game theory and mechanism design
auction theory
1.012026
Aggregative Online Task Assignment in Spatial Crowdsourcing: An Auction-Aware Approach · IEEE Trans. Mob. Comput. 2026
Approximation and online algorithms › online allocation
online task assignment
1.012026
Aggregative Online Task Assignment in Spatial Crowdsourcing: An Auction-Aware Approach · IEEE Trans. Mob. Comput. 2026
Algorithmic game theory and mechanism design › auction theory › sealed-bid auction
vickrey auction
1.012026
Aggregative Online Task Assignment in Spatial Crowdsourcing: An Auction-Aware Approach · IEEE Trans. Mob. Comput. 2026
Machine learning › Reinforcement learning
multi-agent reinforcement learning
0.312026
Aggregative Online Task Assignment in Spatial Crowdsourcing: An Auction-Aware Approach · IEEE Trans. Mob. Comput. 2026

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

reverse sealed vickrey auction · 2.0multi-agent reinforcement learning · 2.0exploration-exploitation · 2.0
YearPublicationVenuePosition
2026 Aggregative Online Task Assignment in Spatial Crowdsourcing: An Auction-Aware Approach
abstract
Spatial crowdsourcing (SC) services, such as ridesharing and food delivery, are increasingly shaping people's daily lives. A key issue in SC is online task assignment, which involves assigning tasks to appropriate workers in real time. Most existing studies focus on task assignment within independent platforms but still face the limitation of spatial-temporal imbalance between tasks and workers. Recently, aggregation platforms (e.g., AMap's ride-hailing) have emerged, enabling tasks to be completed by workers from multiple cooperating platforms. However, effectively incentivizing these cooperating platforms to deliver high-quality services remains an open challenge. In this paper, we study a novel Aggregative Online Task Assignment (AOTA) problem, where the aggregation platform assigns tasks to suitable cooperating providers with the goal of maximizing overall quality-aware social welfare. To address the AOTA problem, we design an efficient Context-aware Online Bidding Task Assignment (COBTA) framework, which integrates a reverse sealed Vickrey auction to promote truthful bidding for public tasks among platforms. COBTA employs an exploration-exploitation strategy for efficient and effective public task assignment and leverages a multi-agent reinforcement learning method to enable cooperating platforms to make adaptive bid-or-not decisions based on their internal status. Extensive experiments on three real-world datasets validate the effectiveness and efficiency of our proposed solution.
Guanglei Zhu, Shuaiqi Du, Jianliang Xu, Shaojie Ding, Mingliang Xu 0001
IEEE Trans. Mob. Comput.5
2015 The impact of channel and external synaptic noises on spatial and temporal coherence in neuronal networks
Xuejuan Zhang, Jianchun Chen, Shaojie Ding, Guolong He
Neurocomputing4