scientific article; zbMATH DE number 1263183
From MaRDI portal
Publication:4234053
zbMath0921.60062MaRDI QIDQ4234053
Publication date: 29 September 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Stopping times; optimal stopping problems; gambling theory (60G40)
Related Items (10)
The access time of random walks on trees with given partition ⋮ On incentive compatibility in dynamic mechanism design with exit option in a Markovian environment ⋮ Faster mixing and small bottlenecks ⋮ Exact mixing times for random walks on trees ⋮ A Hitting Time Formula for the Discrete Green's Function ⋮ Mixing times for uniformly ergodic Markov chains ⋮ Mixing times are hitting times of large sets ⋮ The best mixing time for random walks on trees ⋮ Mixing time bounds via bottleneck sequences ⋮ Optimal stopping of stochastic transport minimizing submartingale costs
This page was built for publication:
