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

Jianxing Lin

dblp:399/5270 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none

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

Databases, 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.

Databases, data mining, and information retrieval
1 paper
Spatial and temporal data management · 100%
Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%

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

TopicWeightPapersLastEvidence papers
Spatial and temporal data management
spatial crowdsourcing
0.912025
Optimizing Multi-Center Collaboration for Task Assignment in Spatial Crowdsourcing · ICDE 2025
Spatial and temporal data management › spatial crowdsourcing
task assignment
0.912025
Optimizing Multi-Center Collaboration for Task Assignment in Spatial Crowdsourcing · ICDE 2025

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

iterative optimization · 1.7game theory · 1.7
YearPublicationVenuePosition
2025 Optimizing Multi-Center Collaboration for Task Assignment in Spatial Crowdsourcing
abstract
The rapid development of smart devices has fostered the growth of Spatial Crowdsourcing (SC), where workers complete spatial tasks by traveling to specific locations. Task assignment is a key issue in SC due to the inherent complexity of matching workers with these spatial tasks efficiently. Previous studies on task assignment have primarily focused on optimizing worker-task matching within a single, centralized area, often ignoring scenarios that involve multiple independent service centers across an area. To address this gap, we introduce a collaborative multi-center task assignment problem, which focuses on scenarios where an SC platform manages multiple independent service centers within an area, shifting the focus from worker-level cooperation to exploring the solutions specific to multi-center coordination. We target the imbalances between available workers and unassigned tasks among different centers, aiming to maximize the total number of assigned tasks and minimize unfairness in inter-center collaboration. In particular, we propose an Iterative Multi-center Task Assignment and Optimization (IMTAO) framework. IMTAO operates in two phases: (1) center-independent task assignment based on an efficient sequential task assignment algorithm, and (2) inter-center workforce transfer based on a game-theoretic multi-center collaboration algorithm that ensures fair collaboration through bi-directional optimization. Extensive experiments demonstrate the efficiency and effectiveness of IMTAO in enhancing task assignment and improving collaboration fairness compared to baseline methods.
Ximu Zeng, Jianxing Lin, Liwei Deng 0001, Yuchen Fang 0001, Yan Zhao 0008, Kai Zheng 0001
ICDE2