Guilherme Ramos
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
Guilherme Ramos has a total of 34 co-authors. Here are the top co-authors by number of shared publications:
- Sergio Pequito
Department of Electrical and Computer Engineering, Instituto Superior Tcnico, University of Lisbon, Lisbon, Portugal
17 shared publications - Ludovico Boratto
University of Cagliari, Cagliari, Italy
14 shared publications - Mirko Marras
University of Cagliari, Cagliari, Italy
9 shared publications - Antonio Pedro Aguiar
Research Center for Systems and Technologies (SYSTEC-ARISE), Faculty of Engineering, University of Porto, Porto, Portugal
6 shared publications - Daniel Silvestre
School of Science and Technology, the NOVA University of Lisbon, Caparica, Portugal
5 shared publications Carlos Caleiro
SQIG—Instituto de Telecomunicações, Department of Mathematics, Instituto Superior Técnico, University of Lisbon, Lisbon, Portugal
4 shared publications
Latest Publications
- Open Access
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 7702-7706
Beyond Naive Disparity: A Size-Matched Audit of Demographic Effects in User-Agnostic Ranking
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 7702-7706
Open AccessBeyond Naive Disparity: A Size-Matched Audit of Demographic Effects in User-Agnostic Ranking
- Open Access
- 5 November 2026
- Published by Elsevier in Systems & Control Letters
- Vol. 219
Byzantine-resilient random number generation via average consensus
- 5 November 2026
- Published by Elsevier in Systems & Control Letters
- Vol. 219
Open AccessByzantine-resilient random number generation via average consensus
- Open Access
- 23 July 2026
- Published by Elsevier in European Journal of Control
Dynamics augmentation for robust structural controllability of bidirected networks
- 23 July 2026
- Published by Elsevier in European Journal of Control
Open AccessDynamics augmentation for robust structural controllability of bidirected networks
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 4069-4073
Temporal User-Agnostic Ranking: Detecting Preference Evolution while Preserving Ethical Principles
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 4069-4073
Open AccessTemporal User-Agnostic Ranking: Detecting Preference Evolution while Preserving Ethical Principles
- Open Access
- 16 April 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 44 (4) , 1-22
Statistical Filtering for Fair Item Ranking
Online item ranking systems are crucial for digital marketplaces, directly influencing user experience and vendor revenue. Traditional reputation-based ranking systems weight ratings according to user reputation scores. They have proven effective against manipulation but raise significant ethical concerns regarding user discrimination and privacy, and may raise concerns under emerging regulatory frameworks in certain application contexts. While a user-agnostic ranking system was recently introduced as an alternative approach that uses statistical filtering instead of user reputation scores, its theoretical foundations and resistance to bribing strategies remained unexplored. In this article, we provide the first comprehensive theoretical analysis of user-agnostic ranking system’s robustness properties. We establish formal bounds on bribing resistance by proving three key properties: strategy composition conditions, profitability constraints, and statistical validity requirements. Our theoretical framework demonstrates that profitable bribing strategies in this class of system must satisfy strict statistical conditions, making manipulation more difficult than in reputation-based systems. Experimental evaluation on three real-world datasets confirms our theoretical findings, showing that user-agnostic ranking systems can achieve superior bribing resistance while maintaining comparable effectiveness and efficiency.
- 16 April 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 44 (4) , 1-22
Open AccessStatistical Filtering for Fair Item Ranking
Online item ranking systems are crucial for digital marketplaces, directly influencing user experience and vendor revenue. Traditional reputation-based ranking systems weight ratings according to user reputation scores. They have proven effective against manipulation but raise significant ethical concerns regarding user discrimination and privacy, and may raise concerns under emerging regulatory frameworks in certain application contexts. While a user-agnostic ranking system was recently introduced as an alternative approach that uses statistical filtering instead of user reputation scores, its theoretical foundations and resistance to bribing strategies remained unexplored. In this article, we provide the first comprehensive theoretical analysis of user-agnostic ranking system’s robustness properties. We establish formal bounds on bribing resistance by proving three key properties: strategy composition conditions, profitability constraints, and statistical validity requirements. Our theoretical framework demonstrates that profitable bribing strategies in this class of system must satisfy strict statistical conditions, making manipulation more difficult than in reputation-based systems. Experimental evaluation on three real-world datasets confirms our theoretical findings, showing that user-agnostic ranking systems can achieve superior bribing resistance while maintaining comparable effectiveness and efficiency.
- Open Access
- 25 March 2026
- Published by Elsevier in European Journal of Control
- Vol. 89
Statistical resilience: A parameter-free approach to ethical consensus
- 25 March 2026
- Published by Elsevier in European Journal of Control
- Vol. 89
Open AccessStatistical resilience: A parameter-free approach to ethical consensus
- 25 March 2026
- Published by Springer Nature
- p. 497-511
Bribery-Resistant Ranking Systems: A Multipartite User-Agnostic Framework for AI Act Compliance
- 25 March 2026
- Published by Springer Nature
- p. 497-511
Bribery-Resistant Ranking Systems: A Multipartite User-Agnostic Framework for AI Act Compliance
- Open Access
- 3 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 19794-19807
Accelerating Average Consensus in Dynamical Networks Without Compromising Accuracy, Privacy, or Resilience
Many distributed systems require consensus that is accurate, private, and resilient to adversaries, yet per-round payloads are fixed, making convergence speed the dominant communications/energy cost. We introduce a two-stage offline weight-design method that (i) respects a local state-augmentation scheme ensuring structural non-observability of each agent's initial value, and (ii) optimizes weights on all exclusion-set subnetworks that support resilience to up to f adversarial agents under a first-deviation rule. We prove that the optimized weights preserve consensus correctness and the privacy/resilience structure, and we minimize a spectral proxy (the second-largest eigenvalue modulus) for the convergence rate under row-stochastic and sparsity constraints. On Erdős–Rényi and Watts–Strogatz digraphs with injected adversaries, the method reduces iterations to ϵ-accuracy by 30–42% (median across 50 trials per setting), with unchanged per-round communication; thus total neighbor transmissions fall proportionally. We report offline compute costs, sensitivity to detection thresholds, and release code to reproduce all results.
- 3 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 19794-19807
Open AccessAccelerating Average Consensus in Dynamical Networks Without Compromising Accuracy, Privacy, or Resilience
Many distributed systems require consensus that is accurate, private, and resilient to adversaries, yet per-round payloads are fixed, making convergence speed the dominant communications/energy cost. We introduce a two-stage offline weight-design method that (i) respects a local state-augmentation scheme ensuring structural non-observability of each agent's initial value, and (ii) optimizes weights on all exclusion-set subnetworks that support resilience to up to f adversarial agents under a first-deviation rule. We prove that the optimized weights preserve consensus correctness and the privacy/resilience structure, and we minimize a spectral proxy (the second-largest eigenvalue modulus) for the convergence rate under row-stochastic and sparsity constraints. On Erdős–Rényi and Watts–Strogatz digraphs with injected adversaries, the method reduces iterations to ϵ-accuracy by 30–42% (median across 50 trials per setting), with unchanged per-round communication; thus total neighbor transmissions fall proportionally. We report offline compute costs, sensitivity to detection thresholds, and release code to reproduce all results.
- Open Access
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 160036-160058
Accurate, Private, and Resilient Distributed Optimization via Network Augmentation
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 160036-160058
Open AccessAccurate, Private, and Resilient Distributed Optimization via Network Augmentation