Pages that link to "Item:Q2527110"
From MaRDI portal
The following pages link to Discrete search and the Neyman-Pearson lemma (Q2527110):
Displaying 16 items.
- Optimal partial hedging in a discrete-time market as a Knapsack problem (Q607677) (← links)
- Estimation of distributions involving unobservable events: the case of optimal search with unknown target distributions (Q710617) (← links)
- Bayesian analysis of switching regression models (Q1075000) (← links)
- Optimal search for one of many objects hidden in two boxes (Q1098771) (← links)
- Discrete search and estimation (Q1158094) (← links)
- On optimal search with unknown detection probabilities (Q1167066) (← links)
- Finding a hider by an unknown deadline (Q1785459) (← links)
- Optimal discrete search with technological choice (Q2354015) (← links)
- A Stackelberg equilibrium for a missile procurement problem (Q2519103) (← links)
- Some duality relationships for the generalized Neyman-Pearson problem (Q2532763) (← links)
- Quiz show problems (Q2538068) (← links)
- On Discrete Search for a Multiple Number of Objects (Q3688083) (← links)
- Controlling a Fleet of Unmanned Aerial Vehicles to Collect Uncertain Information in a Threat Environment (Q4604902) (← links)
- (Q5131476) (← links)
- A search problem with considering posterior treatments for a detected object (Q5293406) (← links)
- Multi-objective search game: long-term vs short-term (Q6551159) (← links)