Hostname: page-component-74656f9884-j7cmm Total loading time: 0 Render date: 2026-11-08T17:55:58.265Z Has data issue: false hasContentIssue false

Arret optimal avec contrainte

Published online by Cambridge University Press:  01 July 2016

Monique Pontier*
Affiliation:
Université d'Orléans
Jacques Szpirglas*
Affiliation:
Centre National d'Etudes des Télécommunications
*
∗ Adresse postale: Départment de Mathématiques, Université d'Orléans, 45046 Orléans-Cedex, France.
∗∗ Adresse postale: CNET/PAA/TIM/MTI. 92131 Issy les Moulineaux, France.

Abstract

Given two optional positive bounded processes Y and Y′, defined on a probability space , and a non-negative real a, the problem is to maximize the average reward E(YT ) among all the stopping times T verifying the following constraint: The problem is solved by Lagrangian saddlepoint techniques in the set of randomized stopping times including the set of stopping times.

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 1983 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable