Competitive routing in networks with polynomial costs

DOI10.1109/9.981725zbMath1364.90077OpenAlexW2121427654MaRDI QIDQ5267281

Tamer Başar, Tania Jiménez, Eitan Altman, Nahum Shimkin

Publication date: 20 June 2017

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/59c1eeae14a378dd7ea9728302ddc014e5a0cfd3

Mathematics Subject Classification ID

Noncooperative games (91A10) Communication networks in operations research (90B18) Applications of game theory (91A80)

Related Items (33)

Competitive routing of traffic flows by navigation providers ⋮ Worst-case analysis of non-cooperative load balancing ⋮ NASH EQUILIBRIA IN LOAD BALANCING IN DISTRIBUTED COMPUTER SYSTEMS ⋮ Uniqueness of equilibria in atomic splittable polymatroid congestion games ⋮ On the Uniqueness of Equilibrium in Atomic Splittable Routing Games ⋮ Competitive online multicommodity routing ⋮ Collusion in atomic splittable routing games ⋮ The price of anarchy for polynomial social cost ⋮ On a generalized Cournot oligopolistic competition game ⋮ Competitive energy consumption under transmission constraints in a multi-supplier power grid system ⋮ A Stackelberg network game with a large number of followers ⋮ Unnamed Item ⋮ Decentralized bandwidth control subject to two-layer constraints ⋮ Top-percentile traffic routing problem by dynamic programming ⋮ Modeling conflict processes on the Internet ⋮ GAME THEORETIC BEST-RESPONSE DYNAMICS FOR EVACUEES' EXIT SELECTION ⋮ A flow and routing control policy for communication networks with multiple competitive users ⋮ Collusion in Atomic Splittable Routing Games ⋮ A new model for selfish routing ⋮ Stackelberg strategies and collusion in network games with splittable flow ⋮ Game theory-based optimization of distributed idle computing resources in cloud environments ⋮ A Survey of Uniqueness Results for Selfish Routing ⋮ A Stackelberg strategy for routing flow over time ⋮ Nonadaptive Selfish Routing with Online Demands ⋮ A communication network routing problem: modeling and optimization using non-cooperative game theory ⋮ Efficiency of atomic splittable selfish routing with polynomial cost functions ⋮ Internalization of social cost in congestion games ⋮ Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games ⋮ Optimal improvement of communication network congestion via nonlinear programming with generalized Nash equilibrium constraints ⋮ Congestion control and optimal maintenance of communication networks with stochastic cost functions: a variational formulation ⋮ Two-terminal routing games with unknown active players ⋮ A survey on networking games in telecommunications ⋮ A distributed Bregman forward-backward algorithm for a class of Nash equilibrium problems

This page was built for publication: Competitive routing in networks with polynomial costs