Enrico Bozzo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Enrico Bozzo has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Massimo Franceschet
University of Udine
11 shared publications - Federico Fontana
HCI Lab, Department of Mathematics, Computer Science and Physics, University of Udine, Udine, Italy
4 shared publications - Alberto Bernardini
Dipartimento di Elettronica, Informazione e Bioingegneria, Politecnico di Milano, Milan, Italy
3 shared publications - Franca Rinaldi
Department of Mathematics and Computer Science Department of Mathematics and Computer Science Department of Mathematics and Computer Science University of Udine University of Udine University of Udine
2 shared publications - Paolo Vidoni
Department of Economics and Statistics, University of Udine, Udine, Italy
2 shared publications - Augusto Sarti
Dipartimento di Elettronica, Informazione e Bioingegneria, Politecnico di Milano, 20133 Milan, Italy
1 shared publication
Latest Publications
- Open Access
- 9 March 2026
- Published by Elsevier in SSRN Electronic Journal
Token-based Voting Systems
Token-based voting systems are increasingly adopted in digital governance contexts such as decentralized autonomous organizations and participatory budgeting, yet their standard aggregation rules often lead to undesirable outcomes, including oligarchic dominance or voter apathy. This paper introduces a general mathematical framework for token-based voting that interpolates between one-person-one-vote and one-token-onevote paradigms through the notion of radical voting functions. These functions map voting tokens to actual votes via concave transformations that preserve incentives for participation while compressing excessive voting power. We formalize consensus as an aggregation of transformed votes and study its structural properties using tools from convex analysis and majorization theory. We show that radical voting functions reward broad and evenly distributed support and penalize highly concentrated voting patterns, thereby favoring pluralistic outcomes over individualistic ones. Quadratic voting emerges as a special case within this framework, characterized by linear marginal voting costs. The analysis is extended to account for voter heterogeneity by incorporating similarity measures into the consensus function, linking voting outcomes to diversity among participants. Overall, the framework provides a principled foundation for designing voting mechanisms that balance merit, inclusiveness, and resistance to capture in token-based governance systems.
- 9 March 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessToken-based Voting Systems
Token-based voting systems are increasingly adopted in digital governance contexts such as decentralized autonomous organizations and participatory budgeting, yet their standard aggregation rules often lead to undesirable outcomes, including oligarchic dominance or voter apathy. This paper introduces a general mathematical framework for token-based voting that interpolates between one-person-one-vote and one-token-onevote paradigms through the notion of radical voting functions. These functions map voting tokens to actual votes via concave transformations that preserve incentives for participation while compressing excessive voting power. We formalize consensus as an aggregation of transformed votes and study its structural properties using tools from convex analysis and majorization theory. We show that radical voting functions reward broad and evenly distributed support and penalize highly concentrated voting patterns, thereby favoring pluralistic outcomes over individualistic ones. Quadratic voting emerges as a special case within this framework, characterized by linear marginal voting costs. The analysis is extended to account for voter heterogeneity by incorporating similarity measures into the consensus function, linking voting outcomes to diversity among participants. Overall, the framework provides a principled foundation for designing voting mechanisms that balance merit, inclusiveness, and resistance to capture in token-based governance systems.
- Open Access
- 19 February 2026
- Published by Elsevier in SSRN Electronic Journal
Token-based Voting Systems
Token-based voting systems are increasingly adopted in digital governance contexts such as decentralized autonomous organizations and participatory budgeting, yet their standard aggregation rules often lead to undesirable outcomes, including oligarchic dominance or voter apathy. This paper introduces a general mathematical framework for token-based voting that interpolates between one-person-one-vote and one-token-one-vote paradigms through the notion of radical voting functions. These functions map voting tokens to actual votes via concave transformations that preserve incentives for participation while compressing excessive voting power. We formalize consensus as an aggregation of transformed votes and study its structural properties using tools from convex analysis and majorization theory. We show that radical voting functions reward broad and evenly distributed support and penalize highly concentrated voting patterns, thereby favoring pluralistic outcomes over individualistic ones. Quadratic voting emerges as a special case within this framework, characterized by linear marginal voting costs. The analysis is extended to account for voter heterogeneity by incorporating similarity measures into the consensus function, linking voting outcomes to diversity among participants. Overall, the framework provides a principled foundation for designing voting mechanisms that balance merit, inclusiveness, and resistance to capture in token-based governance systems.
- 19 February 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessToken-based Voting Systems
Token-based voting systems are increasingly adopted in digital governance contexts such as decentralized autonomous organizations and participatory budgeting, yet their standard aggregation rules often lead to undesirable outcomes, including oligarchic dominance or voter apathy. This paper introduces a general mathematical framework for token-based voting that interpolates between one-person-one-vote and one-token-one-vote paradigms through the notion of radical voting functions. These functions map voting tokens to actual votes via concave transformations that preserve incentives for participation while compressing excessive voting power. We formalize consensus as an aggregation of transformed votes and study its structural properties using tools from convex analysis and majorization theory. We show that radical voting functions reward broad and evenly distributed support and penalize highly concentrated voting patterns, thereby favoring pluralistic outcomes over individualistic ones. Quadratic voting emerges as a special case within this framework, characterized by linear marginal voting costs. The analysis is extended to account for voter heterogeneity by incorporating similarity measures into the consensus function, linking voting outcomes to diversity among participants. Overall, the framework provides a principled foundation for designing voting mechanisms that balance merit, inclusiveness, and resistance to capture in token-based governance systems.
- 6 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 72 (5) , 2314-2326
Wave Digital Extended Fixed-Point Solvers for Circuits With Multiple One-Port Nonlinearities
Wave Digital Filter (WDF) theory has been widely used to design nonlinear digital filters that behave like reference analog circuits, especially in the field of Virtual Analog modeling, i.e., the digital emulation of audio circuits. WDF principles allow us to implement circuits with one nonlinearity in an explicit fashion, by properly setting the free parameters that are introduced in the Wave Digital (WD) domain. Although this property does not extend to the WDF realization of circuits with multiple nonlinearities, which instead requires the use of iterative solvers, a proper setting of the free parameters is beneficial also in these cases, in terms of both robustness and efficiency of the implementation. In particular, recent research shows that a common optimal policy for the setting of free parameters can be adopted when either a WD fixed-point method or a WD Newton-Raphson (NR) method is used to solve the same nonlinear circuit. In this work, we present a class of WD extended fixed-point solvers with order from zero to infinity that generalizes the aforementioned iterative methods; the zero-order case corresponds to the existent WD fixed-point method, while the infinite-order case to WD NR. The proposed solvers do not require to compute inverse Jacobian matrices and are characterized by superlinear speed of convergence. Moreover, we show that the very same policy of free parameter setting can be applied independently of the order, causing, in any case, an increase of robustness and convergence speed.
- 6 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 72 (5) , 2314-2326
Wave Digital Extended Fixed-Point Solvers for Circuits With Multiple One-Port Nonlinearities
Wave Digital Filter (WDF) theory has been widely used to design nonlinear digital filters that behave like reference analog circuits, especially in the field of Virtual Analog modeling, i.e., the digital emulation of audio circuits. WDF principles allow us to implement circuits with one nonlinearity in an explicit fashion, by properly setting the free parameters that are introduced in the Wave Digital (WD) domain. Although this property does not extend to the WDF realization of circuits with multiple nonlinearities, which instead requires the use of iterative solvers, a proper setting of the free parameters is beneficial also in these cases, in terms of both robustness and efficiency of the implementation. In particular, recent research shows that a common optimal policy for the setting of free parameters can be adopted when either a WD fixed-point method or a WD Newton-Raphson (NR) method is used to solve the same nonlinear circuit. In this work, we present a class of WD extended fixed-point solvers with order from zero to infinity that generalizes the aforementioned iterative methods; the zero-order case corresponds to the existent WD fixed-point method, while the infinite-order case to WD NR. The proposed solvers do not require to compute inverse Jacobian matrices and are characterized by superlinear speed of convergence. Moreover, we show that the very same policy of free parameter setting can be applied independently of the order, causing, in any case, an increase of robustness and convergence speed.
- Open Access
Sparse identification of time delay systems via pseudospectral collocation
We present a pragmatic approach to the sparse identification of nonlinear dynamics for systems with discrete delays. It relies on approximating the underlying delay model with a system of ordinary differential equations via pseudospectral collocation. To minimize the reconstruction error, the new strategy avoids optimizing all possible multiple unknown delays, identifying only the maximum one. The computational burden is thus greatly reduced, improving the performance of recent implementations that work directly on the delay system.
Open AccessSparse identification of time delay systems via pseudospectral collocation
We present a pragmatic approach to the sparse identification of nonlinear dynamics for systems with discrete delays. It relies on approximating the underlying delay model with a system of ordinary differential equations via pseudospectral collocation. To minimize the reconstruction error, the new strategy avoids optimizing all possible multiple unknown delays, identifying only the maximum one. The computational burden is thus greatly reduced, improving the performance of recent implementations that work directly on the delay system.
- Open Access
- 11 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 30 (10709908) , 848-852
Extended Fixed-Point Methods for the Computation of Virtual Analog Models
A family of iterative root-finding methods for nonlinear discrete-time systems of equations is presented, with a formulation that puts it in between the Fixed-Point (FP) and Newton-Raphson (NR) methods. Applicability of this family is allowed, provided that the Jacobian matrix of the nonlinear system has a spectral radius less than one. By varying the order of a matrix geometric sum that approximates the inverse Jacobian matrix, root-finding at any iteration can be steered toward the FP or conversely toward the NR method, becoming identical to either of them if the order is equal to zero or infinitely large, respectively. Since the methods in this family do not need the solution of a linear system at each iteration as required by NR, their computational cost makes them palatable for the online digital implementation of nonlinear models. As an example of application, a Virtual Analog model of the voltage-controlled filter onboard a popular music synthesizer is tested, showing that for some orders of the aforementioned geometric sum the proposed methods perform better than FP and NR in terms of computational cost, while exhibiting the same accuracy.
- 11 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 30 (10709908) , 848-852
Open AccessExtended Fixed-Point Methods for the Computation of Virtual Analog Models
A family of iterative root-finding methods for nonlinear discrete-time systems of equations is presented, with a formulation that puts it in between the Fixed-Point (FP) and Newton-Raphson (NR) methods. Applicability of this family is allowed, provided that the Jacobian matrix of the nonlinear system has a spectral radius less than one. By varying the order of a matrix geometric sum that approximates the inverse Jacobian matrix, root-finding at any iteration can be steered toward the FP or conversely toward the NR method, becoming identical to either of them if the order is equal to zero or infinitely large, respectively. Since the methods in this family do not need the solution of a linear system at each iteration as required by NR, their computational cost makes them palatable for the online digital implementation of nonlinear models. As an example of application, a Virtual Analog model of the voltage-controlled filter onboard a popular music synthesizer is tested, showing that for some orders of the aforementioned geometric sum the proposed methods perform better than FP and NR in terms of computational cost, while exhibiting the same accuracy.
- Open Access
- 14 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 7, 2317-2322
On the Impact of Agents With Influenced Opinions in the Swarm Social Behavior
We consider a simplified version of the Taylor model, typically used in the collective dynamics of continuous exchange of opinions, to describe the properties of swarm formation in the presence of external sources of influence or prejudices affecting a number of agents in the network. Such external sources are responsible for the breakdown of the consensus equilibrium and directly influence certain other individuals in the network, which we denote as quasi-stubborn agents. These quasi-stubborn agents participate in consensus with other individuals, but are able to indirectly influence the opinions of the entire system. In particular, we show that the swarm in steady-state moves towards the convex hull of the opinions of the quasi-stubborn agents. This is an interesting result that allows a more accurate estimation of the final opinions in a social network. In the case of two prejudiced agents, an explicit expression of the stationary opinions is provided in terms of the Moore-Penrose inverse of the Laplacian of the graph. Numerical simulations are presented to illustrate the properties of the considered model.
- 14 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 7, 2317-2322
Open AccessOn the Impact of Agents With Influenced Opinions in the Swarm Social Behavior
We consider a simplified version of the Taylor model, typically used in the collective dynamics of continuous exchange of opinions, to describe the properties of swarm formation in the presence of external sources of influence or prejudices affecting a number of agents in the network. Such external sources are responsible for the breakdown of the consensus equilibrium and directly influence certain other individuals in the network, which we denote as quasi-stubborn agents. These quasi-stubborn agents participate in consensus with other individuals, but are able to indirectly influence the opinions of the entire system. In particular, we show that the swarm in steady-state moves towards the convex hull of the opinions of the quasi-stubborn agents. This is an interesting result that allows a more accurate estimation of the final opinions in a social network. In the case of two prejudiced agents, an explicit expression of the stationary opinions is provided in terms of the Moore-Penrose inverse of the Laplacian of the graph. Numerical simulations are presented to illustrate the properties of the considered model.
- 13 May 2022
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 71 (10) , 1730-1735
The Jordan and Frobenius pairs of the inverse
Given a matrix there exists a nonsingular matrix such that , where J is a very sparse matrix with a diagonal block structure, known as the Jordan canonical form (JCF) of . Assume that is nonsingular and that and are given. How to obtain and such that and is the JCF of ? Curiously, the answer involves the Pascal matrix. For the Frobenius canonical form (FCF), where blocks are companion matrices, the analogous question has a very simple answer. Jordan blocks and companions are non-derogatory lower Hessenberg matrices. The answers to the two questions will be obtained by solving two linear matrix equations involving these matrices.- 13 May 2022
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 71 (10) , 1730-1735
The Jordan and Frobenius pairs of the inverse
Given a matrix there exists a nonsingular matrix such that , where J is a very sparse matrix with a diagonal block structure, known as the Jordan canonical form (JCF) of . Assume that is nonsingular and that and are given. How to obtain and such that and is the JCF of ? Curiously, the answer involves the Pascal matrix. For the Frobenius canonical form (FCF), where blocks are companion matrices, the analogous question has a very simple answer. Jordan blocks and companions are non-derogatory lower Hessenberg matrices. The answers to the two questions will be obtained by solving two linear matrix equations involving these matrices.- 27 May 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Audio, Speech, and Language Processing
- Vol. 29 (23299290) , 2162-2173
A Wave Digital Newton-Raphson Method for Virtual Analog Modeling of Audio Circuits with Multiple One-Port Nonlinearities
The digital implementation of a nonlinear audio circuit often employs the Newton-Raphson (NR) method for solving the corresponding system of implicit ordinary differential equations in the discrete-time domain. Although its quadratic convergence speed makes NR attractive for real-time audio applications, quadratic convergence is not always guaranteed, since it depends on initial conditions, and also divergence might occur. For this reason, especially in the context of Virtual Analog modeling, techniques for increasing the robustness of NR are in order. Among the various approaches, the Wave Digital (WD) formalism recently showed potential to rethink traditional circuit simulation methods. In this manuscript, we discuss an original formulation of the NR method in the WD domain for the solution of audio circuits with multiple one-port nonlinearities. We provide an in-depth theoretical analysis of the proposed iterative method and we show how its quadratic convergence strongly depends on the free parameters (called port resistances) introduced when modeling the reference circuit in the WD domain. In particular, we demonstrate that the size of the basin where the WD NR solver can be initialized to converge on a solution with quadratic speed is a function of the free parameters. We also show that by setting each port resistance value as close as possible to the derivative w.r.t. current of the nonlinear element vi characteristic we keep the basin size large. We finally implement an audio ring modulator circuit with four diodes in order to test the proposed iterative method.
- 27 May 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Audio, Speech, and Language Processing
- Vol. 29 (23299290) , 2162-2173
A Wave Digital Newton-Raphson Method for Virtual Analog Modeling of Audio Circuits with Multiple One-Port Nonlinearities
The digital implementation of a nonlinear audio circuit often employs the Newton-Raphson (NR) method for solving the corresponding system of implicit ordinary differential equations in the discrete-time domain. Although its quadratic convergence speed makes NR attractive for real-time audio applications, quadratic convergence is not always guaranteed, since it depends on initial conditions, and also divergence might occur. For this reason, especially in the context of Virtual Analog modeling, techniques for increasing the robustness of NR are in order. Among the various approaches, the Wave Digital (WD) formalism recently showed potential to rethink traditional circuit simulation methods. In this manuscript, we discuss an original formulation of the NR method in the WD domain for the solution of audio circuits with multiple one-port nonlinearities. We provide an in-depth theoretical analysis of the proposed iterative method and we show how its quadratic convergence strongly depends on the free parameters (called port resistances) introduced when modeling the reference circuit in the WD domain. In particular, we demonstrate that the size of the basin where the WD NR solver can be initialized to converge on a solution with quadratic speed is a function of the free parameters. We also show that by setting each port resistance value as close as possible to the derivative w.r.t. current of the nonlinear element vi characteristic we keep the basin size large. We finally implement an audio ring modulator circuit with four diodes in order to test the proposed iterative method.
- 1 May 2021
- Published by Pleiades Publishing Ltd in Computational Mathematics and Mathematical Physics
- Vol. 61 (5) , 674-683
Algebras Closed by J-Hermitianity in Displacement Formulas
We introduce the notion of \(J\)-Hermitianity of a matrix, as a generalization of Hermitianity, and, more generally, of closure by \(J\)-Hermitianity of a set of matrices. Many well known algebras, like upper and lower triangular Toeplitz, Circulants and \(\tau \) matrices, as well as certain algebras that have dimension higher than the matrix order, turn out to be closed by \(J\)-Hermitianity. As an application, we generalize some theorems about displacement decompositions presented in [1, 2], by assuming the matrix algebras involved closed by \(J\)-Hermitianity. Even if such hypothesis on the structure is not necessary in the case of algebras generated by one matrix, as it has been proved in [3], our result is relevant because it could yield new low complexity displacement formulas involving not one-matrix-generated commutative algebras.- 1 May 2021
- Published by Pleiades Publishing Ltd in Computational Mathematics and Mathematical Physics
- Vol. 61 (5) , 674-683
Algebras Closed by J-Hermitianity in Displacement Formulas
We introduce the notion of \(J\)-Hermitianity of a matrix, as a generalization of Hermitianity, and, more generally, of closure by \(J\)-Hermitianity of a set of matrices. Many well known algebras, like upper and lower triangular Toeplitz, Circulants and \(\tau \) matrices, as well as certain algebras that have dimension higher than the matrix order, turn out to be closed by \(J\)-Hermitianity. As an application, we generalize some theorems about displacement decompositions presented in [1, 2], by assuming the matrix algebras involved closed by \(J\)-Hermitianity. Even if such hypothesis on the structure is not necessary in the case of algebras generated by one matrix, as it has been proved in [3], our result is relevant because it could yield new low complexity displacement formulas involving not one-matrix-generated commutative algebras.- 8 April 2020
- Published by Walter de Gruyter GmbH in Journal of Quantitative Analysis in Sports
- Vol. 16 (3) , 255-269
A parametric family of Massey-type methods: inference, prediction, and sensitivity
We study the stability of a time-aware version of the popular Massey method, previously introduced by Franceschet, M., E. Bozzo, and P. Vidoni. 2017. “The Temporalized Massey’s Method.” Journal of Quantitative Analysis in Sports 13: 37–48, for rating teams in sport competitions. To this end, we embed the temporal Massey method in the theory of time-varying averaging algorithms, which are dynamic systems mainly used in control theory for multi-agent coordination. We also introduce a parametric family of Massey-type methods and show that the original and time-aware Massey versions are, in some sense, particular instances of it. Finally, we discuss the key features of this general family of rating procedures, focusing on inferential and predictive issues and on sensitivity to upsets and modifications of the schedule.
- 8 April 2020
- Published by Walter de Gruyter GmbH in Journal of Quantitative Analysis in Sports
- Vol. 16 (3) , 255-269
A parametric family of Massey-type methods: inference, prediction, and sensitivity
We study the stability of a time-aware version of the popular Massey method, previously introduced by Franceschet, M., E. Bozzo, and P. Vidoni. 2017. “The Temporalized Massey’s Method.” Journal of Quantitative Analysis in Sports 13: 37–48, for rating teams in sport competitions. To this end, we embed the temporal Massey method in the theory of time-varying averaging algorithms, which are dynamic systems mainly used in control theory for multi-agent coordination. We also introduce a parametric family of Massey-type methods and show that the original and time-aware Massey versions are, in some sense, particular instances of it. Finally, we discuss the key features of this general family of rating procedures, focusing on inferential and predictive issues and on sensitivity to upsets and modifications of the schedule.