default search action
Mauro Passacantando
Person information
- affiliation: University of Pisa, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [e1]Martin Clayton
, Mauro Passacantando
Intelligent Technologies for Interactive Entertainment - 14th EAI International Conference, INTETAIN 2023, Lucca, Italy, November 27, 2023, Proceedings. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 560, Springer 2024, ISBN 978-3-031-55721-7 [contents] - 2023
- [j35]Mauro Passacantando
Lipschitz Continuity Results for a Class of Parametric Variational Inequalities and Applications to Network Games. Algorithms 16(10): 458 (2023) - [j34]Mauro Passacantando
International migrant flows: Coalition formation among countries and social welfare. EURO J. Comput. Optim. 11: 100062 (2023) - [j33]Mauro Passacantando
A finite convergence algorithm for solving linear-quadratic network games with strategic complements and bounded strategies. Optim. Methods Softw. 38(6): 1105-1128 (2023) - 2022
- [j32]Hamta Sedghani
A Stackelberg Game Approach for Managing AI Sensing Tasks in Mobile Crowdsensing. IEEE Access 10: 91524-91544 (2022) - [j31]Stefano Lucidi
Solving non-monotone equilibrium problems via a DIRECT-type approach. J. Glob. Optim. 83(4): 699-725 (2022) - [c6]Giacomo Lanza
The Green Sequencing and Routing Problem. ICCL 2022: 231-244 - [c5]Fabrizio Baiardi
Discovering How to Attack a System. SECRYPT 2022: 548-553 - 2021
- [j30]Hamta Sedghani
An incentive mechanism based on a Stackelberg game for mobile crowdsensing systems with budget constraint. Ad Hoc Networks 123: 102626 (2021) - [j29]Mauro Passacantando
Braess' paradox: A cooperative game-theoretic point of view. Networks 78(3): 264-283 (2021) - [j28]Mauro Passacantando
Optimal road maintenance investment in traffic networks with random demands. Optim. Lett. 15(5): 1799-1819 (2021)
2010 – 2019
- 2019
- [j27]Lorela Cano
Modeling the Techno-Economic Interactions of Infrastructure and Service Providers in 5G Networks With a Multi-Leader-Follower Game. IEEE Access 7: 162913-162940 (2019) - [c4]Paolo Nepa
I-READ 4.0: Internet-of-READers for an efficient asset management in large warehouses with high stock rotation index. RTSI 2019: 67-72 - 2018
- [j26]Marzieh Malekimajd
An optimization framework for the capacity allocation and admission control of MapReduce jobs in cloud systems. J. Supercomput. 74(10): 5314-5348 (2018) - 2017
- [j25]Danilo Ardagna
Generalized Nash Equilibria for the Service Provisioning Problem in Multi-Cloud Systems. IEEE Trans. Serv. Comput. 10(3): 381-395 (2017) - [j24]Lorela Cano, Antonio Capone
On Optimal Infrastructure Sharing Strategies in Mobile Radio Networks. IEEE Trans. Wirel. Commun. 16(5): 3003-3016 (2017) - [c3]Eugenio Gianniti, Danilo Ardagna
A Game-Theoretic Approach for Runtime Capacity Allocation in MapReduce. CCGrid 2017: 1080-1089 - [i1]Eugenio Gianniti, Danilo Ardagna, Michele Ciavotta, Mauro Passacantando:
A Game-Theoretic Approach for Runtime Capacity Allocation in MapReduce. CoRR abs/1701.04763 (2017) - 2016
- [j23]Massimo Pappalardo, Giandomenico Mastroeni
Merit functions: a bridge between optimization and equilibria. Ann. Oper. Res. 240(1): 271-299 (2016) - [j22]Mauro Passacantando
Service Provisioning Problem in Cloud and Multi-Cloud Systems. INFORMS J. Comput. 28(2): 265-277 (2016) - [j21]Giancarlo Bigi
Gap functions for quasi-equilibria. J. Glob. Optim. 66(4): 791-810 (2016) - [j20]Giancarlo Bigi
Optimization Tools for Solving Equilibrium Problems with Nonsmooth Data. J. Optim. Theory Appl. 171(3): 887-905 (2016) - [j19]Lorela Cano
Cooperative Infrastructure and Spectrum Sharing in Heterogeneous Mobile Networks. IEEE J. Sel. Areas Commun. 34(10): 2617-2629 (2016) - 2015
- [j18]Giancarlo Bigi
D-gap functions and descent techniques for solving equilibrium problems. J. Glob. Optim. 62(1): 183-203 (2015) - [j17]Giancarlo Bigi
Descent and Penalization Techniques for Equilibrium Problems with Nonlinear Constraints. J. Optim. Theory Appl. 164(3): 804-818 (2015) - [j16]Giancarlo Bigi
Twelve monotonicity conditions arising from algorithms for equilibrium problems. Optim. Methods Softw. 30(2): 323-337 (2015) - [j15]Marzieh Malekimajd
Optimal Map Reduce Job Capacity Allocation in Cloud Systems. SIGMETRICS Perform. Evaluation Rev. 42(4): 51-61 (2015) - 2014
- [j14]Massimo Pappalardo, Giandomenico Mastroeni
Merit functions: a bridge between optimization and equilibria. 4OR 12(1): 1-33 (2014) - [j13]Jonatha Anselmi, Danilo Ardagna
Generalized Nash equilibria for SaaS/PaaS Clouds. Eur. J. Oper. Res. 236(1): 326-339 (2014) - [j12]David Di Lorenzo, Mauro Passacantando
A convergent inexact solution method for equilibrium problems. Optim. Methods Softw. 29(5): 979-991 (2014) - [c2]Marzieh Malekimajd
Optimal Capacity Allocation for Executing MapReduce Jobs in Cloud Systems. SYNASC 2014: 385-392 - 2013
- [j11]Giancarlo Bigi
Existence and solution methods for equilibria. Eur. J. Oper. Res. 227(1): 1-11 (2013) - [j10]Danilo Ardagna
Generalized Nash Equilibria for the Service Provisioning Problem in Cloud Systems. IEEE Trans. Serv. Comput. 6(4): 429-442 (2013) - 2012
- [j9]Giancarlo Bigi
Gap functions and penalization for solving equilibrium problems with nonlinear constraints. Comput. Optim. Appl. 53(2): 323-346 (2012) - [j8]Boris S. Mordukhovich, Barbara Panicucci, Massimo Pappalardo, Mauro Passacantando
Hybrid proximal methods for equilibrium problems. Optim. Lett. 6(7): 1535-1550 (2012) - [j7]Stefano Abbate, Marco Avvenuti
An Integer Linear Programming Approach for Radio-Based Localization of Shipping Containers in the Presence of Incomplete Proximity Information. IEEE Trans. Intell. Transp. Syst. 13(3): 1404-1419 (2012) - 2011
- [c1]Danilo Ardagna
A game theoretic formulation of the service provisioning problem in cloud systems. WWW 2011: 177-186 - 2010
- [j6]Barbara Panicucci, Massimo Pappalardo, Mauro Passacantando
Descent methods for a class of generalized variational inequalities. Comput. Optim. Appl. 45(2): 415-425 (2010) - [j5]Marco Castellani
Existence results for nonconvex equilibrium problems. Optim. Methods Softw. 25(1): 49-58 (2010)
2000 – 2009
- 2009
- [j4]Barbara Panicucci, Massimo Pappalardo, Mauro Passacantando
A globally convergent descent method for nonsmooth variational inequalities. Comput. Optim. Appl. 43(2): 197-211 (2009) - [j3]Barbara Panicucci, Massimo Pappalardo, Mauro Passacantando
On solving generalized Nash equilibrium problems via optimization. Optim. Lett. 3(3): 419-435 (2009) - 2007
- [j2]Barbara Panicucci, Massimo Pappalardo, Mauro Passacantando
A path-based double projection method for solving the asymmetric traffic network equilibrium problem. Optim. Lett. 1(2): 171-185 (2007) - 2004
- [j1]Massimo Pappalardo, Mauro Passacantando
Gap Functions and Lyapunov Functions. J. Glob. Optim. 28(3-4): 379-385 (2004)
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-06-10 20:32 CEST 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: