Approximation algorithms for stochastic online matching with reusable resources

We consider a class of stochastic online matching problems, where a set of sequentially arriving jobs are to be matched to a group of workers. The objective is to maximize the total expected reward, defined as the sum of the rewards of each matched worker-job pair. Each worker can be matched to mult...

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical methods of operations research (Heidelberg, Germany) Vol. 98; no. 1; pp. 43 - 56
Main Authors:	Shanks, Meghan, Yu, Ge, Jacobson, Sheldon H.
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.08.2023 Springer Nature B.V
Subjects:	Algorithms Approximation Business and Management Calculus of Variations and Optimal Control; Optimization Employment Expected values Markov analysis Matching Mathematical analysis Mathematics Mathematics and Statistics Operations research Operations Research/Decision Theory Original Article Passenger screening Queuing Random variables Scheduling Success Workers Stochastic matching Online algorithms Approximation algorithms Reusable resources
ISSN:	1432-2994, 1432-5217
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!