1410 search results - page 56 / 282 » The Algorithmics of Solitaire-Like Games |
111
click to vote
COCO
2005
Springer
15 years 8 months ago
2005
Springer
We show that the Multicut, Sparsest-Cut, and Min-2CNF≡ Deletion problems are NP-hard to approximate within every constant factor, assuming the Unique Games Conjecture of Khot [S...
AAAI
2004
15 years 4 months ago
2004
We present two simple search methods for computing a sample Nash equilibrium in a normal-form game: one for 2player games and one for n-player games. We test these algorithms on m...
125
click to vote
TACAS
2009
Springer
15 years 10 months ago
2009
Springer
CEDAR (Counter Example Driven Antichain Refinement) is a new symbolic algorithm for computing weakest strategies for safety games of imperfect information. The algorithm computes ...
132
click to vote
AAAI
2008
15 years 5 months ago
2008
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the adversary/follower) before the advers...
132
click to vote
ATAL
2007
Springer
15 years 9 months ago
2007
Springer
Regret based algorithms have been proposed to control a wide variety of multi-agent systems. The appeal of regretbased algorithms is that (1) these algorithms are easily implement...