1410 search results - page 165 / 282 » The Algorithmics of Solitaire-Like Games |
117
click to vote
ATAL
2008
Springer
15 years 1 months ago
2008
Springer
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...
126
click to vote
CORR
2010
Springer
14 years 12 months ago
2010
Springer
Abstract--Collaborative Spectrum Sensing (CSS) between secondary users (SUs) in cognitive networks exhibits an inherent tradeoff between minimizing the probability of missing the d...
ATAL
2006
Springer
15 years 3 months ago
2006
Springer
We present an OBDD-based methodology for verifying time, knowledge, and strategies in multi-agent systems specified by the formalism of interpreted systems. To this end, we invest...
ESA
2009
Springer
15 years 6 months ago
2009
Springer
We study a special class of binary trees. Our results have implications on Maker/Breaker games and SAT: We disprove a conjecture of Beck on positional games and construct an unsati...
120
click to vote
APPROX
2011
Springer
13 years 11 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...