Batching and Greedy Policies: How Good Are They in Dynamic Matching?

渐近最优算法 计算机科学 数学优化 匹配(统计) 节点(物理) 贪婪算法 简单(哲学) 放松(心理学) 工作(物理) 运筹学 数理经济学 贪婪随机自适应搜索过程 分数(化学) 动态定价 多样性(控制论) 分布式计算 平衡溶液 分布(数学) 动态规划
作者
Myungeun Eom,Alejandro Toriello
出处
期刊:Manufacturing & Service Operations Management [Institute for Operations Research and the Management Sciences]
卷期号:28 (2): 479-495
标识
DOI:10.1287/msom.2024.1074
摘要

Problem definition: We study a dynamic nonbipartite stochastic matching problem, where nodes appear following a type-specific independent distribution and wait in the system for a given sojourn time. This problem is motivated by applications in ride-sharing and freight transportation marketplaces and is related to other on-demand marketplaces. Methodology/results: We study the asymptotic properties of two widely used policies, batching and greedy, by analyzing a single-pair case and then converting to the general counterpart using a fluid relaxation and randomization. Finally, we present a computational study simulating freight transportation and ride-sharing marketplaces to assess the empirical effectiveness of the policies. We show that the batching policy is asymptotically optimal with respect to the sojourn time; similarly, although a straightforward greedy policy may not be optimal, a greedy policy with randomized modifications is asymptotically optimal. Perhaps more practically relevant, both policies converge exponentially fast to approximate optimality. We also extend our model to an impatient setting in which each unmatched node leaves at the end of each period with a type-dependent probability. We show that the results for the two policies still hold under different assumptions about the nodes’ patience; roughly speaking, the batching policy requires more patient nodes than the greedy policy to remain optimal. Managerial implications: Our results suggest that managers can achieve near-optimal performance by using simple greedy or batching policies, with only a reasonably small maximum waiting time guarantee, and even in the presence of potentially impatient nodes. Funding: The authors’ work was partially supported by the U.S. Office of Naval Research [Grant N00014-23-1-2631]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2024.1074 .

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
美羊羊羊发布了新的文献求助10
刚刚
刚刚
ikun完成签到,获得积分10
刚刚
刚刚
黄俊发布了新的文献求助10
刚刚
幕帆完成签到,获得积分0
刚刚
李小轩发布了新的文献求助10
1秒前
沉默笑蓝发布了新的文献求助30
1秒前
1秒前
1秒前
2秒前
3秒前
Morch2021完成签到,获得积分10
3秒前
极限001的应助被元宝芒果黑虎采纳,获得150
3秒前
pray5959完成签到,获得积分10
4秒前
4秒前
4秒前
JanaL发布了新的文献求助10
4秒前
4秒前
4秒前
5秒前
mw发布了新的文献求助10
5秒前
5秒前
黄俊完成签到,获得积分10
6秒前
sdl发布了新的文献求助10
6秒前
Darcy发布了新的文献求助10
7秒前
7秒前
7秒前
迷路的傲南完成签到,获得积分10
7秒前
坚强孤容发布了新的文献求助10
7秒前
霸气安筠完成签到,获得积分10
7秒前
一心想出文章完成签到,获得积分10
8秒前
8秒前
斯文钢笔完成签到,获得积分10
8秒前
9秒前
幽默的问梅完成签到,获得积分10
9秒前
9秒前
9秒前
酷波er的应助被阿业采纳,获得10
10秒前
10秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
拉伸高分子熔体中缠结行为的模拟和小角中子散射研究 1700
The World Atlas of Wine 9th edition 1000
奈特基础组织学:配套组织病理学(第4版)(Netter's Essential Histology With Correlated Histopathology) 800
八旗制度の研究 600
Improving the wear resistance of vehicle gear oil by oil soluble LaF3 nanoparticles and typical additives of gear oil 500
Boundaries and Bodhisattvas 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 计算机科学 工程类 有机化学 化学工程 生物化学 物理 复合材料 内科学 催化作用 光电子学 人工智能 细胞生物学 无机化学 物理化学 数学
热门帖子
关注 科研通微信公众号,转发送积分 8183142
求助须知:如何正确求助?哪些是违规求助? 9572420
关于积分的说明 21825253
捐赠科研通 7779922
什么是DOI,文献DOI怎么找? 3433850
关于科研通互助平台的介绍 2558060
邀请新用户注册赠送积分活动 2480124