Sciweavers

96 search results - page 13 / 20
» On a selfish caching game
Sort
View
PE
2002
Springer
109views Optimization» more  PE 2002»
13 years 7 months ago
Non-cooperative routing in loss networks
The paper studies routing in loss networks in the framework of a non-cooperative game with selfish users. Two solution concepts are considered: the Nash equilibrium, corresponding...
Eitan Altman, Rachid El Azouzi, Vyacheslav M. Abra...
ACMACE
2005
ACM
14 years 1 months ago
Playmakers in multiplayer game communities: their importance and motivations for participation
In many game-like open-ended multiplayer communities, the success of the game, and well-being of the community, depends on the efforts of certain individuals who arrange resources...
Antti Salovaara, Mikael Johnson, Kalle Toiskallio,...
COMCOM
2008
145views more  COMCOM 2008»
13 years 7 months ago
A game-theoretic intrusion detection model for mobile ad hoc networks
In this paper, we address the problem of increasing the effectiveness of an intrusion detection system (IDS) for a cluster of nodes in ad hoc networks. To reduce the performance o...
Hadi Otrok, Noman Mohammed, Lingyu Wang, Mourad De...
GLOBECOM
2009
IEEE
13 years 11 months ago
Conjectural Equilibrium in Water-Filling Games
—This paper considers a non-cooperative game in which competing users sharing a frequency-selective interference channel selfishly optimize their power allocation in order to imp...
Yi Su, Mihaela van der Schaar
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 7 months ago
Power Allocation Games in Wireless Networks of Multi-antenna Terminals
We consider wireless networks that can be modeled by multiple access channels in which all the terminals are equipped with multiple antennas. The propagation model used to account...
Elena Veronica Belmega, Samson Lasaulce, Mé...