2026-09-18T23:58:07Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1451462022-08-30T03:46:08Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Hemberg, Erik
O’Reilly, Una-May
Turner, Matthew J.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2022-08-29T16:36:20Z
2022-08-29T16:36:20Z
2022-05
2022-05-27T16:19:39.584Z
https://hdl.handle.net/1721.1/145146
Cybersecurity simulations can offer deep insights into the behavior of agents in the battle to secure computer systems. We build on existing work modeling the competition between an attacker and defender on a network architecture in a zero-sum game using a graph database linking cybersecurity attack patterns, vulnerabilities, and software. To support these simulations, we introduce a data-driven approach to generate enterprise network samples. We apply coevolution to this challenging environment, and, in a novel modeling approach for this problem, interpret each population as a distribution over fixed strategies to form a mixed strategy Nash equilibrium. We compare the results to solutions generated by multi-agent reinforcement learning and show that evolutionary methods demonstrate a greater degree of robustness to hyperparameter misspecification in this environment. Our results suggest that coevolution may prove to be a satisfactory benchmark for hyperparameter tuning of adversarially trained reinforcement learning agents in the absence of other metrics for solution optimality.
M.Eng.
Massachusetts Institute of Technology
In Copyright - Educational Use Permitted
Copyright MIT
http://rightsstatements.org/page/InC-EDU/1.0/
Analyzing Multi-Agent Reinforcement Learning and Coevolution in Cybersecurity Simulations
Thesis
application/pdf
Master
Master of Engineering in Electrical Engineering and Computer Science
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="5061ef47-87f1-4ddc-a4ea-7d609f6b5e86">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Title>Analyzing Multi-Agent Reinforcement Learning and Coevolution in Cybersecurity Simulations</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2022-05</PublicationDate>
<Authors>
<Author>
<DisplayName>Turner, Matthew J.</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://rightsstatements.org/page/InC-EDU/1.0/</License>
<Abstract>Cybersecurity simulations can offer deep insights into the behavior of agents in the battle to secure computer systems. We build on existing work modeling the competition between an attacker and defender on a network architecture in a zero-sum game using a graph database linking cybersecurity attack patterns, vulnerabilities, and software. To support these simulations, we introduce a data-driven approach to generate enterprise network samples. We apply coevolution to this challenging environment, and, in a novel modeling approach for this problem, interpret each population as a distribution over fixed strategies to form a mixed strategy Nash equilibrium. We compare the results to solutions generated by multi-agent reinforcement learning and show that evolutionary methods demonstrate a greater degree of robustness to hyperparameter misspecification in this environment. Our results suggest that coevolution may prove to be a satisfactory benchmark for hyperparameter tuning of adversarially trained reinforcement learning agents in the absence of other metrics for solution optimality.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>