Sciweavers

601 search results - page 34 / 121
» Playing large games using simple strategies
Sort
View
ATAL
2006
Springer
15 years 5 months ago
A novel method for automatic strategy acquisition in N-player non-zero-sum games
We present a novel method for automatically acquiring strategies for the double auction by combining evolutionary optimization together with a principled game-theoretic analysis. ...
Steve Phelps, Marek Marcinkiewicz, Simon Parsons
ALDT
2011
Springer
251views Algorithms» more  ALDT 2011»
14 years 1 months ago
Game Theory and Human Behavior: Challenges in Security and Sustainability
Security and sustainability are two critical global challenges that involve the interaction of many intelligent actors. Game theory provides a sound mathematical framework to model...
Rong Yang, Milind Tambe, Manish Jain, Jun-young Kw...
ISPDC
2008
IEEE
15 years 7 months ago
Computing Equilibria in Bimatrix Games by Parallel Support Enumeration
We consider the problem of computing all Nash equilibria in bimatrix games (i.e., nonzero-sum two-player noncooperative games). Computing all Nash equilibria for large bimatrix ga...
Jonathan Widger, Daniel Grosu
CEC
2010
IEEE
15 years 1 months ago
Coevolutionary Temporal Difference Learning for small-board Go
—In this paper we apply Coevolutionary Temporal Difference Learning (CTDL), a hybrid of coevolutionary search and reinforcement learning proposed in our former study, to evolve s...
Krzysztof Krawiec, Marcin Szubert
COLT
2010
Springer
14 years 11 months ago
Convex Games in Banach Spaces
We study the regret of an online learner playing a multi-round game in a Banach space B against an adversary that plays a convex function at each round. We characterize the minima...
Karthik Sridharan, Ambuj Tewari