Approximation algorithms for stochastic online matching with reusable resources

DOI10.1007/S00186-023-00822-3MaRDI QIDQ6046972FDOQ6046972

Authors: Meghan Shanks, Ge Yu, Sheldon H. Jacobson 

Publication date: 6 September 2023

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

zbMATH Keywords

online algorithmsapproximation algorithmsreusable resourcesstochastic matching

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Stochastic programming (90C15)

Cites Work

• Title not available (Why is that?)
• Fundamentals of queueing theory
• Online interval scheduling: Randomized and multiprocessor cases
• Randomized online interval scheduling
• On-line scheduling of jobs with fixed start and end times
• Optimal Sequential Assignment
• Approximate Dynamic Programming
• Online stochastic matching: online actions based on offline statistics
• Online Stochastic Matching: Beating 1-1/e
• Online bipartite matching with random arrivals
• Title not available (Why is that?)
• A Sequential Stochastic Assignment Problem
• Optimal Sequential Assignments with Random Arrival Times
• Patient Choice in Kidney Allocation: A Sequential Stochastic Assignment Model
• A Sequential Stochastic Assignment Problem in a Partially Observable Markov Chain
• Markov decision processes and stochastic games with total effective payoff
• A stochastic assignment problem
• Stochastic sequential decision-making with a random number of jobs
• A markov chain version of the secretary problem
• Semiamarts and finite values
• Online Scheduling of Jobs with Fixed Start Times on Related 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
• The Temp Secretary Problem
• Online C-benevolent job scheduling on multiple machines
• Hiring Secretaries over Time: The Benefit of Concurrent Employment

Cited In (3)

• Admission control to minimize rejections and online set cover with repetitions
• Randomized approximation and online algorithms for assignment problems
• Title not available (Why is that?)

This page was built for publication: Approximation algorithms for stochastic online matching with reusable resources

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6046972)