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)

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