Sciweavers

128 search results - page 13 / 26
» Computing optimal strategies to commit to in extensive-form ...
Sort
View
TON
2002
75views more  TON 2002»
14 years 9 months ago
Optimal retrial and timeout strategies for accessing network resources
The notion of timeout (namely, the maximal time to wait before retrying an action) turns up in many networking contexts, such as packet transmission, connection establishment, etc....
Lavy Libman, Ariel Orda
102
Voted
ATAL
2008
Springer
14 years 11 months ago
Solving two-person zero-sum repeated games of incomplete information
In repeated games with incomplete information, rational agents must carefully weigh the tradeoffs of advantageously exploiting their information to achieve a short-term gain versu...
Andrew Gilpin, Tuomas Sandholm
TCS
2010
14 years 8 months ago
Analyzing the dynamics of stigmergetic interactions through pheromone games
The concept of stigmergy provides a simple framework for interaction and coordination in multi-agent systems. However, determining the global system behavior that will arise from ...
Peter Vrancx, Katja Verbeeck, Ann Nowé
68
Voted
CORR
2010
Springer
79views Education» more  CORR 2010»
14 years 9 months ago
Quantitative Games on Probabilistic Timed Automata
Abstract. Two-player zero-sum games are a well-established model for synthesising controllers that optimise some performance criterion. In such games one player represents the cont...
Marta Z. Kwiatkowska, Gethin Norman, Ashutosh Triv...
MFCS
2004
Springer
15 years 3 months ago
When Can You Play Positionally?
We consider infinite antagonistic games over finite graphs. We present conditions that, whenever satisfied by the payoff mapping, assure for both players positional (memoryless...
Hugo Gimbert, Wieslaw Zielonka