Recognising the Last Record of a Sequence
| dc.creator | Gnedin, Alexander | |
| dc.date | 2006-02-13 | |
| dc.date.accessioned | 2026-07-07T07:03:23Z | |
| dc.date.available | 2026-07-07T07:03:23Z | |
| dc.description | We study the best-choice problem for processes which generalise the process of records from Poisson-paced i.i.d. observations. Under the assumption that the observer knows distribution of the process and the horizon, we determine the optimal stopping policy and for a parametric family of problems also derive an explicit formula for the maximum probability of recognising the last record. | |
| dc.identifier | https://arxiv.org/abs/math/0602278 | |
| dc.identifier | http://arxiv.org/abs/math/0602278 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/108951 | |
| dc.subject | Probability | |
| dc.subject | 60G40, 60G70 | |
| dc.title | Recognising the Last Record of a Sequence | |
| dc.type | text |