GLORIA

GEOMAR Library Ocean Research Information Access

X

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Yang, Jiing-Ru  (4)
  • Mathematics  (4)
Material
Publisher
Person/Organisation
Language
Years
Subjects(RVK)
  • Mathematics  (4)
RVK
  • 1
    Online Resource
    Online Resource
    On Markov-dependent parking problems
    Cambridge University Press (CUP) ; 2004
    In:  Journal of Applied Probability Vol. 41, No. 02 ( 2004-06), p. 579-586
    Details
    In: Journal of Applied Probability, Cambridge University Press (CUP), Vol. 41, No. 02 ( 2004-06), p. 579-586
    Abstract: We drive a car along a street towards our destination and look for an available parking place without turning around. Each parking place is associated with a loss which decreases with the distance of the parking place from our destination. Assume that the states (empty or filled) of the parking places form a Markov chain. We want to find an optimal parking strategy to minimize the expected loss. A curious example is constructed and two sufficient conditions for the existence of the threshold-type optimal parking strategy are given.
    Type of Medium: Online Resource
    ISSN: 0021-9002 , 1475-6072
    URL: Article
    DOI: 10.1017/S0021900200014522
    RVK:
    SA 6100
    Language: English
    Publisher: Cambridge University Press (CUP)
    Publication Date: 2004
    detail.hit.zdb_id: 1474599-9
    detail.hit.zdb_id: 219147-7
    SSG: 3,2
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
  • 2
    Online Resource
    Online Resource
    Selecting the last success in Markov-dependent trials
    Cambridge University Press (CUP) ; 2002
    In:  Journal of Applied Probability Vol. 39, No. 2 ( 2002-06), p. 271-281
    Details
    In: Journal of Applied Probability, Cambridge University Press (CUP), Vol. 39, No. 2 ( 2002-06), p. 271-281
    Abstract: In a sequence of Markov-dependent trials, the optimal strategy which maximizes the probability of stopping on the last success is considered. Both homogeneous Markov chains and nonhomogeneous Markov chains are studied. For the homogeneous case, the analysis is divided into two parts and both parts are realized completely. For the nonhomogeneous case, we prove a result which contains the result of Bruss (2000) under an independence structure.
    Type of Medium: Online Resource
    ISSN: 0021-9002 , 1475-6072
    URL: Article
    DOI: 10.1239/jap/1025131425
    RVK:
    SA 6100
    Language: English
    Publisher: Cambridge University Press (CUP)
    Publication Date: 2002
    detail.hit.zdb_id: 1474599-9
    detail.hit.zdb_id: 219147-7
    SSG: 3,2
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
  • 3
    Online Resource
    Online Resource
    Selecting the last success in Markov-dependent trials
    Cambridge University Press (CUP) ; 2002
    In:  Journal of Applied Probability Vol. 39, No. 02 ( 2002-06), p. 271-281
    Details
    In: Journal of Applied Probability, Cambridge University Press (CUP), Vol. 39, No. 02 ( 2002-06), p. 271-281
    Abstract: In a sequence of Markov-dependent trials, the optimal strategy which maximizes the probability of stopping on the last success is considered. Both homogeneous Markov chains and nonhomogeneous Markov chains are studied. For the homogeneous case, the analysis is divided into two parts and both parts are realized completely. For the nonhomogeneous case, we prove a result which contains the result of Bruss (2000) under an independence structure.
    Type of Medium: Online Resource
    ISSN: 0021-9002 , 1475-6072
    URL: Article
    DOI: 10.1017/S0021900200022506
    RVK:
    SA 6100
    Language: English
    Publisher: Cambridge University Press (CUP)
    Publication Date: 2002
    detail.hit.zdb_id: 1474599-9
    detail.hit.zdb_id: 219147-7
    SSG: 3,2
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
  • 4
    Online Resource
    Online Resource
    On Markov-dependent parking problems
    Cambridge University Press (CUP) ; 2004
    In:  Journal of Applied Probability Vol. 41, No. 2 ( 2004-06), p. 579-586
    Details
    In: Journal of Applied Probability, Cambridge University Press (CUP), Vol. 41, No. 2 ( 2004-06), p. 579-586
    Abstract: We drive a car along a street towards our destination and look for an available parking place without turning around. Each parking place is associated with a loss which decreases with the distance of the parking place from our destination. Assume that the states (empty or filled) of the parking places form a Markov chain. We want to find an optimal parking strategy to minimize the expected loss. A curious example is constructed and two sufficient conditions for the existence of the threshold-type optimal parking strategy are given.
    Type of Medium: Online Resource
    ISSN: 0021-9002 , 1475-6072
    URL: Article
    DOI: 10.1239/jap/1082999088
    RVK:
    SA 6100
    Language: English
    Publisher: Cambridge University Press (CUP)
    Publication Date: 2004
    detail.hit.zdb_id: 1474599-9
    detail.hit.zdb_id: 219147-7
    SSG: 3,2
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...