Sciweavers

3274 search results - page 171 / 655
» Communication strategies in games
Sort
View
TON
2002
75views more  TON 2002»
15 years 6 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
COCOA
2009
Springer
16 years 1 months ago
Improved Bounds for Facility Location Games with Fair Cost Allocation
Abstract. We study Facility Location games played by n agents situated on the nodes of a graph. Each agent orders installation of a facility at a node of the graph and pays connect...
Thomas Dueholm Hansen, Orestis Telelis
QEST
2008
IEEE
16 years 28 days ago
Hintikka Games for PCTL on Labeled Markov Chains
We present Hintikka games for formulae of the probabilistic temporal logic PCTL and countable labeled Markov chains as models, giving an operational account of the denotational se...
Harald Fecher, Michael Huth, Nir Piterman, Daniel ...
IJCAI
2007
15 years 8 months ago
Reinforcement Learning of Local Shape in the Game of Go
We explore an application to the game of Go of a reinforcement learning approach based on a linear evaluation function and large numbers of binary features. This strategy has prov...
David Silver, Richard S. Sutton, Martin Mülle...
CORR
2010
Springer
76views Education» more  CORR 2010»
15 years 6 months ago
An analysis of a war-like card game
In his book "Mathematical Mind-Benders", Peter Winkler poses the following open problem, originally due to the first author: "[In the game Peer Pressure,] two player...
Boris Alexeev, Jacob Tsimerman