Search
Skip to Search Results- 4Nash Equilibrium
- 2Abstractions
- 2Game Theory
- 2Online Learning
- 1Artificial Intelligence
- 1CFR (CounterFactual Regret)
-
Fall 2009
For zero-sum games, we have efficient solution techniques. Unfortunately, there are interesting games that are too large to solve. Here, a popular approach is to solve an abstract game that models the original game. We assume that more accurate the abstract games result in stronger strategies....
-
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 2010
General Game Playing (GGP) deals with the design of players that are able to play any discrete, deterministic, complete information games. For many games like chess, designers develop a player using a specially designed algorithm and tune all the features of the algorithm to play the game as good...
-
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...