159 search results - page 16 / 32 » Computational Complexity of Fundamental Problems in Social C... |
117
click to vote
GECCO
2005
Springer
15 years 5 months ago
2005
Springer
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...
134
click to vote
WWW
2011
ACM
14 years 6 months ago
2011
ACM
Online social networks have become very popular in recent years and their number of users is already measured in many hundreds of millions. For various commercial and sociological...
MOBIHOC
2009
ACM
16 years 10 days ago
2009
ACM
Distributed scheduling algorithms for wireless ad hoc networks have received substantial attention over the last decade. The complexity levels of these algorithms span a wide spec...
SIGECOM
2006
ACM
15 years 5 months ago
2006
ACM
In multiagent systems, strategic settings are often analyzed under the assumption that the players choose their strategies simultaneously. However, this model is not always realis...
KDD
2003
ACM
16 years 6 days ago
2003
ACM
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...