1884 search results - page 44 / 377 » Simple Algorithm for Simple Timed Games |
AAAI
1998
14 years 11 months ago
1998
Weexaminethree heuristic algorithms for gameswith imperfect information: Monte-carlo sampling, and two newalgorithms wecall vector minimaxingand payoffreduction minimaxing. Wecomp...
DIS
2009
Springer
14 years 7 months ago
2009
Springer
In this paper we aim at automatically adjusting the difficulty of computer games by clustering players into different types and supervised prediction of the type from short traces ...
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
— Bargaining games on exchange networks have been studied by both economists and sociologists. A Balanced Outcome [9], [15] for such a game is an equilibrium concept that combine...
113
click to vote
CORR
2011
Springer
14 years 1 months ago
2011
Springer
Logit Dynamics [Blume, Games and Economic Behavior, 1993] is a randomized best response dynamics for strategic games: at every time step a player is selected uniformly at random a...
TCS
2008
14 years 10 months ago
2008
We investigate the role of the information available to the players on the outcome of the cops and robbers game. This game takes place on a graph and players move along the edges ...