Generalized Sequential Stochastic Assignment Problem

DOI10.1287/stsy.2018.0017zbMath1442.90092MaRDI QIDQ5113887

Jacobson, Sheldon H., Arash Khatibi

Publication date: 18 June 2020

Published in: Stochastic Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/stsy.2018.0017

zbMATH Keywords

secretary problem; sequential assignment; online matching

Mathematics Subject Classification ID

90B36: Stochastic scheduling theory in operations research

60G40: Stopping times; optimal stopping problems; gambling theory

62L15: Optimal stopping in statistics

Related Items

Triply stochastic sequential assignment problem with the uncertainty in worker survival

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient sequential assignment with incomplete information
• The infinite secretary problem
• On variants of the matroid secretary problem
• Optimal selection based on relative rank (the 'Secretary Problem')
• Technical Note—Stochastic Sequential Decision-Making with a Random Number of Jobs
• The Secretary Problem and Its Extensions: A Review
• The d choice secretary problem
• Optimal Sequential Assignment
• The Best Choice Problem for a Random Number of Objects
• Optimal Sequential Assignments with Random Arrival Times
• A secretary problem with uncertain employment
• Doubly Stochastic Sequential Assignment Problem
• Secretary Problems via Linear Programming
• Patient Choice in Kidney Allocation: A Sequential Stochastic Assignment Model
• The optimum strategy for choosing the maximum ofN independent random variables
• A Sequential Stochastic Assignment Problem
• Asymptotic Optimal Policies for the Stochastic Sequential Assignment Problem
• Dynamic Programming and Decision Theory