269 citations · 443 across the 19 of their papers we have counts for
8 papers · 1 filter
LogicInference: A New Dataset for Teaching Logical Inference to seq2seq Models
Santiago Ontanon, Joshua Ainslie, Vaclav Cvicek +1
Machine learning models such as Transformers or LSTMs struggle with tasks that are compositional in nature such as those involving reasoning/inference. Although many datasets exist…
Player-Centered AI for Automatic Game Personalization: Open Problems
Jichen Zhu, Santiago Ontañón
Computer games represent an ideal research domain for the next generation of personalized digital applications. This paper presents a player-centered framework of AI for game perso…
Player Modeling via Multi-Armed Bandits
Robert C. Gray, Jichen Zhu, Dannielle Arigo +2
This paper focuses on building personalized player models solely from player behavior in the context of adaptive games. We present two main contributions: The first is a novel appr…
Tracing Player Knowledge in a Parallel Programming Educational Game
Pavan Kantharaju, Katelyn Alderfer, Jichen Zhu +3
This paper focuses on "tracing player knowledge" in educational games. Specifically, given a set of concepts or skills required to master a game, the goal is to estimate the likeli…
Combinatorial Multi-armed Bandits for Real-Time Strategy Games
Santiago Ontañón
Games with large branching factors pose a significant challenge for game tree search algorithms. In this paper, we address this problem with a sampling strategy for Monte Carlo Tre…
Combat Models for RTS Games
Alberto Uriarte, Santiago Ontañón
Game tree search algorithms, such as Monte Carlo Tree Search (MCTS), require access to a forward model (or "simulator") of the game at hand. However, in some games such forward mod…
RHOG: A Refinement-Operator Library for Directed Labeled Graphs
Santiago Ontañón
This document provides the foundations behind the functionality provided by the G library (https://github.com/santiontanon/RHOG), focusing on the basic operations the library pr…
Experiments with Game Tree Search in Real-Time Strategy Games
Santiago Ontanon
Game tree search algorithms such as minimax have been used with enormous success in turn-based adversarial games such as Chess or Checkers. However, such algorithms cannot be direc…