Sciweavers

1698 search results - page 210 / 340
» Growing Complex Games
Sort
View
DAM
2007
107views more  DAM 2007»
14 years 10 months ago
Eliminating graphs by means of parallel knock-out schemes
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...
WSDM
2012
ACM
283views Data Mining» more  WSDM 2012»
13 years 5 months ago
The life and death of online groups: predicting group growth and longevity
We pose a fundamental question in understanding how to identify and design successful communities: What factors predict whether a community will grow and survive in the long term?...
Sanjay Ram Kairam, Dan J. Wang, Jure Leskovec
ATAL
2007
Springer
15 years 4 months ago
Advice taking in multiagent reinforcement learning
This paper proposes the β-WoLF algorithm for multiagent reinforcement learning (MARL) in the stochastic games framework that uses an additional “advice” signal to inform agen...
Michael Rovatsos, Alexandros Belesiotis
FOCS
2006
IEEE
15 years 4 months ago
Strategic Network Formation through Peering and Service Agreements
We introduce a game theoretic model of network formation in an effort to understand the complex system of business relationships between various Internet entities (e.g., Autonomou...
Elliot Anshelevich, F. Bruce Shepherd, Gordon T. W...
NETGAMES
2006
ACM
15 years 3 months ago
Applicability of group communication for increased scalability in MMOGs
Massive multiplayer online games (MMOGs) are today the driving factor for the development of distributed interactive applications, and they are increasing in size and complexity. ...
Knut-Helge Vik, Carsten Griwodz, Pål Halvors...