On the probabilistic feasibility of solutions in multi-agent optimization problems under uncertainty
From MaRDI portal
Publication:2667503
DOI10.1016/j.ejcon.2021.10.003zbMath1483.93024arXiv2009.02706OpenAlexW3205816590MaRDI QIDQ2667503
George Pantazis, Kostas Margellos, Filiberto Fele
Publication date: 4 March 2022
Published in: European Journal of Control (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.02706
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Opinion dynamics and learning in social networks
- Wait-and-judge scenario optimization
- Combinatorial redundancy detection
- Price of anarchy in electric vehicle charging control games: when Nash equilibria achieve social welfare
- Opinion dynamics in social networks with stubborn agents: equilibrium and convergence rate
- Aggregate comparative statics
- Decentralized Convergence to Nash Equilibria in Constrained Deterministic Mean Field Control
- Price-Based Coordinated Aggregation of Networked Distributed Energy Resources
- A Scenario Approach for Non-Convex Control Design
- On the Connection Between Compression Learning and Scenario Based Single-Stage and Cascading Optimization Problems
- The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
- Lectures on Polytopes
- Introduction to Stochastic Programming
- Making a Case for Robust Optimization Models
- A General Scenario Theory for Nonconvex Optimization and Decision Making
- Dynamic Control of Agents Playing Aggregative Games With Coupling Constraints
- Introduction to the Scenario Approach
- Probably Approximately Correct Nash Equilibrium Learning
- Nash and Wardrop Equilibria in Aggregative Games With Coupling Constraints
- The Scenario Approach to Robust Control Design
- Convexity
This page was built for publication: On the probabilistic feasibility of solutions in multi-agent optimization problems under uncertainty