Sciweavers

4435 search results - page 89 / 887
» Algorithms, games, and the internet
Sort
View
SAGT
2010
Springer
202views Game Theory» more  SAGT 2010»
14 years 8 months ago
Computing Stable Outcomes in Hedonic Games
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...
Martin Gairing, Rahul Savani
EVOW
2011
Springer
14 years 1 months ago
Towards Procedural Strategy Game Generation: Evolving Complementary Unit Types
The Strategy Game Description Game Language (SGDL) is intended to become a complete description of all aspects of strategy games, including rules, parameters, scenarios, maps, and ...
Tobias Mahlmann, Julian Togelius, Georgios N. Yann...
AAAI
2012
13 years 21 days ago
Computing Optimal Strategies to Commit to in Stochastic Games
Significant progress has been made recently in the following two lines of research in the intersection of AI and game theory: (1) the computation of optimal strategies to commit ...
Joshua Letchford, Liam MacDermed, Vincent Conitzer...
AI
2004
Springer
14 years 10 months ago
Efficient learning equilibrium
Efficient Learning Equilibrium (ELE) is a natural solution concept for multi-agent encounters with incomplete information. It requires the learning algorithms themselves to be in ...
Ronen I. Brafman, Moshe Tennenholtz
RAID
2010
Springer
14 years 8 months ago
Behavior-Based Worm Detectors Compared
Abstract. Many worm detectors have been proposed and are being deployed, but the literature does not clearly indicate which one is the best. New worms such as IKEE.B (also known as...
Shad Stafford, Jun Li