Shoou-Ren Hsiau

activity

20172026

k

-th best candidate

1 citations · 1 across the 3 of their papers we have counts for

collaborators

4 papers

math.PR2026

Stochastic dominance of first return times for nearest-neighbor random walks on $Z^{d}$

Shoou-Ren Hsiau, Ting-Yi Tsai, Yi-Ching Yao

For a $d$ -dimensional probability vector $h = (h_{1}, \dots, h_{d})$ , let $(S_{n}^{h})_{n \geq 0}$ be a nearest-neighbor random walk on $Z^{d}$ such that at each ste…

math.PR2025

Stochastic Ordering for Bernoulli and Normal Random Walks

Shoou-Ren Hsiau, Yi-Ching Yao

Let $(S_{n}^{p})_{n \geq 0}$ be a Bernoulli random walk where each of the independent increments is either $1$ or $- 1$ with probabilities $p$ and $1 - p$ . For $p^{'}$ and $p^{''} \in [0, 1]$ wit…

math.PR2025

A Double Secretary Problem

Shoou-Ren Hsiau, Yi-Shen Lin

We consider a double secretary problem which contains $2 n$ applicants of $n$ different qualities, two of each quality. As in the classical secretary problem (CSP), the applicants a…

math.PR2017★ 1 cited

Optimal selection of the $k$ -th best candidate

Yi-Shen Lin, Shoou-Ren Hsiau, Yi-Ching Yao

In the subject of optimal stopping, the classical secretary problem is concerned with optimally selecting the best of $n$ candidates when their relative ranks are observed sequenti…

Stochastic dominance of first return times for nearest-neighbor random walks on Zd

Stochastic Ordering for Bernoulli and Normal Random Walks

A Double Secretary Problem

Optimal selection of the k-th best candidate

Stochastic dominance of first return times for nearest-neighbor random walks on $Z^{d}$

Optimal selection of the $k$ -th best candidate