26071 search results - page 4806 / 5215 » Making |
220
Voted
ATAL
2010
Springer
15 years 8 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
233
click to vote
ATAL
2010
Springer
15 years 8 months ago
2010
Springer
We propose Path Disruption Games (PDGs), which consider collaboration between agents attempting stop an adversary from travelling from a source node to a target node in a graph. P...
182
Voted
ATAL
2010
Springer
15 years 8 months ago
2010
Springer
Service-oriented systems are becoming more and more nodes in a digital, dynamic ecosystem requiring the identification and establishment of flexible, spontaneous collaboration act...
186
Voted
ATAL
2010
Springer
15 years 8 months ago
2010
Springer
Bayesian games can be used to model single-shot decision problems in which agents only possess incomplete information about other agents, and hence are important for multiagent co...
199
click to vote
BIRTHDAY
2010
Springer
15 years 8 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...