On randomized stopping points and perfect graphs
Randomized stopping points form a convex set associated with the information structure that arises in the context of the optimal stopping problem for two-parameter processes. We study combinatorial properties of this structure when the underlying space is finite, in which case this convex set can be identified with a bounded polyhedron. Study of the extreme points of this polytope motivates the definition of an apparently new class of perfectly orderable graphs. Properties of this class of graphs are examined. For this setting, it is shown that under a classical hypothesis of the probabilistic model, the extremal elements of the set of randomized stopping points are precisely ordinary stopping points.
- On infinite perfect graphs and randomized stopping points on the plane
- Random perfect graphs
- Optimal stopping in a search for a vertex with full degree in a random graph
- Some deterministic and random fixed point theorems on a graph
- scientific article; zbMATH DE number 553912
- Publication:3203055
- Randomized stopping points and optimal stopping on the plane
- A stopping criterion for Markov chains when generating independent random graphs
- Perfect matchings in random intersection graphs
- A Note on "The Comparability Graph of a Tree"
- A note on perfect graphs
- Bithreshold Graphs
- Compactness of stopping times
- Four classes of perfectly orderable graphs
- Generalized neighbourhoods and a class of perfectly orderable graphs
- scientific article; zbMATH DE number 3889341 (Why is no real title available?)
- scientific article; zbMATH DE number 3854111 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3891425 (Why is no real title available?)
- scientific article; zbMATH DE number 3988376 (Why is no real title available?)
- scientific article; zbMATH DE number 3721832 (Why is no real title available?)
- scientific article; zbMATH DE number 3740439 (Why is no real title available?)
- scientific article; zbMATH DE number 3776544 (Why is no real title available?)
- scientific article; zbMATH DE number 3589450 (Why is no real title available?)
- scientific article; zbMATH DE number 3338381 (Why is no real title available?)
- scientific article; zbMATH DE number 3420800 (Why is no real title available?)
- Longest cycles in threshold graphs
- On certain polytopes associated with graphs
- On infinite perfect graphs and randomized stopping points on the plane
- On randomized stopping points and perfect graphs
- Perfectness of normal products of graphs
- Stopping rules and tactics for processes indexed by a directed set
- The Dilworth Number of a Graph
- The ellipsoid method and its consequences in combinatorial optimization
- Tolerance graphs
- Topics on perfect graphs
- On randomized stopping points and perfect graphs
- On infinite perfect graphs and randomized stopping points on the plane
- What is my objective function?
- scientific article; zbMATH DE number 3988376 (Why is no real title available?)
- Optimal Stopping of Two-Parameter Processes on Nonstandard Probability Spaces
- A matrix representation of fields and filtrations and its application to stochastic control problems
- On the perfect orderability of unions of two graphs
- Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs
- Optimal stopping for many connected components in a graph
This page was built for publication: On randomized stopping points and perfect graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1085176)
