Asymptotic Optimal Policies for the Stochastic Sequential Assignment Problem

DOI10.1287/MNSC.19.1.46zbMath0255.90022OpenAlexW2158869923MaRDI QIDQ5670432

Chris Albright, C. Derman

Publication date: 1972

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.19.1.46

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items (18)

Sequential online subsampling for thinning experimental designs ⋮ Asymptotics of the optimum in discrete sequential assignment ⋮ Dynamic programming formulation of the group interview problem with a general utility function ⋮ Asymptotic analysis for multi-objective sequential stochastic assignment problems ⋮ On the life and work of Cyrus Derman ⋮ A generalized coupon collecting model as a parsimonious optimal stochastic assignment model ⋮ Generalized Sequential Stochastic Assignment Problem ⋮ Extensions of the sequential stochastic assignment problem ⋮ The dice-and-numbers game ⋮ Sequential stochastic assignment under uncertainty: estimation and convergence ⋮ Probabilistic resource allocation in heterogeneous distributed systems with random failures ⋮ THE SEQUENTIAL STOCHASTIC ASSIGNMENT PROBLEM WITH POSTPONEMENT OPTIONS ⋮ On the sequential construction of optimum bounded designs ⋮ Efficiency in lung transplant allocation strategies ⋮ Selecting the best choice in the weighted secretary problem ⋮ Limiting properties of the discounted house-selling problem ⋮ Technical Note—A Stochastic Assignment Problem with Unknown Eligibility Probabilities ⋮ Unnamed Item

This page was built for publication: Asymptotic Optimal Policies for the Stochastic Sequential Assignment Problem