Optimal routing control: repeated game approach
From MaRDI portal
Publication:5267224
DOI10.1109/9.989076zbMath1364.91028OpenAlexW2134316066MaRDI QIDQ5267224
Richard J. La, Venkat Anantharam
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/336db298e4bd0b4adbc5cf554057b4e9c52ff61a
Programming involving graphs or networks (90C35) Noncooperative games (91A10) Communication networks in operations research (90B18) Multistage and repeated games (91A20)
Related Items (11)
A Stackelberg game management model of the urban public transport ⋮ A game-theoretic analysis of bandwidth allocation under a user-grouping constraint ⋮ Decentralized bandwidth control subject to two-layer constraints ⋮ Repeated congestion games with bounded rationality ⋮ Worst-case equilibria ⋮ A flow and routing control policy for communication networks with multiple competitive users ⋮ Restrictive mechanism of flow control among non-cooperative internet users ⋮ A Survey of Uniqueness Results for Selfish Routing ⋮ “Beat-Your-Rival” Routing Games ⋮ Multi-agent learning for engineers ⋮ Adaptive stabilisation of networked control systems tolerant to unknown actuator failures
This page was built for publication: Optimal routing control: repeated game approach
