15 search results - page 3 / 3 » Nash Equilibria and Dominant Strategies in Routing |
ECAL
2003
Springer
15 years 2 months ago
2003
Springer
This paper proposes an evolutionary-game-theory model, called meta-evolutionary game dynamics, for studying the dynamics of rules and individual behaviour. Although there are two g...
GLOBECOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—It is generally admitted that Inter-domain peering links represent nowadays the main bottleneck of the Internet, particularly because of lack of coordination between providers, ...
ATAL
2006
Springer
15 years 1 months ago
2006
Springer
Learning to converge to an efficient, i.e., Pareto-optimal Nash equilibrium of the repeated game is an open problem in multiagent learning. Our goal is to facilitate the learning ...
WINE
2009
Springer
15 years 4 months ago
2009
Springer
Congestion games are a fundamental and widely studied model for selfish allocation problems like routing and load balancing. An intrinsic property of these games is that players ...
109
click to vote
MST
2011
14 years 4 months ago
2011
We study the impact of collusion in network games with splittable flow and focus on the well established price of anarchy as a measure of this impact. We first investigate symmet...