Dynamic Stochastic Matching Under Limited Time
From MaRDI portal
Publication:5106373
DOI10.1287/opre.2022.2293zbMath1500.90053OpenAlexW4281649295MaRDI QIDQ5106373
Publication date: 19 September 2022
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2022.2293
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Continuous-time Markov decision processes. Theory and applications
- On-line algorithms for weighted bipartite matching and stable marriages
- Dynamic weighted matching with heterogeneous arrival and departure rates
- Stochastic domination and Markovian couplings
- Bayesian Mechanism Design
- Exact FCFS Matching Rates for Two Infinite Multitype Sequences
- A skill based parallel service system under FCFS-ALIS — steady state, overloads, and abandonments
- Online Stochastic Matching: Online Actions Based on Offline Statistics
- Fluid Models for Overloaded Multiclass Many-Server Queueing Systems with First-Come, First-Served Routing
- A General Attraction Model and Sales-Based Linear Program for Network Revenue Management Under Customer Choice
- Revenue Management Under a General Discrete Choice Model of Consumer Behavior
- An O(log2 k)-Competitive Algorithm for Metric Bipartite Matching
- Fcfs infinite bipartite matching of servers and customers
- Poisson Arrivals See Time Averages
- Flexible Queueing Architectures
- Efficient Dynamic Barter Exchange
- Online Weighted Matching
- On the Pathwise Comparison of Jump Processes Driven by Stochastic Intensities
- Optimal dynamic matching
- On the Optimal Design of a Bipartite Matching Queueing System
- Spatial Equilibrium, Search Frictions, and Dynamic Efficiency in the Taxi Industry
- Dynamic Matching for Real-Time Ride Sharing
- Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios
- Online Stochastic Matching: Beating 1-1/e
- How to match when all vertices arrive online
- Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model
- Online Stochastic Matching: New Algorithms with Better Bounds
- Dynamic pricing and matching in ride‐hailing platforms
This page was built for publication: Dynamic Stochastic Matching Under Limited Time
