Search
Skip to Search Results- 8Game Theory
- 5Artificial Intelligence
- 2Abstractions
- 2Computer Poker
- 2Nash Equilibrium
- 2Online Learning
- 6Graduate and Postdoctoral Studies (GPS), Faculty of
- 6Graduate and Postdoctoral Studies (GPS), Faculty of/Theses and Dissertations
- 1Digital Humanities Program
- 1Digital Humanities Program/Journal Articles (Digital Humanities)
- 1Computing Science, Department of
- 1Computing Science, Department of/Technical Reports (Computing Science)
-
Fall 2014
An agent in an adversarial, imperfect information environment must sometimes decide whether or not to take an action and, if they take the action, must choose a parameter value associated with that action. Examples include choosing to buy or sell some amount of resources or choosing whether or...
-
2012
Lanctot, Marc, Gibson, Richard, Burch, Neil, Szafron, Duane
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. While the base algorithm performs a full tree traversal on each iteration, Monte Carlo CFR (MCCFR) reduces the per...
-
Fall 2020
Communication is essential for coordination among humans and animals. Therefore, with the introduction of intelligent agents into the world, agent-to-agent and agent-to-human communication become necessary. Ideally, these agents should be trained in an incremental and decentralized manner. In...
-
Fall 2020
Computing a Nash equilibrium in zero-sum games, or more generally saddle point optimization, is a fundamental problem in game theory and machine learning, with applications spanning across a wide variety of domains, from generative modeling and computer vision to super-human AI in imperfect...
-
Spring 2016
Games have been used as a testbed for artificial intelligence research since the earliest conceptions of computing itself. The twin goals of defeating human professional players at games, and of solving games outright by creating an optimal computer agent, have helped to drive practical ...
-
2003
Games are used to teach the humanities not for research. We are not even comfortable studying games seriously, let alone proposing that games could be a form of research. It is only recently that computer games have become the subject of serious humanities inquiry. At the same time there is a...
-
Spring 2016
Game theoretic solution concepts, such as Nash equilibrium strategies that are optimal against worst case opponents, provide guidance in finding desirable autonomous agent behaviour. In particular, we wish to approximate solutions to complex, dynamic tasks, such as negotiation or bidding in...
-
Fall 2015
Extensive-form games are a powerful framework for modeling sequential multi-agent interactions. In extensive-form games with imperfect information, Nash equilibria are generally used as a solution concept, but computing a Nash equilibrium can be intractable in large games. Instead, a variety of...