{
  "id": "math/0602278",
  "version": "v1",
  "published": "2006-02-13T16:50:40.000Z",
  "updated": "2006-02-13T16:50:40.000Z",
  "title": "Recognising the Last Record of a Sequence",
  "authors": [
    "Alexander Gnedin"
  ],
  "categories": [
    "math.PR"
  ],
  "abstract": "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2006-02-13T16:50:40.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "60G40",
      "60G70"
    ],
    "keywords": [
      "observer knows distribution",
      "recognising",
      "best-choice problem",
      "optimal stopping policy",
      "explicit formula"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2006math......2278G"
    }
  }
}