The Art of Drafting: A Team-Oriented Hero Recommendation System for Multiplayer Online Battle Arena Games

被引:30
作者
Chen, Zhengxing [1 ]
Nguyen, Truong-Huy D. [2 ]
Xu, Yuyu [1 ]
Amato, Christopher [1 ]
Cooper, Seth [1 ]
Sun, Yizhou [3 ]
El-Nasr, Magy Seif [1 ]
机构
[1] Northeastern Univ, Boston, MA 02115 USA
[2] Fordham Univ, Bronx, NY 10458 USA
[3] Univ Calif Los Angeles, Los Angeles, CA USA
来源
12TH ACM CONFERENCE ON RECOMMENDER SYSTEMS (RECSYS) | 2018年
关键词
Monte Carlo Tree Search; Multiplayer Online Battle Arena; Hero Pick; TIME; GO;
D O I
10.1145/3240323.3240345
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Multiplayer Online Battle Arena (MOBA) games have received increasing popularity recently. In a match of such games, players compete in two teams of five, each controlling an in-game avatar, known as heroes, selected from a roster of more than 100. The selection of heroes, also known as pick or draft, takes place before the match starts and alternates between the two teams until each player has selected one hero. Heroes are designed with different strengths and weaknesses to promote team cooperation in a game. Intuitively, heroes in a strong team should complement each other's strengths and suppress those of opponents. Hero drafting is therefore a challenging problem due to the complex hero-to-hero relationships to consider. In this paper, we propose a novel hero recommendation system that suggests heroes to add to an existing team while maximizing the team's prospect for victory. To that end, we model the drafting between two teams as a combinatorial game and use Monte Carlo Tree Search (MCTS) for estimating the values of hero combinations. Our empirical evaluation shows that hero teams drafted by our recommendation algorithm have a significantly higher win rate against teams constructed by other baseline and state-of-the-art strategies.
引用
收藏
页码:200 / 208
页数:9
相关论文
共 39 条
[1]  
Agrawal R., 1994, P 20 INT C VER LARG, P487, DOI DOI 10.5555/645920.672836
[2]  
[Anonymous], 2007, P 24 INT C MACH LEAR
[3]  
[Anonymous], 2015, SER GAME PRO
[4]   Finite-time analysis of the multiarmed bandit problem [J].
Auer, P ;
Cesa-Bianchi, N ;
Fischer, P .
MACHINE LEARNING, 2002, 47 (2-3) :235-256
[5]  
Balla RK, 2009, 21ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-09), PROCEEDINGS, P40
[6]  
Bishop C.M., 2006, PATTERN RECOGN, V4, P738, DOI DOI 10.1117/1.2819119
[7]   A Survey of Monte Carlo Tree Search Methods [J].
Browne, Cameron B. ;
Powley, Edward ;
Whitehouse, Daniel ;
Lucas, Simon M. ;
Cowling, Peter I. ;
Rohlfshagen, Philipp ;
Tavener, Stephen ;
Perez, Diego ;
Samothrakis, Spyridon ;
Colton, Simon .
IEEE TRANSACTIONS ON COMPUTATIONAL INTELLIGENCE AND AI IN GAMES, 2012, 4 (01) :1-43
[8]   What did I do Wrong in my MOBA Game?: Mining Patterns Discriminating Deviant Behaviours [J].
Cavadenti, Olivier ;
Codocedo, Victor ;
Boulicaut, Jean-Francois ;
Kaytoue, Mehdi .
PROCEEDINGS OF 3RD IEEE/ACM INTERNATIONAL CONFERENCE ON DATA SCIENCE AND ADVANCED ANALYTICS, (DSAA 2016), 2016, :662-671
[9]  
Chaslot Guillaume, 2009, Advances in Computer Games. 12th International Conference, ACG 2009. Revised Papers, P1
[10]  
Chen Zhengxing., 2016, Meaningful Play