Search
Skip to Search Results- 85Artificial Intelligence
- 22Machine Learning
- 21Game theory
- 10Computer Games
- 10Reinforcement Learning
- 8Planning
- 4Müller, Martin
- 3Bowling, Michael
- 3Johanson, Michael
- 3Lanctot, Marc
- 3Mueller, Martin
- 3Zinkevich, Martin
- 65Graduate and Postdoctoral Studies (GPS), Faculty of
- 65Graduate and Postdoctoral Studies (GPS), Faculty of/Theses and Dissertations
- 21Computing Science, Department of
- 21Computing Science, Department of/Technical Reports (Computing Science)
- 4Toolkit for Grant Success
- 4WISEST Summer Research Program
-
Fall 2015
Artificial Intelligence (AI) techniques have been widely used in video games to control non-playable characters. More recently, AI has been applied to automated story generation with the objective of managing the player’s experience in an interactive narrative. Such AI experience managers can...
-
Fall 2020
Word sense disambiguation (WSD) is one of the core tasks in natural language processing and its objective is to identify the sense of a content word (nouns, verbs, adjectives, and adverbs) in context, given a predefined sense inventory. Although WSD is a monolingual task, it has been conjectured...
-
Spring 2023
With machine learning models becoming more complicated and more widely applied to solve real-world challenges, there comes the need to explain their reasoning. In parallel with the advancements of deep learning methods, Explainable AI (XAI) algorithms have been proposed to address the issue of...
-
1992
Technical report TR92-19. In August 1992, the first man versus machine world championship took place. The champion, Dr. Marion Tinsley, is arguably the greatest checkers player that ever lived. The challenger was the computer checkers program Chinook, a 3 year team effort from the University of...
-
2013
In the field of computational game theory, games are often compared in terms of their size. This can be measured in several ways, including the number of unique game states, the number of decision points, and the total number of legal actions over all decision points. These numbers are either...
-
2013-02-26
In the field of computational game theory, games are often compared in terms of their size. This can be measured in several ways, including the number of unique game states, the number of decision points, and the total number of legal actions over all decision points. These numbers are either...
-
Modelling phytoplankton across many scales: transient dynamics, human interactions, and niche differentiation in the light spectrum
DownloadFall 2021
In recent decades freshwater lakes have seen an increase in human presence. A common byproduct of this human presence is anthropogenic nutrient pollution resulting in eutrophication, a term that is becoming all too synonymous with harmful algal blooms. It is well known that phytoplankton...
-
Monte Carlo Sampling and Regret Minimization for Equilibrium Computation and Decision-Making in Large Extensive Form Games
DownloadSpring 2013
In this thesis, we investigate the problem of decision-making in large two-player zero-sum games using Monte Carlo sampling and regret minimization methods. We demonstrate four major contributions. The first is Monte Carlo Counterfactual Regret Minimization (MCCFR): a generic family of...
-
2009
Bowling, Michael, Zinkevich, Martin, Waugh, Kevin, Lanctot, Marc
Technical report TR09-15. Sequential decision-making with multiple agents and imperfect information is commonly modeled as an extensive game. One efficient method for computing Nash equilibria in large, zero-sum, imperfect information games is counterfactual regret minimization (CFR). In the...