✦ LIBER ✦

Optimal stopping and supermartingales over partially ordered sets

✍ Scribed by A. Mandelbaum; R. J. Vanderbei

Publisher: Springer
Year: 1981
Tongue: English
Weight: 613 KB
Volume: 57
Category: Article
ISSN: 1432-2064
DOI: 10.1007/bf00535493

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some optimal algorithms for decomposed p

Some optimal algorithms for decomposed partially ordered sets

✍ Vijay K. Garg 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 428 KB

Projective diagrams over partially order

Projective diagrams over partially ordered sets are free

✍ Michael Höppner; Helmut Lenzing 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 353 KB

Chen-Fox-Lyndon Factorization for Words

Chen-Fox-Lyndon Factorization for Words over Partially Ordered Sets

✍ M. Hazewinkel 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 101 KB

Emergence and self-organization in parti

Emergence and self-organization in partially ordered sets

✍ Sergio Pissanetzky 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 239 KB

Shortcuts, diversions, and maximal chain

Shortcuts, diversions, and maximal chainsin partially ordered sets

✍ David Sankoff; Peter H. Sellers 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 308 KB

An algorithm is described for finding the maximal weight chain between two points in a locally finite partial order under the restriction that all but • (or fewer) successive pairs in the chain belong to a given subset of the partial order relation. Applications of the method in molecular genetics,

Partially ordered sets and the rogers-ra

Partially ordered sets and the rogers-ramanujan identities

✍ George E. Andrews 📂 Article 📅 1975 🏛 Springer 🌐 English ⚖ 614 KB