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.
Based on the market characteristics of water rights trade in China, the bidding strategies and benefit functions of both trade sides under the water rights quasi-market are proposed, then the cooperative game model for water rights trade is established, and the Nash bargaining solution of the model is given. In order to illustrate the model, a cooperative game model for water trade between industry...
In this paper, a swarm intelligence based quality of service (QoS) unicast routing scheme is proposed for self-organized network (SON). The inaccurate routing information is described with fuzzy methods whilst the utilities of both the user and the network provider are taken into account by applying gaming. Based on AntNet algorithm, a QoS unicast path is found on which Pareto optimum is approached...
In this paper, a QoS handoff decision scheme with ABC (always best connected) supported is proposed, and an optimal handoff solution of assigning N terminals to M access networks is found based on niche PSO algorithm. With help of gaming analysis, Pareto optimum under Nash equilibrium of user utility and network provider utility is achieved or approached for the found solution.
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.