Representations and solutions for game-theoretic problems
Artificial Intelligence - Special issue on economic principles of multi-agent systems
Gambling in a rigged casino: The adversarial multi-armed bandit problem
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Approximating game-theoretic optimal strategies for full-scale poker
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Game-Tree search with adaptation in stochastic imperfect-information games
CG'04 Proceedings of the 4th international conference on Computers and Games
Maximizing classifier utility when training data is costly
ACM SIGKDD Explorations Newsletter
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Maximizing classifier utility when there are data acquisition and modeling costs
Data Mining and Knowledge Discovery
Effective short-term opponent exploitation in simplified poker
Machine Learning
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Particle filtering for dynamic agent modelling in simplified poker
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
A Monte-Carlo AIXI approximation
Journal of Artificial Intelligence Research
Game theory-based opponent modeling in large imperfect-information games
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Computing approximate Nash Equilibria and robust best-responses using sampling
Journal of Artificial Intelligence Research
Proceedings of the 13th ACM Conference on Electronic Commerce
A parameterized family of equilibrium profiles for three-player kuhn poker
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Online implicit agent modelling
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Hi-index | 0.00 |
We define a generalized strategy eliminability criterion for bimatrix games that considers whether a given strategy is eliminable relative to given dominator & eliminee subsets of the players' strategies. We show that this definition spans a spectrum ...