A Bayesian approach to relevance in game playing
From MaRDI portal
Publication:1127355
Recommendations
- The Bayesian search game
- Bayesian learning in repeated games
- scientific article; zbMATH DE number 1189219
- Bayesian exploration: incentivizing exploration in Bayesian games
- Bayesian learning in repeated games of incomplete information
- The possibility of Bayesian learning in repeated games
- Bayesian learning in repeated normal form games
- A Bayesian hierarchical model for inferring player strategy types in a number guessing game
- Non-parametric Bayesian inference of strategies in repeated games
Cites work
- scientific article; zbMATH DE number 3936534 (Why is no real title available?)
- scientific article; zbMATH DE number 43243 (Why is no real title available?)
- scientific article; zbMATH DE number 3063363 (Why is no real title available?)
- A pattern classification approach to evaluation function learning
- A world-championship-level Othello program
- Best-first minimax search
- Conspiracy numbers for min-max search
- Expected time bounds for selection
- Experiments With Some Programs That Search Game Trees
- Game tree searching by min/max approximation
- Monte-Carlo approximation algorithms for enumeration problems
- On the Regularity of a General Method of Summation
- Pathology on game trees revisited, and an alternative to minimaxing
- The Complexity of Enumeration and Reliability Problems
- Time bounds for selection
Cited in
(19)- Improving best-reply search
- The effect of mobility on minimaxing of game trees with random leaf values
- Unifying single-agent and two-player search
- Cross-layer security design for encrypted CPS based on modified security signalling game
- Analysis of \textsc{Watson's} strategies for playing \textit{Jeopardy!}
- A pattern classification approach to evaluation function learning
- Algorithms – ESA 2004
- Paranoia versus overconfidence in imperfect-information games
- Partial order bounding: A new approach to evaluation in game tree search
- Error propagation in game trees
- Probability-based game tree pruning
- Experimental Analysis of the Probability Method
- On Monte-Carlo tree search for deterministic games with alternate moves and complete information
- Improving heuristic mini-max search by supervised learning
- A Game Tree Search by Probability Method
- A Skat Player Based on Monte-Carlo Simulation
- Qualitative simulation of temporal concurrent processes using time interval Petri nets
- Selecting evaluation functions in opponent-model search
- Bargaining with limited computation: Deliberation equilibrium
This page was built for publication: A Bayesian approach to relevance in game playing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127355)
