Xiang T. R. Kong

dblp:162/7182 · also Xiangtianrui Kong 0001 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
4since 2021 · last 2025
—ORCID · conflict

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

Databases, data management, data science and information retrieval · 4 · 4 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author
YearPublicationVenuePosition
2025 Disentangling the impact of bidding price on advertising performance in E-commerce search advertising: The moderating role of product competitiveness
Ping Qiu, Zhao Cai, Xiang T. R. Kong, Hing Kai Chan
Inf. Manag.3
2024 Two-stage approximation allocation approach for real-time parking reservations considering stochastic requests and reusable resources
Mingyan Bai, Pengyu Yan, Xiaoqiang Cai, Xiang T. R. Kong
Adv. Eng. Informatics5
2023 Omni-fulfillment network design for supply chain service platform considering cost, service and resilience tradeoffs
Jiehui Jiang, Xiang T. R. Kong, Hing Kai Chan
Adv. Eng. Informatics2
2022 Just Trolley: Implementation of industrial IoT and digital twin-enabled spatial-temporal traceability and visibility for finished goods logistics
Wei Wu 0041, Zhiheng Zhao, Leidi Shen, Xiang T. R. Kong, Daqiang Guo, Ray Y. Zhong, George Q. Huang
Adv. Eng. Informatics4
2018 IoT-Enabled Parking Space Sharing and Allocation Mechanisms
abstract
This paper is among the first proposing an integrated auction and market design method for the parking space sharing and allocation problem. Drivers (agents) who fail to exchange their own parking spaces can then rent them to the platform. The platform receives private parking spaces from agents and manages some public parking spaces. We first develop the urban parking management cloud platform through Internet of Things. Based on this systemic framework, parking spaces are shared among agents via a price-compatible top trading cycles and chains (PC-TTCCs) mechanism and the platform's parking spaces are reassigned via a one-sided Vickrey-Clarke-Groves (O-VCG) auction. Both the PC-TTCC mechanism with rule e (PC-TTCC [e]) and O-VCG auction are effective in terms of strategy-proofness and (allocative or Pareto) efficiency. In the PC-TTCC [e] mechanism, the platform's payment rule used in private parking space sharing is determined based on historical O-VCG auction prices. Our experimental results further show that the proposed mechanism results in system profitability of 20%-30% and ex post budget balance for the platform.
Xiang T. R. Kong, Meng Cheng 0002, George Q. Huang
IEEE Trans Autom. Sci. Eng.1