Best choice from the planar Poisson process
From MaRDI portal
Publication:2485763
DOI10.1016/J.SPA.2003.12.005zbMATH Open1076.60043arXivmath/0209050OpenAlexW1967041771MaRDI QIDQ2485763FDOQ2485763
Authors: Alexander Gnedin 
Publication date: 5 August 2005
Published in: Stochastic Processes and their Applications (Search for Journal in Brave)
Abstract: Various best-choice problems related to the planar homogeneous Poisson process in finite or semi-infinite rectangle are studied. The analysis is largely based on properties of the one-dimensional box-area process associated with the sequence of records. We prove a series of distributional identities involving exponential and uniform random variables, and resolve the Petruccelli-Porosinski-Samuels paradox on coincidence of asymptotic values in certain discrete-time optimal stopping problems.
Full work available at URL: https://arxiv.org/abs/math/0209050
Recommendations
- scientific article; zbMATH DE number 67284
- Embedding optimal selection problems in a Poisson process
- Optimal Poisson approximation of uniform empirical processes
- The favorite point of a Poisson process
- A Poisson allocation of optimal tail
- Path selection in a Poisson field
- scientific article; zbMATH DE number 3925902
Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Stopping times; optimal stopping problems; gambling theory (60G40)
Cites Work
- Title not available (Why is that?)
- Many multivariate records
- Title not available (Why is that?)
- Limiting curves for i.i.d. records
- Title not available (Why is that?)
- Equilibrium Points in a Game Related to the Best Choice Problem
- On a class of incomplete gamma functions with applications
- Geometry. Transl. from the Russian by O. V. Sipacheva. Transl. edited by A. B. Sossinski
- Embedding optimal selection problems in a Poisson process
- The finite-memory secretary problem
- Extremal processes, secretary problems and the 1/e law
- Optimal stopping for extremal processes
- Record sequences and their applications.
- Records, permutations and greatest convex minorants
- Approximation of optimal stopping problems.
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the full information best-choice problem
- On optimal stopping of a sequence of independent random variables- probability maximizing approach
- The full-information best choice problem with a random number of observations
- Title not available (Why is that?)
- On a best choice problem with partial information
- On best choice problems having similar solutions
- Title not available (Why is that?)
- Objectives in the Best-Choice Problems
- Why do these quite different best-choice problems have the same solutions?
- Selecting a sequence of last successes in independent trials
Cited In (16)
- Winning Rate in the Full-Information Best-Choice Problem
- On the optimal stopping problems with monotone thresholds
- A new strategy for Robbins' problem of optimal stopping
- Stochastic processes with proportional increments and the last-arrival problem
- Objectives in the Best-Choice Problems
- Why do these quite different best-choice problems have the same solutions?
- What is Known About Robbins' Problem?
- Optimal stopping rule for the full-information duration problem with random horizon
- An Explicit Formula for the Optimal Gain in the Full-Information Problem of Owning a Relatively Best Object
- Recognising the last record of sequence
- Sum the multiplicative odds to one and stop
- Title not available (Why is that?)
- Running minimum in the best-choice problem
- Shelf life of candidates in the generalized secretary problem
- Optimal stopping rule for the no-information duration problem with random horizon
- Optimal choice of the best available applicant in full-information models
This page was built for publication: Best choice from the planar Poisson process
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2485763)
