Matching Impatient and Heterogeneous Demand and Supply

IF 2.2 3区 管理学 Q3 MANAGEMENT
Angelos Aveklouris, Levi DeValve, Maximiliano Stock, Amy Ward
{"title":"Matching Impatient and Heterogeneous Demand and Supply","authors":"Angelos Aveklouris, Levi DeValve, Maximiliano Stock, Amy Ward","doi":"10.1287/opre.2022.0005","DOIUrl":null,"url":null,"abstract":"Balancing Speed and Value in On-Demand Matching Platforms In “Matching Impatient and Heterogeneous Demand and Supply,” Aveklouris, DeValve, Stock, and Ward consider a fundamental trade-off faced by many platforms (e.g., Uber/Lyft) that match supply (e.g., drivers) and demand (e.g., riders) dynamically over time: making matches quickly capitalizes on the value of current supply and demand in the system, whereas waiting may enable better matches at the risk of losing impatient customers. They show that this trade-off can be balanced by waiting a short amount of time before making matches: long enough to gather enough agents to make valuable matches but not so long that impatient agents are likely to leave. Intuitively, this balance depends on how long agents are willing to wait, on average, but the authors show that it also depends on the full distribution of the willingness to wait (i.e., not only mean, but also variance and higher moments play a role). Thus, approaches that only take into account the mean willingness to wait may perform quite poorly. Further, the authors develop an algorithm to rank matching priorities in order to achieve an optimized trade-off between speed and value of matches.","PeriodicalId":54680,"journal":{"name":"Operations Research","volume":null,"pages":null},"PeriodicalIF":2.2000,"publicationDate":"2024-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Operations Research","FirstCategoryId":"91","ListUrlMain":"https://doi.org/10.1287/opre.2022.0005","RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MANAGEMENT","Score":null,"Total":0}
引用次数: 0

Abstract

Balancing Speed and Value in On-Demand Matching Platforms In “Matching Impatient and Heterogeneous Demand and Supply,” Aveklouris, DeValve, Stock, and Ward consider a fundamental trade-off faced by many platforms (e.g., Uber/Lyft) that match supply (e.g., drivers) and demand (e.g., riders) dynamically over time: making matches quickly capitalizes on the value of current supply and demand in the system, whereas waiting may enable better matches at the risk of losing impatient customers. They show that this trade-off can be balanced by waiting a short amount of time before making matches: long enough to gather enough agents to make valuable matches but not so long that impatient agents are likely to leave. Intuitively, this balance depends on how long agents are willing to wait, on average, but the authors show that it also depends on the full distribution of the willingness to wait (i.e., not only mean, but also variance and higher moments play a role). Thus, approaches that only take into account the mean willingness to wait may perform quite poorly. Further, the authors develop an algorithm to rank matching priorities in order to achieve an optimized trade-off between speed and value of matches.
匹配不耐烦的异质需求和供给
在按需匹配平台中平衡速度与价值 在 "匹配不耐烦和异构的需求与供给 "一文中,Aveklouris、DeValve、Stock 和 Ward 考虑了许多平台(如 Uber/Lyft)所面临的基本权衡问题,这些平台随着时间的推移动态匹配供给(如司机)和需求(如乘客):快速匹配可利用系统中当前供需的价值,而等待则可能导致失去不耐烦的客户,从而实现更好的匹配。他们的研究表明,这种权衡可以通过在配对前等待很短的时间来实现:足够长的时间可以聚集足够多的乘客来进行有价值的配对,但又不会太长,以至于没有耐心的乘客可能会离开。直观地说,这种平衡取决于代理人平均愿意等待多长时间,但作者表明,它还取决于等待意愿的全面分布(即不仅是平均值,方差和高矩数也起作用)。因此,只考虑平均等待意愿的方法可能表现不佳。此外,作者还开发了一种对匹配优先级进行排序的算法,以便在速度和匹配价值之间实现优化权衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Operations Research
Operations Research 管理科学-运筹学与管理科学
CiteScore
4.80
自引率
14.80%
发文量
237
审稿时长
15 months
期刊介绍: Operations Research publishes quality operations research and management science works of interest to the OR practitioner and researcher in three substantive categories: methods, data-based operational science, and the practice of OR. The journal seeks papers reporting underlying data-based principles of operational science, observations and modeling of operating systems, contributions to the methods and models of OR, case histories of applications, review articles, and discussions of the administrative environment, history, policy, practice, future, and arenas of application of operations research.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信