148 search results - page 13 / 30 » The Contribution of Game Theory to Complex Systems |
FSTTCS
2007
Springer
14 years 1 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
SIGECOM
2009
ACM
14 years 2 months ago
2009
ACM
We consider the issue of representing coalitional games in multiagent systems with externalities (i.e., in systems where the performance of one coalition may be affected by other ...
ATAL
2009
Springer
13 years 5 months ago
2009
Springer
Today's society is largely connected and many real life applications lend themselves to be modeled as multi-agent systems. Although such systems as well as their models are d...
ATVA
2006
Springer
13 years 11 months ago
2006
Springer
Motivated by recent applications of pushdown systems to computer security problems, we present an efficient algorithm for the reachability problem of alternating pushdown systems. ...
POPL
2009
ACM
14 years 8 months ago
2009
ACM
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...