Mattia Bianchi

Orcid: 0000-0002-5261-6718

According to our database1, Mattia Bianchi authored at least 26 papers between 2011 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Convergence and Robustness Bounds for Distributed Asynchronous Shortest-Path.
CoRR, July, 2025

Online Feedback Optimization for Monotone Systems without Timescale Separation.
CoRR, June, 2025

PRIME: Fast Primal-Dual Feedback Optimization for Markets with Application to Optimal Power Flow.
CoRR, April, 2025

Data-driven stabilization of switched and constrained linear systems.
Autom., 2025

Contractivity and linear convergence in bilinear saddle-point problems: An operator-theoretic approach.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2025

2024
The END: Estimation Network Design for Games Under Partial-Decision Information.
IEEE Trans. Control. Netw. Syst., December, 2024

A Stability Condition for Online Feedback Optimization without Timescale Separation.
CoRR, 2024

Constrained multi-cluster game: Distributed Nash equilibrium seeking over directed graphs.
Proceedings of the 63rd IEEE Conference on Decision and Control, 2024

Estimation Network Design framework for efficient distributed optimization.
Proceedings of the 63rd IEEE Conference on Decision and Control, 2024

2023
Equilibrium seeking in games under partial-decision information.
PhD thesis, 2023

Nash Equilibrium Seeking Over Digraphs With Row-Stochastic Matrices and Network-Independent Step-Sizes.
IEEE Control. Syst. Lett., 2023

Linear Convergence in Time-Varying Generalized Nash Equilibrium Problems.
Proceedings of the 62nd IEEE Conference on Decision and Control, 2023

2022
Guest Editorial: Agile Beyond Software - In Search of Flexibility in a Wide Range of Innovation Projects and Industries.
IEEE Trans. Engineering Management, 2022

The Distributed Dual Ascent Algorithm is Robust to Asynchrony.
IEEE Control. Syst. Lett., 2022

The END: Estimation Network Design for efficient distributed equilibrium seeking.
CoRR, 2022

Fast generalized Nash equilibrium seeking under partial-decision information.
Autom., 2022

Nash equilibrium seeking under partial-decision information: Monotonicity, smoothness and proximal-point algorithms.
Proceedings of the 61st IEEE Conference on Decision and Control, 2022

2021
Fully Distributed Nash Equilibrium Seeking Over Time-Varying Communication Networks With Linear Convergence Rate.
IEEE Control. Syst. Lett., 2021

Continuous-time fully distributed generalized Nash equilibrium seeking for multi-integrator agents.
Autom., 2021

2020
A Decentralized System for Fair Token Distribution and Seamless Users Onboarding.
Proceedings of the IEEE Symposium on Computers and Communications, 2020

A continuous-time distributed generalized Nash equilibrium seeking algorithm over networks for double-integrator agents.
Proceedings of the 18th European Control Conference, 2020

Nash equilibrium seeking under partial-decision information over directed communication networks.
Proceedings of the 59th IEEE Conference on Decision and Control, 2020

A fully-distributed proximal-point algorithm for Nash equilibrium seeking with linear convergence rate.
Proceedings of the 59th IEEE Conference on Decision and Control, 2020

2019
Developing software beyond customer needs and plans: an exploratory study of its forms and individual-level drivers.
Int. J. Prod. Res., 2019

A distributed proximal-point algorithm for Nash equilibrium seeking under partial-decision information with geometric convergence.
CoRR, 2019

2011
Exploring the role of human resources in technology out-licensing: an empirical analysis of biotech newtechnology-based firms.
Technol. Anal. Strateg. Manag., 2011


  Loading...