Federica Ricca
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Federica Ricca has a total of 35 co-authors. Here are the top co-authors by number of shared publications:
- Andrea Scozzari
Università degli Studi Niccolò Cusano: Universita degli Studi Niccolo Cusano
31 shared publications - Justo Puerto
Institute of Mathematics (IMUS), Universidad de Sevilla, Sevilla, Spain
15 shared publications - Isabella Lari
Dipartimento di Scienze Statistiche Università di Roma "La Sapienza" piazzale Aldo Moro 5 00185 Roma Italy
11 shared publications Bruno Simeone
Sapienza Università di Roma
8 shared publicationsB. Simeone
2 shared publications- Bruno Simeone
Sapienza, Università di Roma, Dip. Scienze Statistiche, Italy
2 shared publications
Latest Publications
- Open Access
- 20 October 2026
- Published by Springer Nature in Research Square
A Quadratic Resource-Allocation Reduction for Portfolio Selection in the ε-Contaminated Binomial Model
We study the reduced portfolio selection problem in the ε -contaminated binomial model of Petturiti and Vantaggi. We give an explicit finite-state construction of a least favourable probability measure through a strictly convex continuous quadratic knapsack problem over the contamination class. This construction specializes the least favourable measure framework for robust utility maximization and connects it to established resource-allocation algorithms. The auxiliary optimizer is independent of both the utility function and the initial budget. For increasing, strictly concave utility functions satisfying regularity and boundary conditions, optimal terminal wealth is reconstructed through inverse marginal utility and a scalar budget equation. For constant relative risk aversion (CRRA) utility, the budget equation is solved explicitly for every parameter γ > 0, including logarithmic utility when γ = 1. Given the probability vectors, the auxiliary problem can be solved in O ( n log n ) time by sorting and scanning, or in O ( n ) time using median-search algorithms, where n = T + 1. For every fixed γ > 0, CRRA wealth reconstruction also takes O ( n ) operations. This procedure avoids the exponential active-set enumeration used in Algorithm 1 of Petturiti and Vantaggi. We also present an
- 20 October 2026
- Published by Springer Nature in Research Square
Open AccessA Quadratic Resource-Allocation Reduction for Portfolio Selection in the ε-Contaminated Binomial Model
We study the reduced portfolio selection problem in the ε -contaminated binomial model of Petturiti and Vantaggi. We give an explicit finite-state construction of a least favourable probability measure through a strictly convex continuous quadratic knapsack problem over the contamination class. This construction specializes the least favourable measure framework for robust utility maximization and connects it to established resource-allocation algorithms. The auxiliary optimizer is independent of both the utility function and the initial budget. For increasing, strictly concave utility functions satisfying regularity and boundary conditions, optimal terminal wealth is reconstructed through inverse marginal utility and a scalar budget equation. For constant relative risk aversion (CRRA) utility, the budget equation is solved explicitly for every parameter γ > 0, including logarithmic utility when γ = 1. Given the probability vectors, the auxiliary problem can be solved in O ( n log n ) time by sorting and scanning, or in O ( n ) time using median-search algorithms, where n = T + 1. For every fixed γ > 0, CRRA wealth reconstruction also takes O ( n ) operations. This procedure avoids the exponential active-set enumeration used in Algorithm 1 of Petturiti and Vantaggi. We also present an
- Open Access
- 17 September 2026
- Published by Springer Nature in 4OR
- p. 1-29
Biproportional allocation of parliamentary seats via vector apportionment and minimum paths
The Biproportional Apportionment Problem arises in countries which allocate electoral seats at two different territorial levels by a proportional rule. Mathematically, given the constituency/party vote matrix V , vectors c of national party seats and r of constituency seats, the problem is to compute an integer matrix A śś proportional to V whose column- and row- totals correspond to c and r , respectively. To pursue proportionality, one can first find a fractional matrix Q satisfying the above requirements, and then search for an integer matrix A that minimizes the distance from Q . Starting from the Italian electoral law for the Chamber of Deputies, in this paper, we develop a two-phase procedure for BAP which exploits Hare Quota plus Largest Remainders for the seat allocation in the first phase, while, in the second phase, it performs seat transfers by shortest paths on a suitable network. We test our method on real elections of different countries and compare our results with the corresponding institutional allocations. The quality of an apportionment is measured by its distance to the fractional Fair-Share matrix, a benchmark for biproportionality introduced by Balinski and Demange in 1989. The empirical results show that, even if the proposed methods are heuristics, they are able to output high quality solutions. The application to elections in Italy and in other European countries confirms both the effectiveness of the methods and their general applicability.
- 17 September 2026
- Published by Springer Nature in 4OR
- p. 1-29
Open AccessBiproportional allocation of parliamentary seats via vector apportionment and minimum paths
The Biproportional Apportionment Problem arises in countries which allocate electoral seats at two different territorial levels by a proportional rule. Mathematically, given the constituency/party vote matrix V , vectors c of national party seats and r of constituency seats, the problem is to compute an integer matrix A śś proportional to V whose column- and row- totals correspond to c and r , respectively. To pursue proportionality, one can first find a fractional matrix Q satisfying the above requirements, and then search for an integer matrix A that minimizes the distance from Q . Starting from the Italian electoral law for the Chamber of Deputies, in this paper, we develop a two-phase procedure for BAP which exploits Hare Quota plus Largest Remainders for the seat allocation in the first phase, while, in the second phase, it performs seat transfers by shortest paths on a suitable network. We test our method on real elections of different countries and compare our results with the corresponding institutional allocations. The quality of an apportionment is measured by its distance to the fractional Fair-Share matrix, a benchmark for biproportionality introduced by Balinski and Demange in 1989. The empirical results show that, even if the proposed methods are heuristics, they are able to output high quality solutions. The application to elections in Italy and in other European countries confirms both the effectiveness of the methods and their general applicability.
- Open Access
- 9 May 2026
- Published by Springer Nature in TOP
- Vol. 34 (3) , 411-444
Incompatibility graphs in data mining
In this paper, we present a new class of “Incompatibility Graphs”(IG) for Data Mining. They are used in Supervised Learning for Box Clustering problems, where an instance is given by a training set of observations, classified as positive and negative, and the objective is to predict the class of any new observation. The Box Clustering algorithm outputs a set of clusters corresponding to labeled hyper-rectangles (homogeneous boxes). In an IG, the vertices correspond to positive observations (points in $$R^d$$ ), and an edge exists between two vertices if they cannot be clustered together, because all boxes, including both of them contain also some negative points. In this paper, we formalize the notion of IG, and explain how a Box Clustering problem can be modeled using incompatibility graphs. We also show that IGs have an intrinsic interest from a theoretical viewpoint, since we can prove relationships with other well-known graph classes, as, for example, comparability graphs. In particular, for IGs in the plane, we prove strong structural properties, and we provide a list of forbidden induced subgraphs. Furthermore, we show that Incompatibility Graphs can be exploited to solve some key-problems related to Box Clustering, such as the “Maximum Box”and the “Minimum Covering by Boxes”. In fact, we show that these two problems can be formulated as a vertex packing and a vertex coloring on an Incompatibility Graph, respectively, and that one can solve in polynomial time the former and, for two important subclasses of instances, also the latter.- 9 May 2026
- Published by Springer Nature in TOP
- Vol. 34 (3) , 411-444
Open AccessIncompatibility graphs in data mining
In this paper, we present a new class of “Incompatibility Graphs”(IG) for Data Mining. They are used in Supervised Learning for Box Clustering problems, where an instance is given by a training set of observations, classified as positive and negative, and the objective is to predict the class of any new observation. The Box Clustering algorithm outputs a set of clusters corresponding to labeled hyper-rectangles (homogeneous boxes). In an IG, the vertices correspond to positive observations (points in $$R^d$$ ), and an edge exists between two vertices if they cannot be clustered together, because all boxes, including both of them contain also some negative points. In this paper, we formalize the notion of IG, and explain how a Box Clustering problem can be modeled using incompatibility graphs. We also show that IGs have an intrinsic interest from a theoretical viewpoint, since we can prove relationships with other well-known graph classes, as, for example, comparability graphs. In particular, for IGs in the plane, we prove strong structural properties, and we provide a list of forbidden induced subgraphs. Furthermore, we show that Incompatibility Graphs can be exploited to solve some key-problems related to Box Clustering, such as the “Maximum Box”and the “Minimum Covering by Boxes”. In fact, we show that these two problems can be formulated as a vertex packing and a vertex coloring on an Incompatibility Graph, respectively, and that one can solve in polynomial time the former and, for two important subclasses of instances, also the latter. - 1 December 2025
- Published by Springer Nature in Annals of Operations Research
- Vol. 357 (2-3) , 1135-1164
A reduced Mason’s rule for solving linear systems of equations recursively: an application to the integrated ownership problem in a network of companies
- 1 December 2025
- Published by Springer Nature in Annals of Operations Research
- Vol. 357 (2-3) , 1135-1164
A reduced Mason’s rule for solving linear systems of equations recursively: an application to the integrated ownership problem in a network of companies
- Open Access
Managing ESG Ratings Disagreement in Sustainable Portfolio Selection
Sustainable Investing identifies the approach of investors whose aim is twofold: on the one hand, they want to achieve the best compromise between portfolio risk and return, but they also want to take into account the sustainability of their investment, assessed through some Environmental, Social, and Governance (ESG) criteria. The inclusion of sustainable goals in the portfolio selection process may have an actual impact on financial portfolio performance. ESG indices provided by the rating agencies are generally considered good proxies for the performance in sustainability of an investment, as well as, appropriate measures for Socially Responsible Investments (SRI) in the market. In this framework of analysis, the lack of alignment between ratings provided by different agencies is a crucial issue that inevitably undermines the robustness and reliability of these evaluation measures. In fact, the ESG rating disagreement may produce conflicting information, implying a difficulty for the investor in the portfolio ESG evaluation. This may cause underestimation or overestimation of the market opportunities for a sustainable investment. In this paper, we deal with a multi-criteria portfolio selection problem taking into account risk, return, and ESG criteria. For the ESG evaluation of the securities in the market, we consider more than one agency and propose a new approach to overcome the problem related to the disagreement between the ESG ratings by different agencies. We propose a nonlinear optimization model for our three-criteria portfolio selection problem. We show that it can be reformulated as an equivalent convex quadratic program by exploiting a technique known in the literature as the k-sum optimization strategy. An extensive empirical analysis of the performance of this model is provided on real-world financial data sets.
Open AccessManaging ESG Ratings Disagreement in Sustainable Portfolio Selection
Sustainable Investing identifies the approach of investors whose aim is twofold: on the one hand, they want to achieve the best compromise between portfolio risk and return, but they also want to take into account the sustainability of their investment, assessed through some Environmental, Social, and Governance (ESG) criteria. The inclusion of sustainable goals in the portfolio selection process may have an actual impact on financial portfolio performance. ESG indices provided by the rating agencies are generally considered good proxies for the performance in sustainability of an investment, as well as, appropriate measures for Socially Responsible Investments (SRI) in the market. In this framework of analysis, the lack of alignment between ratings provided by different agencies is a crucial issue that inevitably undermines the robustness and reliability of these evaluation measures. In fact, the ESG rating disagreement may produce conflicting information, implying a difficulty for the investor in the portfolio ESG evaluation. This may cause underestimation or overestimation of the market opportunities for a sustainable investment. In this paper, we deal with a multi-criteria portfolio selection problem taking into account risk, return, and ESG criteria. For the ESG evaluation of the securities in the market, we consider more than one agency and propose a new approach to overcome the problem related to the disagreement between the ESG ratings by different agencies. We propose a nonlinear optimization model for our three-criteria portfolio selection problem. We show that it can be reformulated as an equivalent convex quadratic program by exploiting a technique known in the literature as the k-sum optimization strategy. An extensive empirical analysis of the performance of this model is provided on real-world financial data sets.
- 11 July 2023
- Published by Elsevier in European Journal of Operational Research
- Vol. 312 (2) , 700-717
Portfolio optimization through a network approach: Network assortative mixing and portfolio diversification
- 11 July 2023
- Published by Elsevier in European Journal of Operational Research
- Vol. 312 (2) , 700-717
Portfolio optimization through a network approach: Network assortative mixing and portfolio diversification
- Open Access
- 17 August 2021
- Published by Springer Nature in Annals of Operations Research
- Vol. 305 (1-2) , 375-402
Mathematical political districting taking care of minority groups
Political districting (PD) is a wide studied topic in the literature since the 60s. It typically requires a multi-criteria approach, and mathematical programs are frequently suggested to model the many aspects of this difficult problem. This implies that exact models cannot be solved to optimality when the size of the territory is too large. In spite of this, an exact formulation can also be exploited in a heuristic framework to find at least a sub-optimal solution for large size problem instances. We study the design of electoral districts in Mexico, where the population is characterized by the presence of minority groups (“indigenous community”) who have a special right to be represented in the Parliament. For this, the Mexican electoral law prescribes that a fixed number of districts must be designed to support the representation of the indigenous community. We formulate mixed integer linear programs (MILP) following these two principles, but also including the basic PD criteria of contiguity and population balance. The district map is obtained in two stages: first we produce the fixed number of indigenous districts established by the Law; then we complete the district map by forming the non-indigenous districts. This two-phase approach has two advantages: a dedicated objective function can be formulated in Phase 1 to form indigenous districts at best; in the second phase the instance size is reduced (both in the number of territorial units and in the number of districts) so that the computational effort to solve the problem is reduced as well. We test our procedure on the territory of Chiapas in Mexico and on some fictitious problem instances in which the territory is represented by a grid graph. We also compare our district map with the Institutional one currently adopted in Chiapas.
- 17 August 2021
- Published by Springer Nature in Annals of Operations Research
- Vol. 305 (1-2) , 375-402
Open AccessMathematical political districting taking care of minority groups
Political districting (PD) is a wide studied topic in the literature since the 60s. It typically requires a multi-criteria approach, and mathematical programs are frequently suggested to model the many aspects of this difficult problem. This implies that exact models cannot be solved to optimality when the size of the territory is too large. In spite of this, an exact formulation can also be exploited in a heuristic framework to find at least a sub-optimal solution for large size problem instances. We study the design of electoral districts in Mexico, where the population is characterized by the presence of minority groups (“indigenous community”) who have a special right to be represented in the Parliament. For this, the Mexican electoral law prescribes that a fixed number of districts must be designed to support the representation of the indigenous community. We formulate mixed integer linear programs (MILP) following these two principles, but also including the basic PD criteria of contiguity and population balance. The district map is obtained in two stages: first we produce the fixed number of indigenous districts established by the Law; then we complete the district map by forming the non-indigenous districts. This two-phase approach has two advantages: a dedicated objective function can be formulated in Phase 1 to form indigenous districts at best; in the second phase the instance size is reduced (both in the number of territorial units and in the number of districts) so that the computational effort to solve the problem is reduced as well. We test our procedure on the territory of Chiapas in Mexico and on some fictitious problem instances in which the territory is represented by a grid graph. We also compare our district map with the Institutional one currently adopted in Chiapas.
- 1 August 2021
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 299, 1-16
On finding connected balanced partitions of trees
- 1 August 2021
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 299, 1-16
On finding connected balanced partitions of trees
- 1 January 2021
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 289, 78-92
Locating a discrete subtree of minimum variance on trees: New strategies to tackle a very hard problem
- 1 January 2021
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 289, 78-92
Locating a discrete subtree of minimum variance on trees: New strategies to tackle a very hard problem