2018
DOI: 10.1007/978-3-319-75268-6_4
|View full text |Cite
|
Sign up to set email alerts
|

A Scalable Decomposition Method for the Dynamic Defense of Cyber Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
4
2
1

Relationship

1
6

Authors

Journals

citations
Cited by 10 publications
(10 citation statements)
references
References 19 publications
0
10
0
Order By: Relevance
“…Our model in this paper is much more general in that it allows for non-degenerate distributions. Similar to our work, Saghafian (2015) provides an extension of POMDPs, termed Ambiguous POMDPs (APOMDPs), by allowing for ambiguous transition probabilities. However, unlike the RPOMDP framework we study in this paper, the APOMDP approach proposed in Saghafian (2015) uses α-maximin preferences.…”
Section: Literaturementioning
confidence: 95%
See 1 more Smart Citation
“…Our model in this paper is much more general in that it allows for non-degenerate distributions. Similar to our work, Saghafian (2015) provides an extension of POMDPs, termed Ambiguous POMDPs (APOMDPs), by allowing for ambiguous transition probabilities. However, unlike the RPOMDP framework we study in this paper, the APOMDP approach proposed in Saghafian (2015) uses α-maximin preferences.…”
Section: Literaturementioning
confidence: 95%
“…RPOMDPs with maximin approach have also been studied under the condition that the set of state transition distributions consists of only degenerate distributions; that is, when each distribution refers to one specific transition almost surely (see, e.g., Bernhard (2000), Başar and Bernhard (2008), Bertsekas and Rhodes (1973), Rasouli et al (2018), and Witsenhausen (1966)). Our model in this paper is much more general in that it allows for non-degenerate distributions.…”
Section: Literaturementioning
confidence: 99%
“…We consider the RHS of ( 44) term-by-term. By direct application of (22) in Definition 4, the first term in the RHS satisfies…”
Section: B Properties Of Approximate Information Statesmentioning
confidence: 99%
“…, T , let m t = (x 0:t , u 0:t−1 ) be the realization of M t and let the approximate information state be xt = µ t (x t ). We first derive the value of t in the RHS of (22) In this appendix, we derive the values of t and δ t for all t = 0, . .…”
Section: Appendix B -Approximation Bounds For Perfectly Observed Systemsmentioning
confidence: 99%
See 1 more Smart Citation