Nothing Special   »   [go: up one dir, main page]

Lanctot, 2013 - Google Patents

Monte Carlo sampling and regret minimization for equilibrium computation and decision-making in large extensive form games

Lanctot, 2013

View PDF
Document ID
7920299906710639627
Author
Lanctot M
Publication year

External Links

Snippet

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 (MC-CFR) …
Continue reading at era.library.ualberta.ca (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computer systems based on biological models
    • G06N3/12—Computer systems based on biological models using genetic models
    • G06N3/126—Genetic algorithms, i.e. information processing using digital simulations of the genetic system
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computer systems utilising knowledge based models
    • G06N5/04—Inference methods or devices
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computer systems based on biological models
    • G06N3/02—Computer systems based on biological models using neural network models

Similar Documents

Publication Publication Date Title
Lanctot Monte Carlo sampling and regret minimization for equilibrium computation and decision-making in large extensive form games
Holcomb et al. Overview on deepmind and its alphago zero ai
Bošanský et al. Algorithms for computing strategies in two-player simultaneous move games
Mandziuk Knowledge-free and learning-based methods in intelligent game playing
Perick et al. Comparison of different selection strategies in monte-carlo tree search for the game of tron
Lanctot et al. Monte Carlo tree search in simultaneous move games with applications to Goofspiel
Brown et al. Strategy-based warm starting for regret minimization in games
Whitehouse Monte Carlo tree search for games with hidden information and uncertainty
Ponsen et al. An evolutionary game-theoretic analysis of poker strategies
Johanson Robust strategies and counter-strategies: from superhuman to optimal play
Schmid Search in imperfect information games
Mańdziuk Computational intelligence in mind games
Lanctot et al. Search in imperfect information games using online monte carlo counterfactual regret minimization
Dobre et al. Online learning and mining human play in complex games
Bitan et al. Combining prediction of human decisions with ISMCTS in imperfect information games
Bailis et al. Learning to play monopoly: A reinforcement learning approach
Wang et al. Belief-state monte Carlo tree search for phantom go
Lin et al. Multi-agent inverse reinforcement learning for general-sum stochastic games
Kira et al. A dynamic programming algorithm for optimizing baseball strategies
Cao et al. UCT-ADP Progressive Bias Algorithm for Solving Gomoku
Li et al. D2CFR: Minimize counterfactual regret with deep dueling neural network
Zhang et al. A Survey on Self-play Methods in Reinforcement Learning
Levinson et al. Adaptive-predictive game-playing programs
Liu et al. Soft-actor-attention-critic based on unknown agent action prediction for multi-agent collaborative confrontation
Schmid Game theory and poker