The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper concentrates on seeking the generalized Nash equilibria of network aggregative games by using a distributed continuous-time algorithm. By considering the variational inequality related to the problem, we design a distributed algorithm seeking the variational equilibria, which are practically an essential part of generalized Nash equilibrium points. Then the novel distributed projected continuous-time...
In this paper, we investigate a distributed Nash equilibrium seeking problem for a class of aggregative games that the strategic interaction is characterized by a sum of nonlinear mapping of heterogeneous local decisions. We consider non-quadratic local cost functions and constrained strategy sets. We propose a novel continuous-time distributed algorithm for equilibrium seeking based on dynamic average...
Based on the analysis of affecting factors of the coal industry structure, the method for taking eco-efficiency as the standard evaluation criterion of coal enterprises is proposed. The eco-efficiency supervise game model is established to analyze local governments' action and coal enterprises' action in the process of policy implementation. In the end, some strategy is given based on the analysis...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.