Sciweavers

25 search results - page 3 / 5
» Taking turns in general sum Markov games
Sort
View
GECCO
2006
Springer
123views Optimization» more  GECCO 2006»
13 years 9 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...
FUIN
2007
108views more  FUIN 2007»
13 years 5 months ago
An Axiomatization of the Token Game Based on Petri Algebras
The firing rule of Petri nets relies on a residuation operation for the commutative monoid of natural numbers. We identify a class of residuated commutative monoids, called Petri ...
Eric Badouel, Jules Chenou, Goulven Guillou
FOCS
2007
IEEE
13 years 12 months ago
On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
Kousha Etessami, Mihalis Yannakakis
SIAMDM
2010
167views more  SIAMDM 2010»
13 years 9 days ago
Domination Game and an Imagination Strategy
The domination game played on a graph G consists of two players, Dominator and Staller who alternate taking turns choosing a vertex from G such that whenever a vertex is chosen by...
Bostjan Bresar, Sandi Klavzar, Douglas F. Rall
SIGMETRICS
2010
ACM
208views Hardware» more  SIGMETRICS 2010»
13 years 10 months ago
Dynamics in congestion games
Game theoretic modeling and equilibrium analysis of congestion games have provided insights in the performance of Internet congestion control, road transportation networks, etc. D...
Devavrat Shah, Jinwoo Shin