{
  "id": "1509.04617",
  "version": "v1",
  "published": "2015-09-15T16:04:15.000Z",
  "updated": "2015-09-15T16:04:15.000Z",
  "title": "Sequential Selection of a Monotone Subsequence from a Random Permutation",
  "authors": [
    "Peichao Peng",
    "J. Michael Steele"
  ],
  "categories": [
    "math.PR"
  ],
  "abstract": "We find a two term asymptotic expansion for the optimal expected value of a sequentially selected monotone subsequence from a random permutation of length n. A striking feature of this expansion is that tells us that the expected value of optimal selection from a random permutation is quantifiably larger than optimal sequential selection from an independent sequences of uniformly distributed random variables; specifically, it is larger by at least (1/6)log n +O(1).",
  "revisions": [
    {
      "version": "v1",
      "updated": "2015-09-15T16:04:15.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "60C05"
    ],
    "keywords": [
      "random permutation",
      "expected value",
      "term asymptotic expansion",
      "optimal sequential selection",
      "sequentially selected monotone subsequence"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2015arXiv150904617P"
    }
  }
}