Author
Listed:
- Pengyu Yan
(School of Management and Economics, University of Electronic Science and Technology of China, Chengdu, Sichuan 611731, People’s Republic of China)
- Xiaoqiang Cai
(Shenzhen Key Laboratory of IoT Intelligent Systems and Wireless Network Technology, The Chinese University of Hong Kong, Shenzhen, Guangdong 518172, People’s Republic of China; Shenzhen Research Institute of Big Data, Shenzhen, Guangdong 518172, People’s Republic of China)
- Feng Chu
(IBISC, Univ Évry, University of Paris-Saclay, 91025 Évry, France)
- Debing Ni
(School of Management and Economics, University of Electronic Science and Technology of China, Chengdu, Sichuan 611731, People’s Republic of China)
- Heng He
(School of Management and Economics, University of Electronic Science and Technology of China, Chengdu, Sichuan 611731, People’s Republic of China)
Abstract
This paper proposes a matching-and-pricing mechanism for a drivers’ demand-reporting problem in parking-sharing programs in which owners share their private parking slots with drivers. We generate a driver-slot matching solution by a centralized assignment procedure according to the demand and supply information reported by drivers and owners, respectively, and determine truth-telling pricing by the Vickrey-Clark-Grove mechanism. We show that under the assumption that drivers do not know with certainty whether other drivers will show up to compete for the parking slots, the mechanism proposed in this paper induces drivers to truthfully report their private information of the travel plans and guarantees three other desirable properties: participation of drivers and slot owners, optimal system efficiency, and balance of the system’s budget. We further extend these results to two dynamic situations. Finally, the results of the numerical experiments based on real-world data demonstrate the performance of the mechanism.
Suggested Citation
Pengyu Yan & Xiaoqiang Cai & Feng Chu & Debing Ni & Heng He, 2023.
"An Incentive Mechanism for Private Parking-Sharing Programs in an Imperfect Information Setting,"
Service Science, INFORMS, vol. 15(1), pages 3-21, March.
Handle:
RePEc:inm:orserv:v:15:y:2023:i:1:p:3-21
DOI: 10.1287/serv.2022.0303
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:orserv:v:15:y:2023:i:1:p:3-21. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.