匹配(统计)
竞争分析
一般化
计算机科学
在线算法
路径(计算)
数学优化
最佳匹配
随机优化
随机过程
随机逼近
数学
算法
钥匙(锁)
上下界
统计
数学分析
计算机安全
程序设计语言
作者
Vineet Goyal,Rajan Udwani
出处
期刊:Operations Research
[Institute for Operations Research and the Management Sciences]
日期:2023-03-01
卷期号:71 (2): 563-580
被引量:2
标识
DOI:10.1287/opre.2022.2345
摘要
In the paper “Online Matching with Stochastic Rewards: Optimal Competitive Ratio via Path-Based Formulation,” the authors develop a novel algorithm analysis approach to address stochastic elements in online matching. The approach leads to several new results that were previously out of reach for a fundamental generalization of online matching. More generally, the approach is useful for analyzing the performance of online algorithms for matching in settings with stochastic uncertainty that manifests after matching decisions are made.
科研通智能强力驱动
Strongly Powered by AbleSci AI