Optimization of Long-Run Average-Flow Cost in Networks With Time-Varying Unknown Demand

DOI10.1109/TAC.2009.2034204MaRDI QIDQ4978653zbMATH OpenDBLPWikidataFDO

Authors Dario Bauso, Franco Blanchini, Raffaele Pesenti

Publication date 25 August 2017

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

Full work available at URL https://doi.org/10.1109/TAC.2009.2034204

Mathematics Subject Classification ID

Existence of solutions for minimax problems (49J35) Deterministic network models in operations research (90B10) Design techniques (robust design, computer-aided design, etc.) (93B51)

Cited in

(5)

• Approachability with constraints
• The linear saturated decentralized strategy for constrained flow control is asymptotically optimal
• Attainability in repeated games with vector payoffs
• Opinion dynamics in social networks through mean-field games
• Compartmental flow control: decentralization, robustness and optimality

This page was built for publication: Optimization of Long-Run Average-Flow Cost in Networks With Time-Varying Unknown Demand

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