KAUST Ph.D. students David Evangelista and Xianjin Yang won best paper awards at international conferences this summer for their work in mean-field game theory. Evangelista's paper focused on solutions for stationary mean-field games with congestion, while Yang's paper developed numerical methods for homogenization problems. The awards were presented at the 18th International Symposium on Dynamic Games and Applications in France and the 12th American Institute of Mathematical Sciences (AIMS) Conference in Taiwan. Why it matters: The recognition highlights KAUST's strength in applied mathematics and computational science, specifically in the emerging field of mean-field games with applications across various domains.
This paper introduces DaringFed, a novel dynamic Bayesian persuasion pricing mechanism for online federated learning (OFL) that addresses the challenge of two-sided incomplete information (TII) regarding resources. It formulates the interaction between the server and clients as a dynamic signaling and pricing allocation problem within a Bayesian persuasion game, demonstrating the existence of a unique Bayesian persuasion Nash equilibrium. Evaluations on real and synthetic datasets demonstrate that DaringFed optimizes accuracy and convergence speed and improves the server's utility.
Munther Dahleh from MIT gave a talk on information design under uncertainty, focusing on the challenges of creating an information marketplace. The talk addressed the externality faced by firms when information is allocated to competitors, and considered two models for this externality. The presentation included mechanisms for both models and highlighted the impact of competition on the revenue collected by the seller. Why it matters: The research advances understanding of information markets and mechanism design, relevant to the growing data economy in the GCC region.
This paper addresses exploration in reinforcement learning (RL) in unknown environments with sparse rewards, focusing on maximum entropy exploration. It introduces a game-theoretic algorithm for visitation entropy maximization with improved sample complexity of O(H^3S^2A/ε^2). For trajectory entropy, the paper presents an algorithm with O(poly(S, A, H)/ε) complexity, showing the statistical advantage of regularized MDPs for exploration. Why it matters: The research offers new techniques to reduce the sample complexity of RL, potentially enhancing the efficiency of AI agents in complex environments.
Prof. Daniel Panario gave a seminar on irreducible polynomials over finite fields and their applications in cryptography. The seminar covered how finite fields are used as basic components in many cryptographic applications. It surveyed families of irreducible polynomials and commented on their properties. Why it matters: The talk highlights the mathematical foundations and ongoing research relevant to cryptographic implementations in the region.
This paper introduces rational counterfactuals, a method for identifying counterfactuals that maximize the attainment of a desired consequent. The approach aims to identify the antecedent that leads to a specific outcome for rational decision-making. The theory is applied to identify variable values that contribute to peace, such as Allies, Contingency, Distance, Major Power, Capability, Democracy, and Economic Interdependency. Why it matters: The research provides a framework for analyzing and promoting conditions conducive to peace using counterfactual reasoning.
The Robotics, Intelligent Systems, and Control (RISC) lab at KAUST is developing swarm robotics, enabling robots to work together on collaborative tasks with limited human supervision. RISC is using game theory to improve how robots make coordinated decisions in scenarios like engaging intruders or tracking oil spills. The lab is also researching programmable self-assembly for robot swarms. Why it matters: This research advances autonomous multi-agent systems for critical applications like search and rescue and environmental monitoring in the region.
Conor McMenamin from Universitat Pompeu Fabra presented a seminar on State Machine Replication (SMR) without honest participants. The talk covered the limitations of current SMR protocols and introduced the ByRa model, a framework for player characterization free of honest participants. He then described FAIRSICAL, a sandbox SMR protocol, and discussed how the ideas could be extended to real-world protocols, with a focus on blockchains and cryptocurrencies. Why it matters: This research on SMR protocols and their incentive compatibility could lead to more robust and secure blockchain technologies in the region.