Academia.eduAcademia.edu

Figure 2 – uploaded by narayan changder

See full PDFdownloadDownload figure
Figure 1: All the subspaces of CSG, given ten agents. The shaded area indicates the subspaces that are explored when IDP finishes evaluating all the coalitions of size four. The white colored subspaces have not yet been searched. Ini- tially, ODSS assigns IDPSET to IDP and IPSET to IP in order to search for the optimal coalition structure.

Figure 1 All the subspaces of CSG, given ten agents. The shaded area indicates the subspaces that are explored when IDP finishes evaluating all the coalitions of size four. The white colored subspaces have not yet been searched. Ini- tially, ODSS assigns IDPSET to IDP and IPSET to IP in order to search for the optimal coalition structure.

Related Figures (5)

Figure 2: The number of subspaces in IDPSET and IPSET for different numbers of agents.
Figure 2: The number of subspaces in IDPSET and IPSET for different numbers of agents.
Output: Optimal coalition structure CS* and its value.
Output: Optimal coalition structure CS* and its value.
Figure 3: Time performance of ODP-IP vs. ODSS. Here, time is measured in seconds.
Figure 3: Time performance of ODP-IP vs. ODSS. Here, time is measured in seconds.
Figure 4: The optimal coalition structure location percentage in IDPSET and IPSET.
Figure 4: The optimal coalition structure location percentage in IDPSET and IPSET.
Related topics:
Computer Science
580 California St., Suite 400
San Francisco, CA, 94104
© 2025 Academia. All rights reserved