Optimal routing control: repeated game approach

DOI10.1109/9.989076MaRDI QIDQ5267224zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Noncooperative games (91A10) Communication networks in operations research (90B18) Multistage and repeated games (91A20)

Cited in

(14)

• Decentralized bandwidth control subject to two-layer constraints
• A game-theoretic analysis of bandwidth allocation under a user-grouping constraint
• Adaptive stabilisation of networked control systems tolerant to unknown actuator failures
• A Stackelberg Game to Optimize the Distribution of Controls in Transportation Networks
• Restrictive mechanism of flow control among non-cooperative internet users
• A Stackelberg game management model of the urban public transport
• scientific article; zbMATH DE number 5121085 (Why is no real title available?)
• A Survey of Uniqueness Results for Selfish Routing
• Repeated congestion games with bounded rationality
• Multi-agent learning for engineers
• A flow and routing control policy for communication networks with multiple competitive users
• ``Beat-your-rival routing games
• The joint network vehicle routing game with optional customers
• Worst-case equilibria

This page was built for publication: Optimal routing control: repeated game approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5267224)