Interpretable Contextual Team-aware Item Recommendation: Application in Multiplayer Online Battle Arena Games

• URL: http://arxiv.org/abs/2007.15236v1
• Date: Thu, 30 Jul 2020 05:17:28 GMT
• Title: Interpretable Contextual Team-aware Item Recommendation: Application in Multiplayer Online Battle Arena Games
• Authors: Andr\'es Villa, Vladimir Araujo, Francisca Cattan, Denis Parra
• Abstract summary: We develop TTIR, a contextual recommender model based on the Transformer neural architecture. Our evaluation indicates that both the Transformer architecture and the contextual information are essential to get the best results.
• Score: 1.995792341399967
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The video game industry has adopted recommendation systems to boost users interest with a focus on game sales. Other exciting applications within video games are those that help the player make decisions that would maximize their playing experience, which is a desirable feature in real-time strategy video games such as Multiplayer Online Battle Arena (MOBA) like as DotA and LoL. Among these tasks, the recommendation of items is challenging, given both the contextual nature of the game and how it exposes the dependence on the formation of each team. Existing works on this topic do not take advantage of all the available contextual match data and dismiss potentially valuable information. To address this problem we develop TTIR, a contextual recommender model derived from the Transformer neural architecture that suggests a set of items to every team member, based on the contexts of teams and roles that describe the match. TTIR outperforms several approaches and provides interpretable recommendations through visualization of attention weights. Our evaluation indicates that both the Transformer architecture and the contextual information are essential to get the best results for this item recommendation task. Furthermore, a preliminary user survey indicates the usefulness of attention weights for explaining recommendations as well as ideas for future work. The code and dataset are available at: https://github.com/ojedaf/IC-TIR-Lol.

Related papers

• Solving the Content Gap in Roblox Game Recommendations: LLM-Based Profile Generation and Reranking [9.256631838119102]
  Large language models (LLMs) offer opportunities to enhance recommendation systems by analyzing in-game text data. This paper addresses two challenges: generating high-quality, structured text features for games without extensive human annotation, and validating these features to ensure they improve recommendation relevance. We propose an approach that extracts in-game text and uses LLMs to infer attributes such as genre and gameplay objectives from raw player interactions.
  arXiv  Detail & Related papers  (2025-02-01T06:30:56Z)
• Read to Play (R2-Play): Decision Transformer with Multimodal Game Instruction [22.31940101833938]
  This paper explores enhanced forms of task guidance for agents, enabling them to comprehend gameplay instructions. We construct a set of multimodal game instructions to incorporate instruction tuning into a decision transformer.
  arXiv  Detail & Related papers  (2024-02-06T17:09:25Z)
• Towards General Game Representations: Decomposing Games Pixels into Content and Style [2.570570340104555]
  Learning pixel representations of games can benefit artificial intelligence across several downstream tasks. This paper explores how generalizable pre-trained computer vision encoders can be for such tasks. We employ a pre-trained Vision Transformer encoder and a decomposition technique based on game genres to obtain separate content and style embeddings.
  arXiv  Detail & Related papers  (2023-07-20T17:53:04Z)
• SPRING: Studying the Paper and Reasoning to Play Games [102.5587155284795]
  We propose a novel approach, SPRING, to read the game's original academic paper and use the knowledge learned to reason and play the game through a large language model (LLM) In experiments, we study the quality of in-context "reasoning" induced by different forms of prompts under the setting of the Crafter open-world environment. Our experiments suggest that LLMs, when prompted with consistent chain-of-thought, have great potential in completing sophisticated high-level trajectories.
  arXiv  Detail & Related papers  (2023-05-24T18:14:35Z)
• A Minimal Approach for Natural Language Action Space in Text-based Games [103.21433712630953]
  This paper revisits the challenge of exploring the action space in text-based games (TGs) We propose $ epsilon$-admissible exploration, a minimal approach of utilizing admissible actions, for training phase. We present a text-based actor-critic (TAC) agent that produces textual commands for game, solely from game observations.
  arXiv  Detail & Related papers  (2023-05-06T16:05:27Z)
• Sequential Item Recommendation in the MOBA Game Dota 2 [64.8963467704218]
  We explore the applicability of Sequential Item Recommendation (SIR) models in the context of purchase recommendations in Dota 2. Our results show that models that consider the order of purchases are the most effective. In contrast to other domains, we find RNN-based models to outperform the more recent Transformer-based architectures on Dota-350k.
  arXiv  Detail & Related papers  (2022-01-17T14:19:17Z)
• Contextual Games: Multi-Agent Learning with Side Information [57.76996806603094]
  We formulate the novel class of contextual games driven by contextual information at each round. By means of kernel-based regularity assumptions, we model the correlation between different contexts and game outcomes. We propose a novel online (meta) algorithm that exploits such correlations to minimize the contextual regret of individual players.
  arXiv  Detail & Related papers  (2021-07-13T18:37:37Z)
• An Empirical Study on the Generalization Power of Neural Representations Learned via Visual Guessing Games [79.23847247132345]
  This work investigates how well an artificial agent can benefit from playing guessing games when later asked to perform on novel NLP downstream tasks such as Visual Question Answering (VQA) We propose two ways to exploit playing guessing games: 1) a supervised learning scenario in which the agent learns to mimic successful guessing games and 2) a novel way for an agent to play by itself, called Self-play via Iterated Experience Learning (SPIEL)
  arXiv  Detail & Related papers  (2021-01-31T10:30:48Z)
• CRICTRS: Embeddings based Statistical and Semi Supervised Cricket Team Recommendation System [6.628230604022489]
  We propose a semi-supervised statistical approach to build a team recommendation system for cricket. We design a qualitative and quantitative rating system which considers the strength of opposition also for evaluating player performance. We also embark on a critical aspect of team composition, which includes the number of batsmen and bowlers in the team.
  arXiv  Detail & Related papers  (2020-10-26T15:35:44Z)
• Content Based Player and Game Interaction Model for Game Recommendation in the Cold Start setting [3.249853429482705]
  This paper presents content based interaction models that generalize into new games, new players, and both new games and players simultaneously. We find that the models outperform collaborative filtering in these tasks, which makes them useful for real world game recommendation.
  arXiv  Detail & Related papers  (2020-09-11T11:10:49Z)
• Exploration Based Language Learning for Text-Based Games [72.30525050367216]
  This work presents an exploration and imitation-learning-based agent capable of state-of-the-art performance in playing text-based computer games. Text-based computer games describe their world to the player through natural language and expect the player to interact with the game using text. These games are of interest as they can be seen as a testbed for language understanding, problem-solving, and language generation by artificial agents.
  arXiv  Detail & Related papers  (2020-01-24T03:03:51Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.