2002
DOI: 10.1006/jmaa.2001.7679
|View full text |Cite
|
Sign up to set email alerts
|

A Stochastic Differential Game in the Orthrant

Abstract: We study a zero-sum stochastic differential game in the nonnegative orthrant. The state of the system is governed by controlled reflecting diffusions in the nonnegative orthrant. We consider discounted and average payoff evaluation criteria. We prove the existence of values and optimal strategies for both payoff criteria.  2002 Elsevier Science

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
7
0

Year Published

2005
2005
2022
2022

Publication Types

Select...
7

Relationship

3
4

Authors

Journals

citations
Cited by 11 publications
(7 citation statements)
references
References 9 publications
0
7
0
Order By: Relevance
“…where C(l 0 ,T,D l ) is independent of m. Now using the standard approximation procedure see for example [10], we can show that (4.7) has a solution in…”
Section: Stochastic Differential Game With Finite Time Horizonmentioning
confidence: 94%
See 1 more Smart Citation
“…where C(l 0 ,T,D l ) is independent of m. Now using the standard approximation procedure see for example [10], we can show that (4.7) has a solution in…”
Section: Stochastic Differential Game With Finite Time Horizonmentioning
confidence: 94%
“…For a specific construction of D m see [10]. We assume that (A1) The function g is bounded continuous and there exists d .…”
Section: Existence Of Unique Solution To the Skorohod Problemmentioning
confidence: 99%
“…x is the probability measure on the space over which X(•) is a weak solution of (1) corresponding to a strategy pair (v 1 , v 2 ) and initial state x. We refer [23], [24], [37] for sufficient conditions ensuring (A2).…”
Section: Setmentioning
confidence: 99%
“…The process ξ(•) changes only when X(•) hits ∂D. Such processes arise in many applications including the heavy traffic analysis of queuing networks coming from problems in manufacturing systems and communications (see [13], [15], [23], [31]). Since except for a few special cases, the direct analysis of problems in queuing network are very difficult to analyze, one tries to find a continuous approximation of it which can provide a tractable solution.…”
mentioning
confidence: 99%
See 1 more Smart Citation