On randomized stopping points and perfect graphs

DOI10.1016/0095-8956(88)90076-7zbMath0607.05034MaRDI QIDQ1085176

Robert C. Dalang, Dominique de Werra, Leslie E. jun. Trotter

Publication date: 1988

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/1813/8563

zbMATH Keywords

optimal stopping; filtrations; perfect graphs; perfectly orderable graphs; perfect matrices; randomized stopping points

Mathematics Subject Classification ID

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

60G40: Stopping times; optimal stopping problems; gambling theory

60G57: Random measures

05C75: Structural characterization of families of graphs

05C15: Coloring of graphs and hypergraphs

Related Items

A matrix representation of fields and filtrations and its application to stochastic control problems, Unnamed Item, On randomized stopping points and perfect graphs, On infinite perfect graphs and randomized stopping points on the plane, What is my objective function?, Optimal Stopping of Two-Parameter Processes on Nonstandard Probability Spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Topics on perfect graphs
• Tolerance graphs
• A note on perfect graphs
• On randomized stopping points and perfect graphs
• On infinite perfect graphs and randomized stopping points on the plane
• Generalized neighbourhoods and a class of perfectly orderable graphs
• Stopping rules and tactics for processes indexed by a directed set
• The ellipsoid method and its consequences in combinatorial optimization
• Perfectness of normal products of graphs
• Longest cycles in threshold graphs
• On certain polytopes associated with graphs
• Bithreshold Graphs
• Four classes of perfectly orderable graphs
• Compactness of stopping times
• The Dilworth Number of a Graph
• A Note on "The Comparability Graph of a Tree"