{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:24:42Z","timestamp":1750220682722,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,12,24]],"date-time":"2020-12-24T00:00:00Z","timestamp":1608768000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,12,24]]},"DOI":"10.1145\/3446132.3446165","type":"proceedings-article","created":{"date-parts":[[2021,3,10]],"date-time":"2021-03-10T00:15:23Z","timestamp":1615335323000},"page":"1-7","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Reinforced Evolutionary Algorithms for Game Difficulty Control"],"prefix":"10.1145","author":[{"given":"Guangwu","family":"Cui","sequence":"first","affiliation":[{"name":"Xiangtan University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruimin","family":"Shen","sequence":"additional","affiliation":[{"name":"NetEase, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingfeng","family":"Chen","sequence":"additional","affiliation":[{"name":"NetEase, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan","family":"Zou","sequence":"additional","affiliation":[{"name":"Xiangtan University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shengxiang","family":"Yang","sequence":"additional","affiliation":[{"name":"De Montfort University, England"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changjie","family":"Fan","sequence":"additional","affiliation":[{"name":"NetEase, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinghua","family":"Zheng","sequence":"additional","affiliation":[{"name":"Xiangtan University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,3,9]]},"reference":[{"volume-title":"Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms","author":"Back Thomas","key":"e_1_3_2_1_1_1","unstructured":"Thomas Back . 1996. Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms . Oxford university press . Thomas Back. 1996. Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms. Oxford university press."},{"volume-title":"Multi-objective optimization using evolutionary algorithms. Vol.\u00a016","author":"Deb Kalyanmoy","key":"e_1_3_2_1_2_1","unstructured":"Kalyanmoy Deb . 2001. Multi-objective optimization using evolutionary algorithms. Vol.\u00a016 . John Wiley & Sons . Kalyanmoy Deb. 2001. Multi-objective optimization using evolutionary algorithms. Vol.\u00a016. John Wiley & Sons."},{"key":"e_1_3_2_1_3_1","volume-title":"A fast and elitist multiobjective genetic algorithm: NSGA-II","author":"Deb Kalyanmoy","year":"2002","unstructured":"Kalyanmoy Deb , Amrit Pratap , Sameer Agarwal , and TAMT Meyarivan . 2002. A fast and elitist multiobjective genetic algorithm: NSGA-II . IEEE transactions on evolutionary computation 6, 2( 2002 ), 182\u2013197. Kalyanmoy Deb, Amrit Pratap, Sameer Agarwal, and TAMT Meyarivan. 2002. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE transactions on evolutionary computation 6, 2(2002), 182\u2013197."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2018.8490405"},{"volume-title":"Monte-Carlo Tree Search for Implementation of Dynamic Difficulty Adjustment Fighting Game AIs Having Believable Behaviors. In 2018 IEEE Conference on Computational Intelligence and Games (CIG)","author":"Ishihara Makoto","key":"e_1_3_2_1_5_1","unstructured":"Makoto Ishihara , Suguru Ito , Ryota Ishii , Tomohiro Harada , and Ruck Thawonmas . 2018. Monte-Carlo Tree Search for Implementation of Dynamic Difficulty Adjustment Fighting Game AIs Having Believable Behaviors. In 2018 IEEE Conference on Computational Intelligence and Games (CIG) . IEEE , 1\u20138. Makoto Ishihara, Suguru Ito, Ryota Ishii, Tomohiro Harada, and Ruck Thawonmas. 2018. Monte-Carlo Tree Search for Implementation of Dynamic Difficulty Adjustment Fighting Game AIs Having Believable Behaviors. In 2018 IEEE Conference on Computational Intelligence and Games (CIG). IEEE, 1\u20138."},{"key":"e_1_3_2_1_6_1","unstructured":"Vijay\u00a0R Konda and John\u00a0N Tsitsiklis. 2000. Actor-critic algorithms. In Advances in neural information processing systems. 1008\u20131014.  Vijay\u00a0R Konda and John\u00a0N Tsitsiklis. 2000. Actor-critic algorithms. In Advances in neural information processing systems. 1008\u20131014."},{"key":"e_1_3_2_1_7_1","unstructured":"Timothy\u00a0P Lillicrap Jonathan\u00a0J Hunt Alexander Pritzel Nicolas Heess Tom Erez Yuval Tassa David Silver and Daan Wierstra. 2015. Continuous control with deep reinforcement learning. arXiv preprint arXiv:1509.02971(2015).  Timothy\u00a0P Lillicrap Jonathan\u00a0J Hunt Alexander Pritzel Nicolas Heess Tom Erez Yuval Tassa David Silver and Daan Wierstra. 2015. Continuous control with deep reinforcement learning. arXiv preprint arXiv:1509.02971(2015)."},{"key":"e_1_3_2_1_8_1","volume-title":"International conference on machine learning. 1928\u20131937","author":"Mnih Volodymyr","year":"2016","unstructured":"Volodymyr Mnih , Adria\u00a0Puigdomenech Badia , Mehdi Mirza , Alex Graves , Timothy Lillicrap , Tim Harley , David Silver , and Koray Kavukcuoglu . 2016 . Asynchronous methods for deep reinforcement learning . In International conference on machine learning. 1928\u20131937 . Volodymyr Mnih, Adria\u00a0Puigdomenech Badia, Mehdi Mirza, Alex Graves, Timothy Lillicrap, Tim Harley, David Silver, and Koray Kavukcuoglu. 2016. Asynchronous methods for deep reinforcement learning. In International conference on machine learning. 1928\u20131937."},{"key":"e_1_3_2_1_9_1","unstructured":"OpenAI. 2018. OpenAI Five. https:\/\/blog.openai.com\/openai-five\/.  OpenAI. 2018. OpenAI Five. https:\/\/blog.openai.com\/openai-five\/."},{"key":"e_1_3_2_1_10_1","first-page":"75","article-title":"Automatically generating game tactics through evolutionary learning","volume":"27","author":"Ponsen Marc","year":"2006","unstructured":"Marc Ponsen , H\u00e9ctor Munoz-Avila , Pieter Spronck , and David\u00a0 W Aha . 2006 . Automatically generating game tactics through evolutionary learning . AI Magazine 27 , 3 (2006), 75 \u2013 75 . Marc Ponsen, H\u00e9ctor Munoz-Avila, Pieter Spronck, and David\u00a0W Aha. 2006. Automatically generating game tactics through evolutionary learning. AI Magazine 27, 3 (2006), 75\u201375.","journal-title":"AI Magazine"},{"key":"e_1_3_2_1_11_1","unstructured":"Tim Salimans Jonathan Ho Xi Chen Szymon Sidor and Ilya Sutskever. 2017. Evolution strategies as a scalable alternative to reinforcement learning. arXiv preprint arXiv:1703.03864(2017).  Tim Salimans Jonathan Ho Xi Chen Szymon Sidor and Ilya Sutskever. 2017. Evolution strategies as a scalable alternative to reinforcement learning. arXiv preprint arXiv:1703.03864(2017)."},{"key":"e_1_3_2_1_12_1","volume-title":"Julian Schrittwieser, Ioannis Antonoglou","author":"Silver David","year":"2016","unstructured":"David Silver , Aja Huang , Chris\u00a0 J Maddison , Arthur Guez , Laurent Sifre , George Van Den\u00a0Driessche , Julian Schrittwieser, Ioannis Antonoglou , Veda Panneershelvam, Marc Lanctot , 2016 . Mastering the game of Go with deep neural networks and tree search. Nature 529, 7587 (2016), 484. David Silver, Aja Huang, Chris\u00a0J Maddison, Arthur Guez, Laurent Sifre, George Van Den\u00a0Driessche, Julian Schrittwieser, Ioannis Antonoglou, Veda Panneershelvam, Marc Lanctot, 2016. Mastering the game of Go with deep neural networks and tree search. Nature 529, 7587 (2016), 484."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.856210"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1577069.1755867"},{"volume-title":"Reinforcement learning: An introduction","author":"Sutton S","key":"e_1_3_2_1_15_1","unstructured":"Richard\u00a0 S Sutton and Andrew\u00a0 G Barto . 2018. Reinforcement learning: An introduction . MIT press . Richard\u00a0S Sutton and Andrew\u00a0G Barto. 2018. Reinforcement learning: An introduction. MIT press."},{"key":"e_1_3_2_1_16_1","unstructured":"Richard\u00a0S Sutton David\u00a0A McAllester Satinder\u00a0P Singh and Yishay Mansour. 2000. Policy gradient methods for reinforcement learning with function approximation. In Advances in neural information processing systems. 1057\u20131063.  Richard\u00a0S Sutton David\u00a0A McAllester Satinder\u00a0P Singh and Yishay Mansour. 2000. Policy gradient methods for reinforcement learning with function approximation. In Advances in neural information processing systems. 1057\u20131063."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2011.2158434"},{"key":"e_1_3_2_1_18_1","volume-title":"Asynchronous stochastic approximation and Q-learning. Machine learning 16, 3","author":"Tsitsiklis N","year":"1994","unstructured":"John\u00a0 N Tsitsiklis . 1994. Asynchronous stochastic approximation and Q-learning. Machine learning 16, 3 ( 1994 ), 185\u2013202. John\u00a0N Tsitsiklis. 1994. Asynchronous stochastic approximation and Q-learning. Machine learning 16, 3 (1994), 185\u2013202."},{"key":"e_1_3_2_1_19_1","volume-title":"Thirtieth AAAI conference on artificial intelligence.","author":"Van\u00a0Hasselt Hado","year":"2016","unstructured":"Hado Van\u00a0Hasselt , Arthur Guez , and David Silver . 2016 . Deep reinforcement learning with double Q-learning . In Thirtieth AAAI conference on artificial intelligence. Hado Van\u00a0Hasselt, Arthur Guez, and David Silver. 2016. Deep reinforcement learning with double Q-learning. In Thirtieth AAAI conference on artificial intelligence."},{"volume-title":"Learning from delayed rewards","author":"Cornish\u00a0Hellaby Watkins Christopher John","key":"e_1_3_2_1_20_1","unstructured":"Christopher John Cornish\u00a0Hellaby Watkins . 1989. Learning from delayed rewards . King\u2019s College , Cambridge . Christopher John Cornish\u00a0Hellaby Watkins. 1989. Learning from delayed rewards. King\u2019s College, Cambridge."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2004.1330969"},{"key":"e_1_3_2_1_22_1","volume-title":"A multiobjective evolutionary algorithm based on decomposition","author":"Zhang Qingfu","year":"2007","unstructured":"Qingfu Zhang and Hui Li. 2007. MOEA\/D : A multiobjective evolutionary algorithm based on decomposition . IEEE transactions on evolutionary computation 11, 6( 2007 ), 712\u2013731. Qingfu Zhang and Hui Li. 2007. MOEA\/D: A multiobjective evolutionary algorithm based on decomposition. IEEE transactions on evolutionary computation 11, 6(2007), 712\u2013731."},{"key":"e_1_3_2_1_23_1","unstructured":"Eckart Zitzler Marco Laumanns and Lothar Thiele. 2001. SPEA2: Improving the strength Pareto evolutionary algorithm. TIK-report 103(2001).  Eckart Zitzler Marco Laumanns and Lothar Thiele. 2001. SPEA2: Improving the strength Pareto evolutionary algorithm. TIK-report 103(2001)."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/5681652"}],"event":{"name":"ACAI 2020: 2020 3rd International Conference on Algorithms, Computing and Artificial Intelligence","acronym":"ACAI 2020","location":"Sanya China"},"container-title":["2020 3rd International Conference on Algorithms, Computing and Artificial Intelligence"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3446132.3446165","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3446132.3446165","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:03:26Z","timestamp":1750197806000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3446132.3446165"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,24]]},"references-count":24,"alternative-id":["10.1145\/3446132.3446165","10.1145\/3446132"],"URL":"https:\/\/doi.org\/10.1145\/3446132.3446165","relation":{},"subject":[],"published":{"date-parts":[[2020,12,24]]},"assertion":[{"value":"2021-03-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}