Approximation algorithms for stochastic online matching with reusable resources
From MaRDI portal
Publication:6046972
DOI10.1007/s00186-023-00822-3MaRDI QIDQ6046972
Ge Yu, Meghan Shanks, Jacobson, Sheldon H.
Publication date: 6 September 2023
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
90C15: Stochastic programming
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Online interval scheduling: Randomized and multiprocessor cases
- Randomized online interval scheduling
- On-line scheduling of jobs with fixed start and end times
- Online C-benevolent job scheduling on multiple machines
- Heuristics for the stochastic dynamic task-resource allocation problem with retry opportunities
- An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions
- Online Stochastic Matching: Online Actions Based on Offline Statistics
- Markov decision processes and stochastic games with total effective payoff
- Technical Note—Stochastic Sequential Decision-Making with a Random Number of Jobs
- Online Scheduling of Jobs with Fixed Start Times on Related Machines
- The Temp Secretary Problem
- A Sequential Stochastic Assignment Problem in a Partially Observable Markov Chain
- Optimal Sequential Assignment
- Optimal Sequential Assignments with Random Arrival Times
- Semiamarts and finite values
- A markov chain version of the secretary problem
- A stochastic assignment problem
- Hiring Secretaries over Time: The Benefit of Concurrent Employment
- Online Stochastic Matching: Beating 1-1/e
- Approximate Dynamic Programming
- Patient Choice in Kidney Allocation: A Sequential Stochastic Assignment Model
- Online bipartite matching with random arrivals
- A Sequential Stochastic Assignment Problem
