159 search results - page 21 / 32 » Computational Complexity of Fundamental Problems in Social C... |
COCO
2010
Springer
15 years 3 months ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
110
click to vote
MICAI
2005
Springer
15 years 5 months ago
2005
Springer
In Multi-agent based simulation (MABS) systems, computational models are built as multi-agent systems (MAS). Replication of these models can contribute to improve the reliability o...
ATAL
2007
Springer
15 years 6 months ago
2007
Springer
In an election held in a noisy environment, agents may unintentionally perturb the outcome by communicating faulty preferences. We investigate this setting by introducing a theore...
SIGECOM
2005
ACM
15 years 5 months ago
2005
ACM
We study a multi-unit auction with multiple bidders, each of whom has a private valuation and a budget. The truthful mechanisms of such an auction are characterized, in the sense ...
102
click to vote
SCA
2007
15 years 2 months ago
2007
We introduce a framework for advanced behavioral animation in virtual humans, which addresses the challenging open problem of simulating social interactions between pedestrians in...