Cyber-Attack Forecast Modeling and Complexity Reduction Using a Game-Theoretic Framework
From MaRDI portal
Publication:2925499
DOI10.1007/978-3-319-01159-2_4zbMath1302.93032OpenAlexW165977945MaRDI QIDQ2925499
Georgios Kotsalis, Malachi Jones, Jeff S. Shamma
Publication date: 16 October 2014
Published in: Control of Cyber-Physical Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-01159-2_4
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- An analog of the minimax theorem for vector payoffs
- The LP formulation of finite zero-sum games with incomplete information
- Optimal strategies for the uninformed player
- ``Eventually revealing repeated games with incomplete information
- On the relation between finitely and infinitely repeated games with incomplete information
- Stochastic Games with a Single Controller and Incomplete Information
- Balanced Truncation for a Class of Stochastic Jump Linear Systems and Model Reduction for Hidden Markov Models
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Cyber-Attack Forecast Modeling and Complexity Reduction Using a Game-Theoretic Framework