144 search results - page 25 / 29 » Computing Nash Equilibria of Action-Graph Games |
108
Voted
ATAL
2004
Springer
15 years 7 months ago
2004
Springer
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...
CG
2010
Springer
14 years 12 months ago
2010
Springer
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...
114
click to vote
BIRTHDAY
2009
Springer
15 years 8 months ago
2009
Springer
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...
143
Voted
GAMESEC
2010
14 years 12 months ago
2010
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...
117
Voted
GAMESEC
2010
14 years 12 months ago
2010
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...