充分利用私人停车位:不失策略的双重拍卖交错共享计划

IF 5.8 1区 工程技术 Q1 ECONOMICS Transportation Research Part B-Methodological Pub Date : 2024-11-16 DOI:10.1016/j.trb.2024.103102
Hao Yu , Min Huang , Yang Song , Xingwei Wang , Xiaohang Yue
{"title":"充分利用私人停车位:不失策略的双重拍卖交错共享计划","authors":"Hao Yu ,&nbsp;Min Huang ,&nbsp;Yang Song ,&nbsp;Xingwei Wang ,&nbsp;Xiaohang Yue","doi":"10.1016/j.trb.2024.103102","DOIUrl":null,"url":null,"abstract":"<div><div>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.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"191 ","pages":"Article 103102"},"PeriodicalIF":5.8000,"publicationDate":"2024-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Making the most of your private parking slot: Strategy-proof double auctions-enabled staggered sharing schemes\",\"authors\":\"Hao Yu ,&nbsp;Min Huang ,&nbsp;Yang Song ,&nbsp;Xingwei Wang ,&nbsp;Xiaohang Yue\",\"doi\":\"10.1016/j.trb.2024.103102\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>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.</div></div>\",\"PeriodicalId\":54418,\"journal\":{\"name\":\"Transportation Research Part B-Methodological\",\"volume\":\"191 \",\"pages\":\"Article 103102\"},\"PeriodicalIF\":5.8000,\"publicationDate\":\"2024-11-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Transportation Research Part B-Methodological\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0191261524002261\",\"RegionNum\":1,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ECONOMICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transportation Research Part B-Methodological","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0191261524002261","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ECONOMICS","Score":null,"Total":0}
引用次数: 0

摘要

以平台为中介的私人停车位共享(PPSS)被广泛认为是缓解大都市停车问题的可行途径。尽管私人停车位共享的未来令人向往,它将像今天的公共停车场一样方便,但在实践中,如何有效地匹配和定价信息不完整的自利供应商和需求者的矛盾日益加剧。为了调和这一矛盾,本文深入探讨了 PPSS 运营的细微差别,并提出了基于双重拍卖的解决方案,该方案嵌入了交错共享功能,以整合碎片化的非通勤驱动需求。面对交错共享给拍卖机制设计带来的时间异构和不兼容需求的交织难题,我们首先提出了一种基于需求分类的贸易削减(DCTR)拍卖机制,通过 "分而治之 "的思想将混杂的需求分开。我们从理论上证明了 DCTR 拍卖机制在一般情况下满足策略证明(SP)、预算平衡(BB)和个体理性(IR),并在需求类别有限时满足渐进效率(AsE)。为了减少当需求多样化时,DCTR 拍卖机制中的分布式贸易削减所造成的福利损失,我们提出了一系列基于团购的贸易削减(GBTR)拍卖机制,通过事先的分组过程统一需求,并只进行一次统一的贸易削减。为了适应不同的市场条件,我们制定了不同的分组出价确定和交易缩减规则。为了加强隐私保护并减轻认知能力有限的竞标者的策略识别负担,我们进一步设计了 GBTR 拍卖机制的双锁实现(DC-GBTR),它还满足无条件赢家隐私(UWP)和明显策略证明(OSP)。我们还进一步设计了一种混合机制,以便能够整合可能导致预算赤字的机制,并通过根据市场条件自动选择适当的拍卖来协调不同的拍卖,同时确保预期中的 BB。广泛的实验结果凸显了将交错共享纳入拍卖设计的优点,阐明了如何在备选拍卖中进行选择以满足不同的市场条件,展示了混合机制的优越性和潜力,并从不同利益相关者的角度推导出管理见解,以促进 PPSS 市场的导航。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Making the most of your private parking slot: Strategy-proof double auctions-enabled staggered sharing schemes
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Transportation Research Part B-Methodological
Transportation Research Part B-Methodological 工程技术-工程:土木
CiteScore
12.40
自引率
8.80%
发文量
143
审稿时长
14.1 weeks
期刊介绍: Transportation Research: Part B publishes papers on all methodological aspects of the subject, particularly those that require mathematical analysis. The general theme of the journal is the development and solution of problems that are adequately motivated to deal with important aspects of the design and/or analysis of transportation systems. Areas covered include: traffic flow; design and analysis of transportation networks; control and scheduling; optimization; queuing theory; logistics; supply chains; development and application of statistical, econometric and mathematical models to address transportation problems; cost models; pricing and/or investment; traveler or shipper behavior; cost-benefit methodologies.
期刊最新文献
Modelling the impacts of en-route ride-pooling service in a mixed pooling and non-pooling market Amachine learning technique embedded reference-dependent choice model for explanatory power improvement: Shifting of reference point as a key factor in vehicle purchase decision-making Making the most of your private parking slot: Strategy-proof double auctions-enabled staggered sharing schemes Editorial Board Safety, liability, and insurance markets in the age of automated driving
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1