Angelos Aveklouris, Levi DeValve, Maximiliano Stock, Amy Ward
{"title":"匹配不耐烦的异质需求和供给","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":"{\"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}","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}
Matching Impatient and Heterogeneous Demand and Supply
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.
期刊介绍:
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.