Sciweavers

144 search results - page 25 / 29
» Computing Nash Equilibria of Action-Graph Games
Sort
View
ATAL
2004
Springer
14 years 1 months ago
Run the GAMUT: A Comprehensive Approach to Evaluating Game-Theoretic Algorithms
We present GAMUT1 , a suite of game generators designed for testing game-theoretic algorithms. We explain why such a generator is necessary, offer a way of visualizing relationshi...
Eugene Nudelman, Jennifer Wortman, Yoav Shoham, Ke...
CG
2010
Springer
13 years 6 months ago
A Principled Method for Exploiting Opening Books
We used in the past a lot of computational power and human expertise for having a very big dataset of good 9x9 Go games, in order to build an opening book. We improved a lot the al...
Romaric Gaudel, Jean-Baptiste Hoock, Julien Perez,...
BIRTHDAY
2009
Springer
14 years 3 months ago
Asynchronous Congestion Games
We introduce a new class of games, asynchronous congestion games (ACGs). In an ACG, each player has a task that can be carried out by any element of a set of resources, and each r...
Michal Penn, Maria Polukarov, Moshe Tennenholtz
GAMESEC
2010
139views Game Theory» more  GAMESEC 2010»
13 years 6 months ago
Design of Network Topology in an Adversarial Environment
We study the strategic interaction between a network manager whose goal is to choose (as communication infrastructure) a spanning tree of a network given as an undirected graph, an...
Assane Gueye, Jean C. Walrand, Venkat Anantharam
GAMESEC
2010
119views Game Theory» more  GAMESEC 2010»
13 years 6 months ago
Uncertainty in Interdependent Security Games
Abstract. Even the most well-motivated models of information security have application limitations due to the inherent uncertainties involving risk. This paper exemplifies a formal...
Benjamin Johnson, Jens Grossklags, Nicolas Christi...