✦ LIBER ✦

Approximations and bounds for a generalized optimal stopping problem

✍ Scribed by W. J. Runggaldier; F. Spizzichino

Publisher: Springer
Year: 1982
Tongue: English
Weight: 599 KB
Volume: 26
Category: Article
ISSN: 0340-9422
DOI: 10.1007/bf01917107

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamilton–Jacobi theory for a generalized

Hamilton–Jacobi theory for a generalized optimal stopping time problem

✍ Jane J. Ye; Qiji J. Zhu 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 152 KB

Comonotonic approximations for a general

Comonotonic approximations for a generalized provisioning problem with application to optimal portfolio selection

✍ Koen Van Weert; Jan Dhaene; Marc Goovaerts 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 284 KB

In this paper we discuss multiperiod portfolio selection problems related to a specific provisioning problem. Our results are an extension of Dhaene et al. (2005) [14], where optimal constant mix investment strategies are obtained in a provisioning and savings context, using an analytical approach b

Generalized pointwise bias error bounds

Generalized pointwise bias error bounds for response surface approximations

✍ Tushar Goel; Raphael T. Haftka; Melih Papila; Wei Shyy 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 849 KB

## Abstract This paper proposes a generalized pointwise bias error bounds estimation method for polynomial‐based response surface approximations when bias errors are substantial. A relaxation parameter is introduced to account for inconsistencies between the data and the assumed true model. The met

Bounds and monotonicity for the generali

Bounds and monotonicity for the generalized Robin problem

✍ Tiziana Giorgi; Robert Smits 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 249 KB

On the construction of the cost in the g

On the construction of the cost in the generalized optimal stopping problem for a random sequence

✍ N. V. Elbakidze 📂 Article 📅 1991 🏛 Springer US 🌐 English ⚖ 434 KB

Optimal Bounds for the Predecessor Probl

Optimal Bounds for the Predecessor Problem and Related Problems

✍ Paul Beame; Faith E. Fich 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 269 KB

We obtain matching upper and lower bounds for the amount of time to find the predecessor of a given element among the elements of a fixed compactly stored set. Our algorithms are for the unit-cost word RAM with multiplication and are extended to give dynamic algorithms. The lower bounds are proved f