Pages that link to "Item:Q4060702"
From MaRDI portal
The following pages link to Optimal Sequential Assignments with Random Arrival Times (Q4060702):
Displayed 23 items.
- Construction of Nash equilibrium in a game version of Elfving's multiple stopping problem (Q367436) (← links)
- A generalized coupon collecting model as a parsimonious optimal stochastic assignment model (Q378733) (← links)
- Optimal assignment of durable objects to successive agents (Q453206) (← links)
- Probabilistic resource allocation in heterogeneous distributed systems with random failures (Q455984) (← links)
- Limiting properties of the discounted house-selling problem (Q761959) (← links)
- Efficient sequential assignment with incomplete information (Q844917) (← links)
- Extensions of the sequential stochastic assignment problem (Q907377) (← links)
- Selecting the best choice in the weighted secretary problem (Q1268240) (← links)
- Dynamic programming formulation of the group interview problem with a general utility function (Q1341989) (← links)
- A new algorithm for the multi-item exponentially discounted optimal selection problem. (Q1420405) (← links)
- Triply stochastic sequential assignment problem with the uncertainty in worker survival (Q2080838) (← links)
- An optimal double stopping rule for a buying-selling problem (Q2176381) (← links)
- A Sequential Assignment Match Process with General Renewal Arrival Times (Q2805370) (← links)
- Multiple-stopping problems with random horizon (Q2808308) (← links)
- STOCHASTIC SEQUENTIAL ASSIGNMENT PROBLEM WITH THRESHOLD CRITERIA (Q2844470) (← links)
- STOCHASTIC SEQUENTIAL ASSIGNMENT PROBLEM WITH ARRIVALS (Q2884250) (← links)
- THE SEQUENTIAL STOCHASTIC ASSIGNMENT PROBLEM WITH POSTPONEMENT OPTIONS (Q4929135) (← links)
- Technical Note—A Stochastic Assignment Problem with Unknown Eligibility Probabilities (Q4994154) (← links)
- Asset Selling Under Debt Obligations (Q5031626) (← links)
- Asymptotic analysis for multi-objective sequential stochastic assignment problems (Q5086480) (← links)
- Generalized Sequential Stochastic Assignment Problem (Q5113887) (← links)
- Optimal partitioning of groups in selecting the best choice (Q5955972) (← links)
- Approximation algorithms for stochastic online matching with reusable resources (Q6046972) (← links)