63 search results - page 12 / 13 » The computational complexity of nash equilibria in concisely... |
ICDCS
2010
IEEE
13 years 10 months ago
2010
IEEE
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...
WIOPT
2010
IEEE
13 years 4 months ago
2010
IEEE
—Cognitive radio networks provide the capability to share the wireless channel with licensed (primary) users in an opportunistic manner. Primary users have a license to operate i...
SIGECOM
2005
ACM
13 years 11 months ago
2005
ACM
We present a new approach to representing coalitional games based on rules that describe the marginal contributions of the agents. This representation scheme captures characterist...
AMAI
2004
Springer
13 years 11 months ago
2004
Springer
This paper extends the framework of partially observable Markov decision processes (POMDPs) to multi-agent settings by incorporating the notion of agent models into the state spac...
ATAL
2007
Springer
14 years 12 days ago
2007
Springer
We develop a model of normative systems in which agents are assumed to have multiple goals of increasing priority, and investigate the computational complexity and game theoretic ...