Sciweavers

73 search results - page 12 / 15
» Algorithms for Interdependent Security Games
Sort
View
IJWIS
2007
153views more  IJWIS 2007»
14 years 10 months ago
A security framework for agent-based systems
Purpose – This paper aims to address some security issues in open systems such as service-oriented applications and grid computing. It proposes a security framework for these sy...
Jamal Bentahar, Francesca Toni, John-Jules Ch. Mey...
JSAC
2007
189views more  JSAC 2007»
14 years 10 months ago
Non-Cooperative Power Control for Wireless Ad Hoc Networks with Repeated Games
— One of the distinctive features in a wireless ad hoc network is lack of any central controller or single point of authority, in which each node/link then makes its own decision...
Chengnian Long, Qian Zhang, Bo Li, Huilong Yang, X...
NOSSDAV
2004
Springer
15 years 3 months ago
Low latency and cheat-proof event ordering for peer-to-peer games
We are developing a distributed architecture for massivelymultiplayer games. In this paper, we focus on designing a low-latency event ordering protocol, called NEO, for this archi...
Chris GauthierDickey, Daniel Zappala, Virginia Mar...
117
Voted
WS
2005
ACM
15 years 3 months ago
Fully self-organized peer-to-peer key management for mobile ad hoc networks
Mobile ad hoc networks (MANETs) offer communication over a shared wireless channel without any pre-existing infrastructure. Forming peer-to-peer security associations in MANETs i...
Johann van der Merwe, Dawoud S. Dawoud, Stephen Mc...
ATAL
2010
Springer
14 years 11 months ago
Path disruption games
We propose Path Disruption Games (PDGs), which consider collaboration between agents attempting stop an adversary from travelling from a source node to a target node in a graph. P...
Yoram Bachrach, Ely Porat