Search
Skip to Search Results- 8Game theory
- 3Machine learning
- 3Regret minimization
- 2Poker
- 1Artificial intelligence
- 1Combinatorial optimization
- 1Ajallooeian, Mohammad Mahdi
- 1Burch, Neil
- 1Gibson, Richard G
- 1Kishimoto, Akihiro.
- 1Lanctot, Marc
- 1MacQueen, Revan
-
Fall 2023
Self-play is a technique for machine learning in multi-agent systems where a learning algorithm learns by interacting with copies of itself. Self-play is useful for generating large quantities of data for learning, but has the drawback that agents the learner will face post-training may have...
-
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...
-
Optimal Mechanisms for Machine Learning: A Game-Theoretic Approach to Designing Machine Learning Competitions
DownloadSpring 2013
In this thesis we consider problems where a self-interested entity, called the principal, has private access to some data that she wishes to use to solve a prediction problem by outsourcing the development of the predictor to some other parties. Assuming the principal, who needs the machine...
-
Regret Minimization in Games and the Development of Champion Multiplayer Computer Poker-Playing Agents
DownloadSpring 2014
Recently, poker has emerged as a popular domain for investigating decision problems under conditions of uncertainty. Unlike traditional games such as checkers and chess, poker exhibits imperfect information, varying utilities, and stochastic events. Because of these complications, decisions at...
-
Spring 2018
Decision-making problems with two agents can be modeled as two player games, and a Nash equilibrium is the basic solution concept describing good play in adversarial games. Computing this equilibrium solution for imperfect information games, where players have private, hidden information, is...