1410 search results - page 54 / 282 » The Algorithmics of Solitaire-Like Games |
155
click to vote
ATAL
2011
Springer
14 years 3 months ago
2011
Springer
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
120
click to vote
ALT
2008
Springer
16 years 1 days ago
2008
Springer
Abstract. Classical probability theory considers probability distributions that assign probabilities to all events (at least in the finite case). However, there are natural situat...
122
click to vote
BIRTHDAY
2009
Springer
15 years 10 months ago
2009
Springer
We introduce a new class of games, asynchronous congestion games (ACGs). In an ACG, each player has a task that can be carried out by any element of a set of resources, and each r...
111
click to vote
ACG
2006
Springer
15 years 9 months ago
2006
Springer
Most game programs have a large number of parameters that are crucial for their performance. Tuning these parameters by hand is rather difficult. Therefore automatic optimization a...
122
click to vote
SIGCSE
2002
ACM
15 years 2 months ago
2002
ACM
Designing a two-person game involves identifying the game model to compute the best moves, the user interface (the "view") to play the game, and the controller to coordi...