A routing game in networks with lossy links
Résumé
Standard assumptions in the theory of routing games are that costs are additive over links and that there is flow conservation. The assumptions typically hold when the costs represent delays. We introduce here a routing game where losses occur on links in a way that may depend on the congestion. In that case both assumptions fail. We study a load balancing network and identify a Kameda type paradox in which by adding capacity, all players suffer larger loss rates.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...