Sciweavers

601 search results - page 46 / 121
» Playing large games using simple strategies
Sort
View
INFOCOM
2005
IEEE
15 years 7 months ago
On the interaction between overlay routing and underlay routing
— In this paper, we study the interaction between overlay routing and Traffic Engineering (TE) in a single Autonomous System (AS). We formulate this interaction as a twoplayer n...
Yong Liu, Honggang Zhang, Weibo Gong, Donald F. To...
INFOCOM
2010
IEEE
14 years 12 months ago
Bargaining and Price-of-Anarchy in Repeated Inter-Session Network Coding Games
— Most of the previous work on network coding has assumed that the users are not selfish and always follow the designed coding schemes. However, recent results have shown that s...
Amir Hamed Mohsenian Rad, Jianwei Huang, Vincent W...
WAOA
2005
Springer
152views Algorithms» more  WAOA 2005»
15 years 6 months ago
Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost
We study computational and coordination efficiency issues of Nash equilibria in symmetric network congestion games. We first propose a simple and natural greedy method that comput...
Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. ...
AAAI
2000
15 years 2 months ago
Defining and Using Ideal Teammate and Opponent Agent Models
A common challenge for agents in multiagent systems is trying to predict what other agents are going to do in the future. Such knowledge can help an agent determine which of its c...
Peter Stone, Patrick Riley, Manuela M. Veloso
TIFS
2008
149views more  TIFS 2008»
15 years 1 months ago
Secure Cooperation in Autonomous Mobile Ad-Hoc Networks Under Noise and Imperfect Monitoring: A Game-Theoretic Approach
In autonomous mobile ad-hoc networks, one major challenge is to stimulate cooperation among selfish nodes, especially when some nodes may be malicious. In this paper, we address co...
Wei Yu, K. J. Ray Liu