1410 search results - page 97 / 282 » The Algorithmics of Solitaire-Like Games |
JMLR
2010
14 years 6 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
134
click to vote
STOC
1994
ACM
15 years 3 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
127
Voted
WAW
2010
Springer
14 years 9 months ago
2010
Springer
We study the effect of information overload on user engagement in an asymmetric social network like Twitter. We introduce simple game-theoretic models that capture rate competition...
GAMEON
2007
15 years 23 days ago
2007
Nowadays it is not uncommon for computer games to be used as tools to help introduce basic computer science concepts. In this paper we argue that games could also be used in more ...
MOBIHOC
2008
ACM
15 years 11 months ago
2008
ACM
Channel allocation was extensively investigated in the framework of cellular networks, but it was rarely studied in the wireless ad-hoc networks, especially in the multi-hop ad-ho...