Making the most of your private parking slot: Strategy-proof double auctions-enabled staggered sharing schemes

被引:0
|
作者
Yu, Hao [1 ]
Huang, Min [1 ,2 ]
Song, Yang [1 ]
Wang, Xingwei [3 ]
Yue, Xiaohang [4 ]
机构
[1] Northeastern Univ NEU, Coll Informat Sci & Engn, Shenyang 110819, Liaoning, Peoples R China
[2] Northeastern Univ, State Key Lab Synthet Automat Proc Ind, Shenyang 110819, Liaoning, Peoples R China
[3] Northeastern Univ, Coll Comp Sci, Shenyang 110819, Liaoning, Peoples R China
[4] Univ Wisconsin Milwaukee, Lubar Coll Business, Milwaukee, WI 53201 USA
关键词
Private parking slot sharing; Non-commute-driven demand; Staggered sharing; Double auction; (Obvious) strategy-proofness; TRUTHFUL; PROCUREMENT; MECHANISM; MARKET;
D O I
10.1016/j.trb.2024.103102
中图分类号
F [经济];
学科分类号
02 ;
摘要
Platform-intermediated Private Parking Slot Sharing (PPSS) is broadly deemed a viable avenue to alleviate parking problems in metropolises. Despite a captivating future where PPSS will be as convenient as public parking today, tension is mounting in practice concerning how to efficiently match and price self-interested suppliers and demanders with incomplete information. To reconcile this tension, this paper delves into the nuances of PPSS operations and proposes double auction-based solutions that embed staggered sharing to integrate fragmented non- commute-driven demand. Confronting the intertwined difficulties of temporally heterogeneous and incompatible demands imposed by staggered sharing on auction mechanism design, we first propose a Demand Classification-based Trade Reduction (DCTR) auction mechanism that teases apart the conflated demands through the idea of "divide and conquer". We prove theoretically that the DCTR auction mechanism satisfies Strategy-Proofness (SP), Budget Balance (BB), and Individual Rationality (IR) in general, and Asymptotic Efficiency (AsE) when demand categories are finite. To cut down the welfare loss due to distributed trade reduction in the DCTR auction mechanism when demands are diversified, we propose a family of Group Buying- based Trade Reduction (GBTR) auction mechanisms that unify demands through a preceding grouping process and conduct one unified trade reduction only. We contrive alternative group bid determination and trade reduction rules to accommodate distinct market conditions. To strengthen privacy preservation and relieve the strategy identification burden of cognitively limited bidders, we further design the Double-Clock implementations of the GBTR auction mechanisms (DC-GBTR) that additionally satisfy Unconditional Winner Privacy (UWP) and Obvious Strategy-Proofness (OSP). A hybrid mechanism is further designed to enable the integration of mechanisms that could induce budget deficits and orchestrate different auctions by automatically selecting the proper one depending on market conditions while ensuring BB in expectation. Extensive experimental results highlight the merits of incorporating staggered sharing in auction design, shed light on how to choose among alternative auctions to cater to distinct market conditions, showcase the superiority and potential of hybridization, and deduce managerial insights from the perspectives of different stakeholders to facilitate the navigation of PPSS marketplaces.
引用
收藏
页数:29
相关论文
共 1 条
  • [1] Sharing the Shared Rides: Multi-Party Carpooling Supported Strategy-Proof Double Auctions
    Yu, Hao
    Huang, Min
    Yue, Xiaohang
    PRODUCTION AND OPERATIONS MANAGEMENT, 2024, 33 (07) : 1569 - 1590