On the probabilistic feasibility of solutions in multi-agent optimization problems under uncertainty
From MaRDI portal
Publication:2667503
Abstract: We investigate the probabilistic feasibility of randomized solutions to two distinct classes of uncertain multi-agent optimization programs. We first assume that only the constraints of the program are affected by uncertainty, while the cost function is arbitrary. Leveraging recent a posteriori developments of the scenario approach, we provide probabilistic guarantees for all feasible solutions of the program under study. This result is particularly useful in cases where numerical difficulties related to the convergence of the solution-seeking algorithm hinder the exact quantification of the optimal solution. Furthermore, it can be applied to cases where the agents' incentives lead to a suboptimal solution, e.g., under a non-cooperative setting. We then focus on optimization programs where the cost function admits an aggregate representation and depends on uncertainty while constraints are deterministic. By exploiting the structure of the program under study and leveraging the so called support rank notion, we provide agent-independent robustness certificates for the optimal solution, i.e., the constructed bound on the probability of constraint violation does not depend on the number of agents, but only on the dimension of the agents' decision. This substantially reduces the number of samples required to achieve a certain level of probabilistic robustness as the number of agents increases. All robustness certificates provided in this paper are distribution-free and can be used alongside any optimization algorithm. Our theoretical results are accompanied by a numerical case study involving a charging control problem of a fleet of electric vehicles.
Recommendations
- A probability collectives approach for multi-agent distributed and cooperative optimization with tolerance for agent failure
- Randomized Strategies for Probabilistic Solutions of Uncertain Feasibility and Optimization Problems
- Convergence of a class of multi-agent systems in probabilistic framework
- Optimal control of multi-agent dynamical systems under uncertainties
- Distributed optimization for uncertain nonlinear interconnected multi-agent systems
- Robust multi-agent optimization: coping with Byzantine agents with input redundancy
Cites work
- A General Scenario Theory for Nonconvex Optimization and Decision Making
- A Scenario Approach for Non-Convex Control Design
- Aggregate comparative statics
- Combinatorial redundancy detection
- Convexity. An analytic viewpoint
- Decentralized Convergence to Nash Equilibria in Constrained Deterministic Mean Field Control
- Dynamic Control of Agents Playing Aggregative Games With Coupling Constraints
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 1065062 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Introduction to Stochastic Programming
- Introduction to the Scenario Approach
- Lectures on Polytopes
- Making a Case for Robust Optimization Models
- Nash and Wardrop Equilibria in Aggregative Games With Coupling Constraints
- On the Connection Between Compression Learning and Scenario Based Single-Stage and Cascading Optimization Problems
- Opinion dynamics and learning in social networks
- Opinion dynamics in social networks with stubborn agents: equilibrium and convergence rate
- Price of anarchy in electric vehicle charging control games: when Nash equilibria achieve social welfare
- Price-Based Coordinated Aggregation of Networked Distributed Energy Resources
- Probably Approximately Correct Nash Equilibrium Learning
- The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
- The Scenario Approach to Robust Control Design
- Wait-and-judge scenario optimization
Cited in
(5)- Probabilistic feasibility guarantees for solution sets to uncertain variational inequalities
- k-Agent Sufficiency for Multiagent Stochastic Physical Search Problems
- scientific article; zbMATH DE number 5267097 (Why is no real title available?)
- Branch-and-price based heuristic algorithm for fuzzy multi-depot bus scheduling problem
- A priori data-driven robustness guarantees on strategic deviations from generalised Nash equilibria
This page was built for publication: On the probabilistic feasibility of solutions in multi-agent optimization problems under uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2667503)
