Optimal Sequential Assignments with Random Arrival Times
From MaRDI portal
Publication:4060702
DOI10.1287/mnsc.21.1.60zbMath0304.90054OpenAlexW2069293271MaRDI QIDQ4060702
Publication date: 1974
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.21.1.60
Related Items (23)
Asset Selling Under Debt Obligations ⋮ STOCHASTIC SEQUENTIAL ASSIGNMENT PROBLEM WITH ARRIVALS ⋮ Dynamic programming formulation of the group interview problem with a general utility function ⋮ Efficient sequential assignment with incomplete information ⋮ Construction of Nash equilibrium in a game version of Elfving's multiple stopping problem ⋮ Asymptotic analysis for multi-objective sequential stochastic assignment problems ⋮ An optimal double stopping rule for a buying-selling problem ⋮ A generalized coupon collecting model as a parsimonious optimal stochastic assignment model ⋮ Approximation algorithms for stochastic online matching with reusable resources ⋮ Generalized Sequential Stochastic Assignment Problem ⋮ Extensions of the sequential stochastic assignment problem ⋮ A new algorithm for the multi-item exponentially discounted optimal selection problem. ⋮ Optimal assignment of durable objects to successive agents ⋮ Probabilistic resource allocation in heterogeneous distributed systems with random failures ⋮ THE SEQUENTIAL STOCHASTIC ASSIGNMENT PROBLEM WITH POSTPONEMENT OPTIONS ⋮ Optimal partitioning of groups in selecting the best choice ⋮ A Sequential Assignment Match Process with General Renewal Arrival Times ⋮ Multiple-stopping problems with random horizon ⋮ 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 ⋮ STOCHASTIC SEQUENTIAL ASSIGNMENT PROBLEM WITH THRESHOLD CRITERIA ⋮ Triply stochastic sequential assignment problem with the uncertainty in worker survival
This page was built for publication: Optimal Sequential Assignments with Random Arrival Times
