{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T17:00:34Z","timestamp":1756573234944,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T00:00:00Z","timestamp":1689120000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP190103894","FT200100536"],"award-info":[{"award-number":["DP190103894","FT200100536"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,15]]},"DOI":"10.1145\/3583131.3590436","type":"proceedings-article","created":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T19:40:19Z","timestamp":1689190819000},"page":"1348-1356","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Evolving Reinforcement Learning Environment to Minimize Learner's Achievable Reward: An Application on Hardening Active Directory Systems"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8212-8793","authenticated-orcid":false,"given":"Diksha","family":"Goel","sequence":"first","affiliation":[{"name":"School of Computer and Mathematical Sciences, University of Adelaide, Adelaide, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0036-4782","authenticated-orcid":false,"given":"Aneta","family":"Neumann","sequence":"additional","affiliation":[{"name":"School of Computer and Mathematical Sciences, University of Adelaide, Adelaide, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2721-3618","authenticated-orcid":false,"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[{"name":"School of Computer and Mathematical Sciences, University of Adelaide, Adelaide, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1028-920X","authenticated-orcid":false,"given":"Hung","family":"Nguyen","sequence":"additional","affiliation":[{"name":"School of Computer and Mathematical Sciences, University of Adelaide, Adelaide, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3478-9201","authenticated-orcid":false,"given":"Mingyu","family":"Guo","sequence":"additional","affiliation":[{"name":"School of Computer and Mathematical Sciences, University of Adelaide, Adelaide, Australia"}]}],"member":"320","published-online":{"date-parts":[[2023,7,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459363"},{"key":"e_1_3_2_1_2_1","volume-title":"Openai gym. arXiv preprint arXiv:1606.01540","author":"Brockman Greg","year":"2016","unstructured":"Greg Brockman , Vicki Cheung , Ludwig Pettersson , Jonas Schneider , John Schulman , Jie Tang , and Wojciech Zaremba . 2016. Openai gym. arXiv preprint arXiv:1606.01540 ( 2016 ). Greg Brockman, Vicki Cheung, Ludwig Pettersson, Jonas Schneider, John Schulman, Jie Tang, and Wojciech Zaremba. 2016. Openai gym. arXiv preprint arXiv:1606.01540 (2016)."},{"volume-title":"A guide to microsoft active directory (ad) design","author":"Dias John","key":"e_1_3_2_1_3_1","unstructured":"John Dias . 2002. A guide to microsoft active directory (ad) design . Technical Report. Lawrence Livermore National Lab.(LLNL), Livermore, CA (United States) . John Dias. 2002. A guide to microsoft active directory (ad) design. Technical Report. Lawrence Livermore National Lab.(LLNL), Livermore, CA (United States)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3561974"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629575.1629605"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3512290.3528729"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i9.21167"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i5.25701"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2022.11.019"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1622737.1622748"},{"volume-title":"The 22nd International Conference on Autonomous Agents and Multiagent Systems (AAMAS). Extended Abstract.","author":"Ngo Quang Huy","key":"e_1_3_2_1_11_1","unstructured":"Quang Huy Ngo , Mingyu Guo , and Hung Nguyen . 2023. Near Optimal Strategies for Honeypots Placement in Dynamic and Large Active Directory Networks . In The 22nd International Conference on Autonomous Agents and Multiagent Systems (AAMAS). Extended Abstract. Quang Huy Ngo, Mingyu Guo, and Hung Nguyen. 2023. Near Optimal Strategies for Honeypots Placement in Dynamic and Large Active Directory Networks. In The 22nd International Conference on Autonomous Agents and Multiagent Systems (AAMAS). Extended Abstract."},{"key":"e_1_3_2_1_12_1","volume-title":"Entropy-based evolutionary diversity optimisation for the traveling salesperson problem. arXiv preprint arXiv:2104.13538","author":"Nikfarjam Adel","year":"2021","unstructured":"Adel Nikfarjam , Jakob Bossek , Aneta Neumann , and Frank Neumann . 2021. Entropy-based evolutionary diversity optimisation for the traveling salesperson problem. arXiv preprint arXiv:2104.13538 ( 2021 ). Adel Nikfarjam, Jakob Bossek, Aneta Neumann, and Frank Neumann. 2021. Entropy-based evolutionary diversity optimisation for the traveling salesperson problem. arXiv preprint arXiv:2104.13538 (2021)."},{"key":"e_1_3_2_1_13_1","volume-title":"Proximal policy optimization algorithms. arXiv preprint arXiv:1707.06347","author":"Schulman John","year":"2017","unstructured":"John Schulman , Filip Wolski , Prafulla Dhariwal , Alec Radford , and Oleg Klimov . 2017. Proximal policy optimization algorithms. arXiv preprint arXiv:1707.06347 ( 2017 ). John Schulman, Filip Wolski, Prafulla Dhariwal, Alec Radford, and Oleg Klimov. 2017. Proximal policy optimization algorithms. arXiv preprint arXiv:1707.06347 (2017)."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1830483.1830569"},{"key":"e_1_3_2_1_15_1","volume-title":"Tianshou: A highly modularized deep reinforcement learning library. arXiv preprint arXiv:2107.14171","author":"Weng Jiayi","year":"2021","unstructured":"Jiayi Weng , Huayu Chen , Dong Yan , Kaichao You , Alexis Duburcq , Minghao Zhang , Hang Su , and Jun Zhu . 2021 . Tianshou: A highly modularized deep reinforcement learning library. arXiv preprint arXiv:2107.14171 (2021). Jiayi Weng, Huayu Chen, Dong Yan, Kaichao You, Alexis Duburcq, Minghao Zhang, Hang Su, and Jun Zhu. 2021. Tianshou: A highly modularized deep reinforcement learning library. arXiv preprint arXiv:2107.14171 (2021)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3579856.3590343"}],"event":{"name":"GECCO '23: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Lisbon Portugal","acronym":"GECCO '23"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583131.3590436","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3583131.3590436","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:03Z","timestamp":1750178823000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583131.3590436"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,12]]},"references-count":16,"alternative-id":["10.1145\/3583131.3590436","10.1145\/3583131"],"URL":"https:\/\/doi.org\/10.1145\/3583131.3590436","relation":{},"subject":[],"published":{"date-parts":[[2023,7,12]]},"assertion":[{"value":"2023-07-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}