A full-information best-choice problem with finite memory
From MaRDI portal
Publication:3753199
DOI10.2307/3214010zbMATH Open0612.60043OpenAlexW2329429727MaRDI QIDQ3753199FDOQ3753199
Publication date: 1986
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/3214010
Cited In (10)
- Zdzisław Józef Porosiński: wspomnienie
- Full-information best choice game with hint
- A SEQUENTIAL DECISION PROBLEM WITH A FINITE MEMORY
- Recursive procedures for multiple decisions: Finite time memory and stepwise maximum likelihood procedure
- An Explicit Formula for the Optimal Gain in the Full-Information Problem of Owning a Relatively Best Object
- On the full information best-choice problem
- Title not available (Why is that?)
- Power-of-d-Choices with Memory: Fluid Limit and Optimality
- Robust best choice problem
- A Full-Information Best-Choice Problem with Allowance
Recommendations
- Title not available (Why is that?) 👍 👎
- On optimal choosing of one of the \(k\) best objects. 👍 👎
- Title not available (Why is that?) 👍 👎
- Optimal Sequential Selection From a Known Distribution With Holding Costs 👍 👎
- Full-information best choice problems with recall of observations, uncertainty of selection and a random number of observations 👍 👎
- Title not available (Why is that?) 👍 👎
- An optimal choice problem for uniform random variables seen simultaneously or sequentially with availability depending on the observation. 👍 👎
- Title not available (Why is that?) 👍 👎
- Sequential selection of an increasing subsequence from a sample of random size 👍 👎
This page was built for publication: A full-information best-choice problem with finite memory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3753199)
