894 search results - page 15 / 179 » Game Theory with Costly Computation |
121
click to vote
MST
2011
14 years 6 months ago
2011
This paper is concerned with the complexity of computing winning strategies for poset games. While it is reasonably clear that such strategies can be computed in PSPACE, we give a ...
111
click to vote
CCS
2009
ACM
15 years 6 months ago
2009
ACM
In mobile networks, authentication is a required primitive of the majority of security protocols. However, an adversary can track the location of mobile nodes by monitoring pseudo...
115
click to vote
HIPC
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. This paper formulates the job allocation problem in distributed systems with bandwidth-constrained nodes. The bandwidth limitations of the nodes play an important role in...
105
Voted
CMSB
2006
Springer
15 years 3 months ago
2006
Springer
We present a game-theoretic foundation for gene regulatory analysis based on the recent formalism of rewriting game theory. Rewriting game theory is discrete and comes with a graph...
ICALP
2009
Springer
15 years 12 months ago
2009
Springer
Abstract. We introduce the notion of regular cost functions: a quantitative extension to the standard theory of regular languages. We provide equivalent characterisations of this n...