356 search results - page 43 / 72 » Graph Games on Ordinals |
CEC
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract— This paper presents a genetic algorithmic approach for finding efficient paths in directed graphs when optimizing multiple objectives. Its aim is to provide solutions...
COCOON
2003
Springer
15 years 2 months ago
2003
Springer
We design efficient competitive algorithms for discovering hidden information using few queries. Specifically, consider a game in a given set of intervals (and their implied inte...
CSL
2006
Springer
15 years 1 months ago
2006
Springer
We study observation-based strategies for two-player turn-based games on graphs with omega-regular objectives. An observation-based strategy relies on imperfect information about t...
FMCO
2004
Springer
15 years 3 months ago
2004
Springer
In 2-player non-zero-sum games, Nash equilibria capture the options for rational behavior if each player attempts to maximize her payoff. In contrast to classical game theory, we ...
SIAMCOMP
2008
14 years 9 months ago
2008
We consider a game-theoretical variant of the Steiner forest problem in which each player j, out of a set of k players, strives to connect his terminal pair (sj, tj) of vertices in...