787 search results - page 114 / 158 » Polynomial Constants are Decidable |
ATAL
2010
Springer
13 years 10 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...
AI
2007
Springer
13 years 9 months ago
2007
Springer
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
This paper studies the effects of introducing altruistic agents into atomic congestion games. Altruistic behavior is modeled by a trade-off between selfish and social objectives. ...
IWPEC
2009
Springer
14 years 4 months ago
2009
Springer
An induced matching in graph G is a matching which is an induced subgraph of G. Clearly, among two vertices with the same neighborhood (called twins) at most one is matched in any...
TACAS
2007
Springer
14 years 3 months ago
2007
Springer
We study and provide efficient algorithms for multi-objective model checking problems for Markov Decision Processes (MDPs). Given an MDP, M, and given multiple linear-time (ω-regu...