Search
Skip to Search Results
Filter
Departments
Item type
Languages
Collections
Supervisors
- 21Bowling, Michael (Computing Science)
- 14Schuurmans, Dale (Computing Science)
- 5Szepesvari, Csaba (Computing Science)
- 2Greiner, Russell (Computing Science)
- 1Bellemare, Marc (Google Brain)
- 1Bowling, Mike (Computing Science)
Author / Creator / Contributor
Subject / Keyword
- 9Reinforcement Learning
- 6Artificial Intelligence
- 6Machine Learning
- 6Machine learning
- 3Game Theory
- 2Abstractions
Year
-
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...
31 - 32 of 32