Sebastiano Vitali

Mr. Sebastiano Vitali


Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
19 December 2016 in Annals of Operations Research
Verified
Journal Article
Closed access
PDF file
MKMiloš Kopa
Miloš Kopa
VMVittorio MORIGGIA
Vittorio MORIGGIA
SVSebastiano Vitali
Sebastiano Vitali

1 September 2019 in Omega
Verified
Journal Article
Closed access
VMVittorio Moriggia
Vittorio Moriggia
MKMiloš Kopa
Miloš Kopa
SVSebastiano Vitali
Sebastiano Vitali

8 May 2019 in Annals of Operations Research
Verified
Journal Article
Closed access
PDF file
GCGiorgio Consigli
Giorgio Consigli
VMVittorio MORIGGIA
Vittorio MORIGGIA
SVSebastiano Vitali
Sebastiano Vitali

8 June 2016 in Annals of Operations Research
Verified
Journal Article
Closed access
PDF file
SOSergio Ortobelli
Sergio Ortobelli
SVSebastiano Vitali
Sebastiano Vitali
MCMarco Cassader
Marco Cassader
TTTomáš Tichý
Tomáš Tichý

1 June 2020 in Computational Management Science
Verified
Journal Article
Open access
PDF file
MHMarkéta Horejšová
Markéta Horejšová
SVSebastiano Vitali
Sebastiano Vitali
MKMiloš Kopa
Miloš Kopa
VMVittorio MORIGGIA
Vittorio MORIGGIA
Multistage stochastic optimization is used to solve many real-life problems where decisions are taken at multiple times. Such problems need the representation of stochastic processes, which are usually approximated by scenario trees. In this article, we implement seven scenario reduction algorithms: three based on random extraction, named Random, and four based on specific distance measures, named Distance-based. Three of the latter are well known in literature while the fourth is a new approach, namely nodal clustering. We compare all the algorithms in terms of computational cost and information cost. The computational cost is measured by the time needed for the reduction, while the information cost is measured by the nested distance between the original and the reduced tree. Moreover, we also formulate and solve a multistage stochastic portfolio selection problem to measure the distance between the optimal solutions and between the optimal objective values of the original and the reduced tree.

10 November 2023 in Annals of Operations Research
Verified
Journal Article
Open access
PDF file
MKMiloš Kopa
Miloš Kopa
VMVittorio MORIGGIA
Vittorio MORIGGIA
SVSebastiano Vitali
Sebastiano Vitali
A pension fund manager typically decides the allocation of the pension fund assets taking into account a long-term sustainability goal. Many asset and liability management models, in the form of multistage stochastic programming problem, have been proposed to help the pension fund manager to define the optimal allocation given a multi-objective function. The recent literature proposes univariate stochastic dominance constraints to guarantee that the optimal strategy is able to stochastically dominate a benchmark portfolio. In this work we extend previous results (i) considering alternative types of multivariate stochastic dominance that appear more suitable in a multistage framework, (ii) proposing a way to measure the economic cost of introducing stochastic dominance constraints, (iii) proposing a sort of augmented stochastic dominance through a safety margin. Numerical results show the difference between the alternative ways to interpret and apply the multivariate stochastic dominance. These results are evaluated thanks to the proposed economic cost of the stochastic dominance constraints and either in presence or not of a safety margin.