In the paper, a new class of dynamic game models with a moving information horizon or dynamic updating is studied. In this class of games, players do not have full information about the game structure (motion equations, payoff functions) on the interval on which the game is defined. It is supposed that the players at each stage of the dynamic game have only truncated information about the game structure defined by the information horizon. Cooperative and noncooperative settings are considered in the paper. Results are illustrated using the oligopoly advertising game model, and comparison between the solution in the initial game model and in the game model with moving information horizon is presented. Simulation results are presented.
This paper discusses the dynamic Shapley Value in two-stage minimum cost spanning tree game. The cooperative behavior of players is defined. The characteristic function along the cooperative trajectory is computed and the Shapley Value for two-stage and one stage games is defined. Using the IDP(imputation distribution procedure) the dynamic Shapley Value is constructed.
Next-generation wireless networks are characterized by two essential features: ubiquitous connectivity and high-speed data transmission. The realization of these features hinges on the development of rational resource allocation strategies to optimize the utilization of radio resources. This study addresses the beamforming design problem for downlink transmission in multi-cell cellular networks, with a focus on maximizing user data rates while adhering to stringent power constraints. To tackle this challenge, we propose a novel graph learning-based optimization framework that learns the mapping from channel states to beamforming vectors in an unsupervised manner. At the core of this framework is an attention-based graph neural network (GNN), which efficiently captures complex inter-node relationships by dynamically computing the importance of neighboring nodes. Furthermore, a jumping knowledge network is integrated to enhance structural representation learning, enabling the model to adaptively capture diverse neighborhood ranges for each node and mitigate the issue of over-smoothing. Extensive simulations demonstrate that the proposed algorithm significantly outperforms existing benchmark methods, exhibiting robust performance and strong generalization capabilities across a wide range of system parameter configurations.