{
  "id": "0709.3012",
  "version": "v2",
  "published": "2007-09-19T13:16:45.000Z",
  "updated": "2010-09-07T09:03:34.000Z",
  "title": "Construction of a stationary queue with impatient customers",
  "authors": [
    "Pascal Moyal"
  ],
  "comment": "This paper has been withdrawn by the author. This paper has been published in a newer version, arXiv:0802.2495",
  "categories": [
    "math.PR"
  ],
  "abstract": "In this paper, we study the stability of queues with impatient customers. Under general stationary ergodic assumptions, we first provide some conditions for such a queue to be regenerative (i.e. to empty a.s. an infinite number of times). In the particular case of a single server operating in First in, First out, we prove the existence (in some cases, on an enlarged probability space) of a stationary workload. This is done by studying a non-monotonic stochastic recursion under the Palm settings, and by stochastic comparison of stochastic recursions.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2010-09-07T09:03:34.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "impatient customers",
      "stationary queue",
      "construction",
      "general stationary ergodic assumptions",
      "non-monotonic stochastic recursion"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2007arXiv0709.3012M"
    }
  }
}