Sciweavers

1683 search results - page 139 / 337
» Game Theory Basics
Sort
View
ICML
2004
IEEE
16 years 5 months ago
Communication complexity as a lower bound for learning in games
A fast-growing body of research in the AI and machine learning communities addresses learning in games, where there are multiple learners with different interests. This research a...
Vincent Conitzer, Tuomas Sandholm
VALUETOOLS
2006
ACM
176views Hardware» more  VALUETOOLS 2006»
15 years 10 months ago
How to solve large scale deterministic games with mean payoff by policy iteration
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
Vishesh Dhingra, Stephane Gaubert
ISIPTA
2003
IEEE
125views Mathematics» more  ISIPTA 2003»
15 years 9 months ago
Game-Theoretic Learning Using the Imprecise Dirichlet Model
We discuss two approaches for choosing a strategy in a two-player game. We suppose that the game is played a large number of rounds, which allows the players to use observations o...
Erik Quaeghebeur, Gert de Cooman
GECCO
2006
Springer
123views Optimization» more  GECCO 2006»
15 years 8 months ago
The parallel Nash Memory for asymmetric games
Coevolutionary algorithms search for test cases as part of the search process. The resulting adaptive evaluation function takes away the need to define a fixed evaluation function...
Frans A. Oliehoek, Edwin D. de Jong, Nikos A. Vlas...
LICS
1997
IEEE
15 years 8 months ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...