Intergovernmental collaboration is needed to address global problems. Modern solutions to these problems often include data-driven methods like artificial intelligence (AI), which require large amounts of data to perform well. As AI emerges as a central catalyst in deriving effective solutions for global problems, the infrastructure that supports its data needs becomes crucial. However, data sharing between governments is often constrained due to socio-technical barriers such as concerns over data privacy, data sovereignty issues, and the risks of information misuse. Federated learning (FL) presents a promising solution as a decentralized AI methodology, enabling the use of data from multiple silos without necessitating central aggregation. Instead of sharing raw data, governments can build their own models and just share the model parameters with a central server aggregating all parameters, resulting in a superior overall model. By conducting a structured literature review, we show how major intergovernmental data-sharing challenges listed by the Organisation for Economic Co-operation and Development can be overcome by utilizing FL. Furthermore, we provide a tangible resource implementing FL linked to the Ukrainian refugee crisis that can be utilized by researchers and policymakers alike who want to implement FL in cases where data cannot be shared. Enhanced AI while maintaining privacy through FL thus allows governments to collaboratively address global problems, positively impacting governments and citizens.

We study 2-stage game-theoretic problem oriented 3-stage service policy computing, convolutional neural network (CNN) based algorithm design, and simulation for a blockchained buffering system with federated learning. More precisely, based on the game-theoretic problem consisting of both “win-lose” and “win-win” 2-stage competitions, we derive a 3-stage dynamical service policy via a saddle point to a zero-sum game problem and a Nash equilibrium point to a non-zero-sum game problem. This policy is concerning users-selection, dynamic pricing, and online rate resource allocation via stable digital currency for the system. The main focus is on the design and analysis of the joint 3-stage service policy for given queue/environment state dependent pricing and utility functions. The asymptotic optimality and fairness of this dynamic service policy is justified by diffusion modeling with approximation theory. A general CNN based policy computing algorithm flow chart along the line of the so-called big model framework is presented. Simulation case studies are conducted for the system with three users, where only two of the three users can be selected into the service by a zero-sum dual cost game competition policy at a time point. Then, the selected two users get into service and share the system rate service resource through a non-zero-sum dual cost game competition policy. Applications of our policy in the future blockchain based Internet (e.g., metaverse and web3.0) and supply chain finance are also briefly illustrated.