Optimal Sequential Assignments with Random Arrival Times
From MaRDI portal
Cited in
(23)- Selecting the best choice in the weighted secretary problem
- Dynamic programming formulation of the group interview problem with a general utility function
- A new algorithm for the multi-item exponentially discounted optimal selection problem.
- Triply stochastic sequential assignment problem with the uncertainty in worker survival
- An optimal double stopping rule for a buying-selling problem
- A sequential assignment match process with general renewal arrival times
- Multiple-stopping problems with random horizon
- Stochastic sequential assignment problem with threshold criteria
- Stochastic sequential assignment problem with arrivals
- Construction of Nash equilibrium in a game version of Elfving's multiple stopping problem
- A generalized coupon collecting model as a parsimonious optimal stochastic assignment model
- 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
- Technical note -- A stochastic assignment problem with unknown eligibility probabilities
- Asset selling under debt obligations
- Asymptotic analysis for multi-objective sequential stochastic assignment problems
- Generalized sequential stochastic assignment problem
- Optimal partitioning of groups in selecting the best choice
- Approximation algorithms for stochastic online matching with reusable resources
- Limiting properties of the discounted house-selling problem
- Efficient sequential assignment with incomplete information
- Extensions of the sequential stochastic assignment problem
This page was built for publication: Optimal Sequential Assignments with Random Arrival Times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4060702)
