Sciweavers

28 search results - page 4 / 6
» Vertex Pursuit Games in Stochastic Network Models
Sort
View
ICASSP
2011
IEEE
12 years 10 months ago
Factor graph-based structural equilibria in dynamical games
Correlated equilibria are a generalization of Nash equilibria that permit agents to act in a correlated manner and can therefore, model learning in games. In this paper we define...
Liming Wang, Vikram Krishnamurthy, Dan Schonfeld
JSAC
2007
139views more  JSAC 2007»
13 years 6 months ago
Reverse-Engineering MAC: A Non-Cooperative Game Model
— This paper reverse-engineers backoff-based random-access MAC protocols in ad-hoc networks. We show that the contention resolution algorithm in such protocols is implicitly part...
Jang-Won Lee, Ao Tang, Jianwei Huang, Mung Chiang,...
ISAAC
2005
Springer
153views Algorithms» more  ISAAC 2005»
14 years 6 days ago
Network Game with Attacker and Protector Entities
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
Marios Mavronicolas, Vicky G. Papadopoulou, Anna P...
TCS
2008
13 years 6 months ago
Cleaning a network with brushes
Following the decontamination metaphor for searching a graph, we introduce a cleaning process, which is related to both the chip-firing game and edge searching. Brushes (instead o...
Margaret-Ellen Messinger, Richard J. Nowakowski, P...
IJNSEC
2007
144views more  IJNSEC 2007»
13 years 6 months ago
IPLess Stochastic Anonymous Routing Algorithm Using Multi-Agent Systems
The ability of communicating with a selected party anonymously is an important aspect of network security. Communicating anonymously means that no adversary can discern who is com...
Magdy Saeb, Meer Hamza, Ahmed El-Shikh