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.
In multi agent system, how to find a coalition structure making the greatest profits in cooperation in the shortest time is an issue which has been given much attention. When finding the optimal coalition structure, if we make no any restriction on the searching space, we must search all the coalition structures. An anytime algorithm-LVAA(Lateral and Vertical Anytime Algorithm), designed in this paper,...
This paper is concerned with optimal coalition structure generation in multi-agent systems. For characteristic function game representations, we propose a branch and bound technique presented in the form of possible bipartite partitions and upper bound of coalition structure value, these techniques can be incorporated into many potential coalition structure generation algorithms. In order to test...
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.