Measurement-based efficient resource allocation with demand-side adjustments

DOI10.1016/J.AUTOMATICA.2019.05.003zbMath1429.93238arXiv1712.06299OpenAlexW2963790230WikidataQ127816661 ScholiaQ127816661MaRDI QIDQ2280775

Georgios C. Chasparis

Publication date: 19 December 2019

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1712.06299

zbMATH Keywords

resource managementlearning dynamicsmeasurement-based optimization

Mathematics Subject Classification ID

Control/observation systems involving computers (process control, etc.) (93C83) Adaptive control/observation systems (93C40) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Cites Work

• Unnamed Item
• Unnamed Item
• Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systems
• ForestGOMP: An efficient openMP environment for NUMA architectures
• Design and implementation of distributed resource management for time-sensitive applications
• Selfish Bin Packing
• A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems
• A Cooperative Game Framework for QoS Guided Job Allocation Schemes in Grids
• Non-Convex Distributed Optimization
• Aspiration Learning in Coordination Games
• Distributed Subgradient Methods for Multi-Agent Optimization
• Achieving Pareto Optimality Through Distributed Learning
• Stochastic Stability of Perturbed Learning Automata in Positive-Utility Games
• Learning Generalized Nash Equilibria in a Class of Convex Games
• Dynamic fictitious play, dynamic gradient play, and distributed convergence to Nash equilibria
• An Approximate Dual Subgradient Algorithm for Multi-Agent Non-Convex Optimization

This page was built for publication: Measurement-based efficient resource allocation with demand-side adjustments