Sciweavers

344 search results - page 27 / 69
» Banach-Mazur Games on Graphs
Sort
View
CEC
2008
IEEE
14 years 3 months ago
Path optimization for multiple objectives in directed graphs using genetic algorithms
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...
Juan Rada, Ruben Parma, Wilmer Pereira
COCOON
2003
Springer
14 years 1 months ago
Finding Hidden Independent Sets in Interval Graphs
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...
Therese C. Biedl, Brona Brejová, Erik D. De...
WOLLIC
2007
Springer
14 years 2 months ago
Hydra Games and Tree Ordinals
Hydra games were introduced by Kirby and Paris, for the formulation of a result which is independent from Peano arithmetic but depends on the transfinite structure of 0. Tree ordi...
Ariya Isihara
FMCO
2004
Springer
14 years 2 months ago
Games with Secure Equilibria
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 ...
Krishnendu Chatterjee, Thomas A. Henzinger, Marcin...
JCP
2007
118views more  JCP 2007»
13 years 8 months ago
Tutoring an Entire Game with Dynamic Strategy Graphs: The Mixed-Initiative Sudoku Tutor
Abstract— In this paper, we develop a mixed-initiative intelligent tutor for the game of Sudoku called MITS. We begin by developing a characterization of the strategies used in S...
Allan Caine, Robin Cohen