Stefano Coniglio

Stefano Coniglio

Auto-generated profile, based on publicly available information

Stefano Coniglio

University of Bergamo

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 June 2016 in Electronic Notes in Discrete Mathematics
Verified
Journal Article
Closed access
EAEdoardo Amaldi
Edoardo Amaldi
SCStefano Coniglio
Stefano Coniglio
AKArie M.C.A. Koster
Arie M.C.A. Koster
MTMartin Tieves
Martin Tieves

1 March 2021 in European Journal of Operational Research
Verified
Journal Article
Closed access
SCStefano Coniglio
Stefano Coniglio
FFFabio Furini
Fabio Furini
PSPablo San Segundo
Pablo San Segundo

15 September 2022 in European Journal of Operational Research
Verified
Journal Article
Closed access
EBEndre Bjørndal
Endre Bjørndal
MBMette Helene Bjørndal
Mette Helene Bjørndal
SCStefano Coniglio
Stefano Coniglio
MKMarc-Fabian Körner
Marc-Fabian Körner
CLChristina Leinauer
Christina Leinauer
MWMartin Weibelzahl
Martin Weibelzahl

12 June 2013 in IEEE Communications Letters
Verified
Journal Article
Closed access
EAEdoardo Amaldi
Edoardo Amaldi
ACAntonio Capone
Antonio Capone
SCStefano Coniglio
Stefano Coniglio
LGLuca G. Gianoli
Luca G. Gianoli
We propose a novel way to consider the max-min fairness (MMF) paradigm in traffic engineering. Since MMF appears as a reference model for a fair capacity allocation when the traffic flows are elastic and rates are adapted based on resource availability, we consider it as a requirement due to the way resources are shared by the distributed rate control scheme (like that of the transport protocol), rather than the routing objective. In particular, we define the traffic engineering problem where, given a network topology with link capacities and a set of elastic traffic demands to route, we must select a single path for each demand so as to maximize a network utility function, assuming an MMF bandwidth allocation. We propose a compact mixed-integer linear programming formulation as well as a restricted path formulation. We show with computational experiments that the exact formulation can be solved in a reasonable amount of computing time for medium-size networks and that the restricted path model provides solutions of comparable quality much faster.

26 June 2023 in Proceedings of the AAAI Conference on Artificial Intelligence
Verified
Journal Article
Open access
PDF file
SFstefano Fiorini
stefano Fiorini
SCStefano Coniglio
Stefano Coniglio
MCMichele Ciavotta
Michele Ciavotta
EMEnza Messina
Enza Messina
This paper introduces SigMaNet, a generalized Graph Convolutional Network (GCN) capable of handling both undirected and directed graphs with weights not restricted in sign nor magnitude. The cornerstone of SigMaNet is the Sign-Magnetic Laplacian (LSM), a new Laplacian matrix that we introduce ex novo in this work. LSM allows us to bridge a gap in the current literature by extending the theory of spectral GCNs to (directed) graphs with both positive and negative weights. LSM exhibits several desirable properties not enjoyed by other Laplacian matrices on which several state-of-the-art architectures are based, among which encoding the edge direction and weight in a clear and natural way that is not negatively affected by the weight magnitude. LSM is also completely parameter-free, which is not the case of other Laplacian operators such as, e.g., the Magnetic Laplacian. The versatility and the performance of our proposed approach is amply demonstrated via computational experiments. Indeed, our results show that, for at least a metric, SigMaNet achieves the best performance in 15 out of 21 cases and either the first- or second-best performance in 21 cases out of 21, even when compared to architectures that are either more complex or that, due to being designed for a narrower class of graphs, should---but do not---achieve a better performance.

14 November 2019 in Algorithmica
Verified
Journal Article
Open access
PDF file
SCStefano Coniglio
Stefano Coniglio
NGNicola Gatti
Nicola Gatti
AMAlberto Marchesi
Alberto Marchesi
The search problem of computing aStackelberg(orleader-follower)equilibrium(also referred to as anoptimal strategy to commit to) has been widely investigated in the scientific literature in, almost exclusively, the single-follower setting. Although theoptimisticandpessimisticversions of the problem, i.e., those where the single follower breaks any ties among multiple equilibria either in favour or against the leader, are solved with different methodologies, both cases allow for efficient, polynomial-time algorithms based on linear programming. The situation is different with multiple followers, where results are only sporadic and depend strictly on the nature of the followers’ game. In this paper, we investigate the setting of a normal-form game with a single leader and multiple followers who, after observing the leader’s commitment, play a Nash equilibrium. When both leader and followers are allowed to play mixed strategies, the corresponding search problem, both in the optimistic and pessimistic versions, is known to be inapproximable in polynomial time to within any multiplicative polynomial factor unless $$\textsf {P}=\textsf {NP}$$P=NP . Exact algorithms are known only for the optimistic case. We focus on the case where the followers play pure strategies—a restriction that applies to a number of real-world scenarios and which, in principle, makes the problem easier—under the assumption of pessimism (the optimistic version of the problem can be straightforwardly solved in polynomial time). After casting this search problem (with followers playing pure strategies) as apessimistic bilevel programming problem, we show that, with two followers, the problem is -hard and, with three or more followers, it cannot be approximated in polynomial time to within any multiplicative factor which is polynomial in the size of the normal-form game, nor, assuming utilities in [0, 1], to within any constant additive loss stricly smaller than 1 unless $$\textsf {P}=\textsf {NP}$$P=NP . This shows that, differently from what happens in the optimistic version, hardness and inapproximability in the pessimistic problem are not due to the adoption of mixed strategies. We then show that the problem admits, in the general case, a supremum but not a maximum, and we propose a single-level mathematical programming reformulation which asks for the maximization of a nonconcave quadratic function over an unbounded nonconvex feasible region defined by linear and quadratic constraints. Since, due to admitting a supremum but not a maximum, only a restricted version of this formulation can be solved to optimality with state-of-the-art methods, we propose an exactad hocalgorithm (which we also embed within a branch-and-bound scheme) capable of computing the supremum of the problem and, for cases where there is no leader’s strategy where such value is attained, also an $$\alpha $$α -approximate strategy where $$\alpha > 0$$α>0 is an arbitrary additive loss (at most as large as the supremum). We conclude the paper by evaluating the scalability of our algorithms via computational experiments on a well-established testbed of game instances.