Sciweavers

2025 search results - page 178 / 405
» Theory as Game: Designing the Game Game
Sort
View
ICML
2004
IEEE
16 years 7 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
ISIPTA
2003
IEEE
125views Mathematics» more  ISIPTA 2003»
15 years 11 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 10 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 10 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...
FORMATS
2008
Springer
15 years 8 months ago
Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets
Abstract. We introduce and study hybrid automata with strong resets. They generalize o-minimal hybrid automata, a class of hybrid automata which allows modeling of complex continuo...
Patricia Bouyer, Thomas Brihaye, Marcin Jurdzinski...