Asymptotic Optimal Policies for the Stochastic Sequential Assignment Problem

DOI10.1287/MNSC.19.1.46MaRDI QIDQ5670432zbMATH OpenOpenAlexFDO

Authors Chris Albright, Cyrus 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

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

Cited in

(18)

• Selecting the best choice in the weighted secretary problem
• Dynamic programming formulation of the group interview problem with a general utility function
• Efficiency in lung transplant allocation strategies
• Asymptotics of the optimum in discrete sequential assignment
• On the sequential construction of optimum bounded designs
• On the life and work of Cyrus Derman
• A generalized coupon collecting model as a parsimonious optimal stochastic assignment model
• 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
• Technical note -- A stochastic assignment problem with unknown eligibility probabilities
• Asymptotic analysis for multi-objective sequential stochastic assignment problems
• Generalized sequential stochastic assignment problem
• Limiting behavior of the target-dependent stochastic sequential assignment problem
• The dice-and-numbers game
• Limiting properties of the discounted house-selling problem
• Sequential online subsampling for thinning experimental designs
• Extensions of the sequential stochastic assignment problem

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

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