Conversational agents have begun to rise both in the academic (in terms of research) and commercial (in terms of applications) world. This paper inve…

Perfect phylogenies are fundamental in the study of evolutionary trees because they capture the situation when each evolutionary trait emerges only o…

The classification of time series data is a well-studied problem with numerous practical applications, such as medical diagnosis and speech recogniti…

The ludemic General Game system Ludii and the Regular Boardgames system are two efficient alternatives which outperform the current standard for academic AI research into GGP in terms of reasoning and human-readability. In term of efficiency, Ludii …

Although General Game Playing (GGP) systems can facilitate useful research in Artificial Intelligence (AI) for game-playing, they are often computati…

Given a finite set $X$, a collection $\mathcal{T}$ of rooted phylogenetic trees on $X$ and an integer $k$, the Hybridization Number problem asks if t…

Digital Archaeoludology (DAL) is a new field of study involving the analysis and reconstruction of ancient games from incomplete descriptions and arc…

Game-playing AI research has focused for a long time on learning to play video games from visual input or symbolic information. However, humans benef…

As of February 2016 Facebook allows users to express their experienced emotions about a post by using five so-called `reactions'. This research paper…

Here we present a new fixed parameter tractable algorithm to compute the hybridization number r of two rooted, not necessarily binary phylogenetic tr…

Here we present a new fixed parameter tractable algorithm to compute the hybridization number r of two rooted binary phylogenetic trees on taxon set …

Here we show that, given a set of clusters C on a set of taxa X, where |X|=n, it is possible to determine in time f(k).poly(n) whether there exists a…

In this paper we develop an LM test for Granger causality in high-dimensional VAR models based on penalized least squares estimations. To obtain a te…

Deep reinforcement learning has learned to play many games well, but failed on others. To better characterize the modes and reasons of failure of dee…

The following questions remain open.

We study a nonatomic routing game on a parallel link network in which link owners set tolls for travel so as to maximize profit. A central authority …

Phylogenetic trees are used to model evolution: leaves are labelled to represent contemporary species ("taxa") and interior vertices represent extinc…

Projection-free optimization via different variants of the Frank-Wolfe (FW) method has become one of the cornerstones in optimization for machine lea…

Multilingual neural machine translation has shown the capability of directly translating between language pairs unseen in training, i.e. zero-shot tr…

There are many interesting points for future research. First, we have been very agnostic towards the data generating process of the game problem. With an eye towards simulation based solution techniques, it is important to study time-varying games g…

In this paper, we examine the long-term behavior of regret-minimizing agents in time-varying games with continuous action spaces. In its most basic f…

[Proof of Proposition 3.1.1] We start by remarking that positive elements on a C⋆ algebra form a closed convex cone {a⋆a:a∈C⋆}(see e.g. Conway, 1990). Since elements of L(H)+ have a positive square root, L(H)+ forms a pointed convex cone in the Bana…

In this article, we prove Herglotz's theorem for Hilbert-valued time series. This requires the notion of an operator-valued measure, which we shall m…

Monte Carlo Tree Search (MCTS) has improved the performance of game engines in domains such as Go, Hex, and general game playing. MCTS has been shown…

By signing up you accept our content policy

Already have an account? Sign in

No a member yet? Create an account