Ricardo Alberto Marques Pereira
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
Ricardo Alberto Marques Pereira has a total of 52 co-authors. Here are the top co-authors by number of shared publications:
- Silvia Bortot
Department of Economics and Management, University of Trento, Trento, Italy
17 shared publications - José Luis García-Lapresta
IMUVA, PRESAD Research Group, Departamento de Economía Aplicada, Universidad de Valladolid, Valladolid, Spain
8 shared publications - Michele Fedrizzi
University of Trento
7 shared publications Mario Fedrizzi
Univ Trento, Dept Ind Engn, Via Sommar 9, I-38123 Povo, TN, Italy
6 shared publications- Casilda Lasso de la Vega
University of the Basque Country - Department of Applied Economics IV
4 shared publications - Rita Almeida Ribeiro
UNINOVA, CA3
4 shared publications
Latest Publications
- Open Access
- 31 July 2024
- Published by Springer Nature in Soft Computing
- Vol. 28 (23-24) , 13743-13761
Consensus dynamics under asymmetric interactions in low dimensions
We consider a set $$N = \{ 1,\ldots ,n \}$$ , $$n\ge 2$$ , of interacting agents whose individual opinions $$ x_{i}$$ , with $$i \in N $$ , take values in some domain $$\mathbb {D}\subseteq \mathbb {R}$$ . The interaction among the agents represents the degree of reciprocal influence which the agents exert upon each other and it is expressed by a general asymmetric interaction matrix with null diagonal and off-diagonal coefficients in the open unit interval. The present paper examines the asymmetric generalization of the linear consensus dynamics model discussed in previous publications by the same authors, in which symmetric interaction was assumed. We are mainly interested in determining the form of the asymptotic convergence towards the consensual opinion. In this respect, we present some general results plus the study of three particular versions of the linear consensus dynamics, depending on the relation between the interaction structure and the degrees of proneness to evaluation review of the various individual opinions. In the general asymmetric case, the analytic form of the asymptotic consensual solution $$\tilde{x}$$ is highly more complex than that under symmetric interaction, and we have obtained it only in two low-dimensional cases. Nonetheless, we are able to write those complex analytic forms arranging the numerous terms in an intelligible way which might provide useful clues to the open quest for the analytic form of the asymptotic consensual solution in higher-dimensional cases.- 31 July 2024
- Published by Springer Nature in Soft Computing
- Vol. 28 (23-24) , 13743-13761
Open AccessConsensus dynamics under asymmetric interactions in low dimensions
We consider a set $$N = \{ 1,\ldots ,n \}$$ , $$n\ge 2$$ , of interacting agents whose individual opinions $$ x_{i}$$ , with $$i \in N $$ , take values in some domain $$\mathbb {D}\subseteq \mathbb {R}$$ . The interaction among the agents represents the degree of reciprocal influence which the agents exert upon each other and it is expressed by a general asymmetric interaction matrix with null diagonal and off-diagonal coefficients in the open unit interval. The present paper examines the asymmetric generalization of the linear consensus dynamics model discussed in previous publications by the same authors, in which symmetric interaction was assumed. We are mainly interested in determining the form of the asymptotic convergence towards the consensual opinion. In this respect, we present some general results plus the study of three particular versions of the linear consensus dynamics, depending on the relation between the interaction structure and the degrees of proneness to evaluation review of the various individual opinions. In the general asymmetric case, the analytic form of the asymptotic consensual solution $$\tilde{x}$$ is highly more complex than that under symmetric interaction, and we have obtained it only in two low-dimensional cases. Nonetheless, we are able to write those complex analytic forms arranging the numerous terms in an intelligible way which might provide useful clues to the open quest for the analytic form of the asymptotic consensual solution in higher-dimensional cases. - 20 May 2020
- Published by Springer Nature in Decisions in Economics and Finance
- Vol. 43 (2) , 583-611
Shapley and superShapley aggregation emerging from consensus dynamics in the multicriteria Choquet framework
- 20 May 2020
- Published by Springer Nature in Decisions in Economics and Finance
- Vol. 43 (2) , 583-611
Shapley and superShapley aggregation emerging from consensus dynamics in the multicriteria Choquet framework
- 20 November 2019
- Published by Springer Nature in Soft Computing
- Vol. 24 (18) , 13757-13768
Consensus dynamics, network interaction, and Shapley indices in the Choquet framework
- 20 November 2019
- Published by Springer Nature in Soft Computing
- Vol. 24 (18) , 13757-13768
Consensus dynamics, network interaction, and Shapley indices in the Choquet framework
- 27 December 2018
- Published by Hindawi Limited in International Journal of Intelligent Systems
- Vol. 34 (5) , 966-1000
Maximum entropy ordered weighted averaging in the binomial decomposition framework
We consider the maximum entropy constrained optimization problem associated with ordered weighted averaging (OWA) in the binomial decomposition framework. We begin by reviewing the analytic solution of the maximum entropy method proposed by Filev and Yager in 1995, and later by Fullér and Majlender in 2001. Next, we briefly review the binomial decomposition framework, which allows for an alternative parametric description of the OWA functions. The values of the binomial coefficients are uniquely determined by the weighting structure of the OWA function. We observe that for low orness values , the optimal weights are decreasing, whereas they are increasing for high orness values . Moreover, we notice that the optimal values of the first and last weights have a wide range in , whereas the values of the other weights have more restricted ranges. As for the optimal coefficients, we find that their behavior with respect to orness values is very different for low/high orness. We illustrate graphically the optimal coefficients in two parts, first for low orness values and then for high orness values . We observe that the optimal for low orness values are all nonnegative and take values in the unit interval, independently of the dimension . On the contrary, the optimal values of the coefficients for high orness values depend strongly on the dimension , both in the complexity of their distribution and in the amplitude of their scale.
- 27 December 2018
- Published by Hindawi Limited in International Journal of Intelligent Systems
- Vol. 34 (5) , 966-1000
Maximum entropy ordered weighted averaging in the binomial decomposition framework
We consider the maximum entropy constrained optimization problem associated with ordered weighted averaging (OWA) in the binomial decomposition framework. We begin by reviewing the analytic solution of the maximum entropy method proposed by Filev and Yager in 1995, and later by Fullér and Majlender in 2001. Next, we briefly review the binomial decomposition framework, which allows for an alternative parametric description of the OWA functions. The values of the binomial coefficients are uniquely determined by the weighting structure of the OWA function. We observe that for low orness values , the optimal weights are decreasing, whereas they are increasing for high orness values . Moreover, we notice that the optimal values of the first and last weights have a wide range in , whereas the values of the other weights have more restricted ranges. As for the optimal coefficients, we find that their behavior with respect to orness values is very different for low/high orness. We illustrate graphically the optimal coefficients in two parts, first for low orness values and then for high orness values . We observe that the optimal for low orness values are all nonnegative and take values in the unit interval, independently of the dimension . On the contrary, the optimal values of the coefficients for high orness values depend strongly on the dimension , both in the complexity of their distribution and in the amplitude of their scale.
- 1 September 2018
- Published by Elsevier in Information Sciences
- Vol. 460-461, 555-577
The binomial decomposition of generalized Gini welfare functions, the S-Gini and Lorenzen cases
- 1 September 2018
- Published by Elsevier in Information Sciences
- Vol. 460-461, 555-577
The binomial decomposition of generalized Gini welfare functions, the S-Gini and Lorenzen cases
- 1 January 2018
- Published by Wiley in International Journal of Intelligent Systems
- Vol. 33 (1) , 187-212
The binomial decomposition of OWA functions, the 2-additive and 3-additive cases in n dimensions
- 1 January 2018
- Published by Wiley in International Journal of Intelligent Systems
- Vol. 33 (1) , 187-212
The binomial decomposition of OWA functions, the 2-additive and 3-additive cases in n dimensions
- Open Access
- 14 November 2017
- Published by Hindawi Limited in International Journal of Intelligent Systems
- Vol. 33 (1) , 1-2
Issue Information
- 14 November 2017
- Published by Hindawi Limited in International Journal of Intelligent Systems
- Vol. 33 (1) , 1-2
Open AccessIssue Information
- 1 November 2017
- Published by Springer Nature
- p. 149-163
The Soft Consensus Model in the Multidistance Framework
- 1 November 2017
- Published by Springer Nature
- p. 149-163
The Soft Consensus Model in the Multidistance Framework
- 2 July 2017
- Published by Springer Nature
- p. 71-85
The Binomial Decomposition of the Single Parameter Family of GB Welfare Functions
- 2 July 2017
- Published by Springer Nature
- p. 71-85
The Binomial Decomposition of the Single Parameter Family of GB Welfare Functions