default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMattia Bianchi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j9]Mattia Bianchi, Sergio Grammatico, Jorge Cortés:
Data-driven stabilization of switched and constrained linear systems. Autom. 171: 111974 (2025)- 2024
- [i13]Mattia Bianchi, Sergio Grammatico:
Estimation Network Design framework for efficient distributed optimization. CoRR abs/2404.15273 (2024) - 2023
- [b1]Mattia Bianchi:
Equilibrium seeking in games under partial-decision information. Delft University of Technology, Netherlands, 2023 - [j8]Duong Thuy Anh Nguyen, Mattia Bianchi
, Florian Dörfler, Duong Tung Nguyen, Angelia Nedic:
Nash Equilibrium Seeking Over Digraphs With Row-Stochastic Matrices and Network-Independent Step-Sizes. IEEE Control. Syst. Lett. 7: 3543-3548 (2023) - [c6]Mattia Bianchi, Emilio Benenati, Sergio Grammatico:
Linear Convergence in Time-Varying Generalized Nash Equilibrium Problems. CDC 2023: 7220-7226 - [i12]Mattia Bianchi, Emilio Benenati, Sergio Grammatico:
Linear convergence in time-varying generalized Nash equilibrium problems. CoRR abs/2304.09593 (2023) - [i11]Duong Thuy Anh Nguyen, Mattia Bianchi, Florian Dörfler, Duong Tung Nguyen, Angelia Nedic:
Nash equilibrium seeking over digraphs with row-stochastic matrices and network-independent step-sizes. CoRR abs/2309.07897 (2023) - 2022
- [j7]Mattia Bianchi, Giuseppe Belgioioso, Sergio Grammatico:
Fast generalized Nash equilibrium seeking under partial-decision information. Autom. 136: 110080 (2022) - [j6]Mattia Bianchi, Wicak Ananduta, Sergio Grammatico:
The Distributed Dual Ascent Algorithm is Robust to Asynchrony. IEEE Control. Syst. Lett. 6: 650-655 (2022) - [j5]Mattia Bianchi, Giacomo Marzi, Marina Dabic:
Guest Editorial: Agile Beyond Software - In Search of Flexibility in a Wide Range of Innovation Projects and Industries. IEEE Trans. Engineering Management 69(6): 3454-3458 (2022) - [c5]Mattia Bianchi, Sergio Grammatico:
Nash equilibrium seeking under partial-decision information: Monotonicity, smoothness and proximal-point algorithms. CDC 2022: 5080-5085 - [i10]Mattia Bianchi, Sergio Grammatico:
Nash equilibrium seeking under partial decision information: Monotonicity, smoothness and proximal-point algorithms. CoRR abs/2206.11568 (2022) - [i9]Mattia Bianchi, Sergio Grammatico:
The END: Estimation Network Design for efficient distributed equilibrium seeking. CoRR abs/2208.11377 (2022) - [i8]Mattia Bianchi, Sergio Grammatico, Jorge Cortés:
Data-driven stabilization of switched and constrained linear systems. CoRR abs/2208.11392 (2022) - 2021
- [j4]Mattia Bianchi, Sergio Grammatico:
Continuous-time fully distributed generalized Nash equilibrium seeking for multi-integrator agents. Autom. 129: 109660 (2021) - [j3]Mattia Bianchi, Sergio Grammatico:
Fully Distributed Nash Equilibrium Seeking Over Time-Varying Communication Networks With Linear Convergence Rate. IEEE Control. Syst. Lett. 5(2): 499-504 (2021) - [i7]Mattia Bianchi, Wicak Ananduta, Sergio Grammatico:
The distributed dual ascent algorithm is robust to asynchrony. CoRR abs/2105.01372 (2021) - 2020
- [c4]Mattia Bianchi, Giuseppe Belgioioso, Sergio Grammatico:
A fully-distributed proximal-point algorithm for Nash equilibrium seeking with linear convergence rate. CDC 2020: 2303-2308 - [c3]Mattia Bianchi, Sergio Grammatico:
Nash equilibrium seeking under partial-decision information over directed communication networks. CDC 2020: 3555-3560 - [c2]Mattia Bianchi, Sergio Grammatico:
A continuous-time distributed generalized Nash equilibrium seeking algorithm over networks for double-integrator agents. ECC 2020: 1474-1479 - [c1]Francesco Bruschi, Manuel Tumiati, Vincenzo Rana, Mattia Bianchi, Donatella Sciuto:
A Decentralized System for Fair Token Distribution and Seamless Users Onboarding. ISCC 2020: 1-6 - [i6]Mattia Bianchi, Giuseppe Belgioioso, Sergio Grammatico:
Fast generalized Nash equilibrium seeking under partial-decision information. CoRR abs/2003.09335 (2020) - [i5]Mattia Bianchi, Sergio Grammatico:
Fully distributed Nash equilibrium seeking over time-varying communication networks with linear convergence rate. CoRR abs/2003.10871 (2020) - [i4]Mattia Bianchi, Sergio Grammatico:
Nash equilibrium seeking under partial-decision information over directed communication networks. CoRR abs/2009.04981 (2020)
2010 – 2019
- 2019
- [j2]Mattia Bianchi, Giacomo Marzi, Lamberto Zollo, Andrea S. Patrucco:
Developing software beyond customer needs and plans: an exploratory study of its forms and individual-level drivers. Int. J. Prod. Res. 57(22): 7189-7208 (2019) - [i3]Mattia Bianchi, Sergio Grammatico:
A continuous-time distributed generalized Nash equilibrium seeking algorithm over networks for double-integrator agents. CoRR abs/1910.11608 (2019) - [i2]Mattia Bianchi, Giuseppe Belgioioso, Sergio Grammatico:
A distributed proximal-point algorithm for Nash equilibrium seeking under partial-decision information with geometric convergence. CoRR abs/1910.11613 (2019) - [i1]Mattia Bianchi, Sergio Grammatico:
Continuous-time fully distributed generalized Nash equilibrium seeking for multi-integrator agents. CoRR abs/1911.12266 (2019) - 2011
- [j1]Mattia Bianchi, Davide Chiaroni, Vittorio Chiesa, Federico Frattini:
Exploring the role of human resources in technology out-licensing: an empirical analysis of biotech newtechnology-based firms. Technol. Anal. Strateg. Manag. 23(8): 825-849 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-31 20:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
