Showing 1 - 10 of 12
According to Wardrop's first principle, agents in a congested network choose their routes selfishly, a behavior that is captured by the Nash equilibrium of the underlying noncooperative game. A Nash equilibrium does not optimize any global criterion per se, and so there is no apparent reason why...
Persistent link: https://www.econbiz.de/10014029029
We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions are linear and there is a single source and sink. Still, an optimal flow and an equilibrium flow share a desirable property in...
Persistent link: https://www.econbiz.de/10014074341
We consider network games with atomic players, which indicates that some players control a positive amount of flow. Instead of studying Nash equilibria as previous work has done, we consider that players with considerable market power will make decisions before the others because they can...
Persistent link: https://www.econbiz.de/10014050540
Persistent link: https://www.econbiz.de/10011916652
Persistent link: https://www.econbiz.de/10012001056
This article considers network routing games, which can readily be used to model competition in telecommunication, traffic, transit or distribution networks. We study a mechanism based on rebates that provides incentives for participants to cooperate. This mechanism is modeled by a Stackelberg...
Persistent link: https://www.econbiz.de/10013119411
Persistent link: https://www.econbiz.de/10013365815
Network games can be used to model competitive situations in which agents select routes to minimize their cost. Common applications include traffic, telecommunication and distribution networks. Although traditional network models have assumed that realized costs only depend on congestion, in...
Persistent link: https://www.econbiz.de/10014050547
Network games can be used to model competitive situations in which players select routes to maximize their utility. Common applications include traffic, telecommunication and distribution networks. Although traditional network models have assumed that utilities only depend on congestion, in most...
Persistent link: https://www.econbiz.de/10013113811
This article considers network routing games, which can readily be used to model competition in telecommunication, traffic, transit or distribution networks. We study a mechanism based on rebates that provides incentives for participants to cooperate. This mechanism is modeled by a Stackelberg...
Persistent link: https://www.econbiz.de/10014026044