Sequential Bidding for Merging in Algorithmic Traffic

Mihalis G. Markakis, K. Talluri, D. Tikhonenko
{"title":"Sequential Bidding for Merging in Algorithmic Traffic","authors":"Mihalis G. Markakis, K. Talluri, D. Tikhonenko","doi":"10.1287/msom.2022.1144","DOIUrl":null,"url":null,"abstract":"Problem definition: We consider the problem of resolving ad hoc unpredictable congestion in environments where customers have private time valuations. We investigate the design of fair, efficient, budget-balanced, and implementable bidding mechanisms for observable queues. Academic/practical relevance: Our primary motivation comes from merging in algorithmic traffic, i.e., a driver wishing to merge in a relatively dense platoon of vehicles in a coordinated and efficient way, using intervehicle communication and micropayments, akin to an arriving customer trading for position in a single-server observable queue. Methodology: We analyze the performance of a mechanism where the queue joiner makes sequential take-it-or-leave-it bids from tail to head (T2H) of a platoon, with the condition that the vehicle can advance to the next position only if it wins the bid. This mechanism is designed so that it is implementable, balances the budget, and imposes no negative externalities. Results: We compared this mechanism with head to tail (H2T) bidding, which favors the merging driver but potentially causes uncompensated externalities. Assuming i.i.d. time valuations, we obtain the optimal bids, value functions, and expected social welfare in closed form in both mechanisms. Moreover, if the time valuation of the merging driver is not high, we show that the expected social welfare of T2H is close to a partial information social optimum and that the expected social welfare of H2T is lower than that of T2H as long as the platoon is not too short. Managerial implications: Our findings suggest that mechanisms based on sequential take-it-or-leave-it bids from T2H of an observable queue have good social welfare performance, even if the corresponding bids are not chosen optimally, as long as the time valuation of the arriving customer is not high. Nevertheless, the tension between individual incentives and social welfare seems hard to resolve, highlighting the role of platforms to enforce the cooperation of involved parties.","PeriodicalId":18108,"journal":{"name":"Manuf. Serv. Oper. Manag.","volume":"34 1","pages":"168-181"},"PeriodicalIF":0.0000,"publicationDate":"2022-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Manuf. Serv. Oper. Manag.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1287/msom.2022.1144","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Problem definition: We consider the problem of resolving ad hoc unpredictable congestion in environments where customers have private time valuations. We investigate the design of fair, efficient, budget-balanced, and implementable bidding mechanisms for observable queues. Academic/practical relevance: Our primary motivation comes from merging in algorithmic traffic, i.e., a driver wishing to merge in a relatively dense platoon of vehicles in a coordinated and efficient way, using intervehicle communication and micropayments, akin to an arriving customer trading for position in a single-server observable queue. Methodology: We analyze the performance of a mechanism where the queue joiner makes sequential take-it-or-leave-it bids from tail to head (T2H) of a platoon, with the condition that the vehicle can advance to the next position only if it wins the bid. This mechanism is designed so that it is implementable, balances the budget, and imposes no negative externalities. Results: We compared this mechanism with head to tail (H2T) bidding, which favors the merging driver but potentially causes uncompensated externalities. Assuming i.i.d. time valuations, we obtain the optimal bids, value functions, and expected social welfare in closed form in both mechanisms. Moreover, if the time valuation of the merging driver is not high, we show that the expected social welfare of T2H is close to a partial information social optimum and that the expected social welfare of H2T is lower than that of T2H as long as the platoon is not too short. Managerial implications: Our findings suggest that mechanisms based on sequential take-it-or-leave-it bids from T2H of an observable queue have good social welfare performance, even if the corresponding bids are not chosen optimally, as long as the time valuation of the arriving customer is not high. Nevertheless, the tension between individual incentives and social welfare seems hard to resolve, highlighting the role of platforms to enforce the cooperation of involved parties.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
顺序竞标合并算法流量
问题定义:我们考虑在客户有私人时间估值的环境中解决临时不可预测的拥塞问题。我们研究了公平、高效、预算平衡和可实施的可观察队列招标机制的设计。学术/实践相关性:我们的主要动机来自于算法交通中的合并,即,驾驶员希望以协调和有效的方式合并在相对密集的车辆排中,使用车辆间通信和小额支付,类似于到达的客户在单服务器可观察队列中交易位置。方法:我们分析了一种机制的性能,在这种机制中,队列加入者从队列尾部到队列头部(T2H)进行顺序的接受或放弃竞标,条件是车辆只有在赢得竞标后才能前进到下一个位置。这种机制的设计是为了使其可执行、平衡预算和不施加负面外部性。结果:我们将这种机制与头尾(H2T)竞标进行了比较,后者有利于合并驱动者,但可能导致未补偿的外部性。假设时间估值,我们得到了两种机制下的最优出价、价值函数和期望社会福利的封闭形式。此外,当合并司机的时间估值不高时,我们发现T2H的期望社会福利接近部分信息社会最优,并且只要排不太短,H2T的期望社会福利低于T2H的期望社会福利。管理启示:我们的研究结果表明,基于可观察队列中T2H的顺序接受或放弃出价的机制具有良好的社会福利绩效,即使相应的出价不是最优选择,只要到达的客户的时间估值不高。然而,个人激励与社会福利之间的紧张关系似乎难以解决,这凸显了平台在强制各方合作方面的作用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Introduction to Special Section on Data-Driven Research Challenge Food Donations, Retail Operations, and Retail Pricing The Design of Optimal Pay-as-Bid Procurement Mechanisms Asymmetric Information of Product Authenticity on C2C E-Commerce Platforms: How Can Inspection Services Help? Believing in Analytics: Managers' Adherence to Price Recommendations from a DSS
×
引用
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