scientific article; zbMATH DE number 7799704
From MaRDI portal
Publication:6187178
arXiv2112.07930MaRDI QIDQ6187178
Publication date: 5 February 2024
Full work available at URL: https://arxiv.org/abs/2112.07930
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorial probability (60C05) Stopping times; optimal stopping problems; gambling theory (60G40)
Cites Work
- Logarithmic combinatorial structures: A probabilistic approach
- Sum the odds to one and stop
- A stochastic game of optimal stopping and order selection
- The secretary problem with biased arrival order via a Mallows distribution
- Problems from the discrete to the continuous. Probability, number theory, graph theory, and combinatorics
- Regenerative random permutations of integers
- Combinatorics of Permutations
- Secretary Problems with Non-Uniform Arrival Order
- Extremal processes, secretary problems and the 1/e law
- Comparing the inversion statistic for distribution-biased and distribution-shifted permutations with the geometric and the GEM distributions
This page was built for publication: