Results 231 to 240 of about 5,615 (251)
Some of the next articles are maybe not open access.

Solving the Coalition Structure Generation Problem with MaxSAT

2012 IEEE 24th International Conference on Tools with Artificial Intelligence, 2012
Coalition Structure Generation (CSG), a main research issue in the domain of coalition games, involves partitioning agents into exhaustive and disjoint coalitions so that the social welfare is optimized. The advent of compact representation schemes, such as marginal contribution networks (MC-nets), promotes the efficiency of solving the CSG problem. In
Xiaojuan Liao   +3 more
openaire   +1 more source

Coalition structure generation with the graphics processing unit

International Joint Conference on Autonomous Agents and Multiagent Systems, 2014
Coalition Structure Generation---the problem of finding the optimal division of agents into coalitions---has received considerable attention in recent AI literature. The fastest exact algorithm to solve this problem is IDP-IP$^*$, which is a hybrid of two previous algorithms, namely IDP and IP.
Krzysztof Pawlowski   +5 more
openaire   +2 more sources

An anytime algorithm for optimal coalition structure generation

2010 Sixth International Conference on Natural Computation, 2010
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.
Zhenrong Zhang, Wei Zhang, Jinglei Liu
openaire   +1 more source

A Generalization of the Social Coalitional Equilibrium Structure

大阪大学経済学, 2020
論文 ; We generalize the notion of Ichiishi (1981)’s social coalitional equilibrium to the multiple coalition structures, so that different industries having independent coalition-deviation opportunities and their industrial organizations are simultaneously determined.
Urai, Ken   +3 more
openaire   +2 more sources

Anytime dynamic programming for coalition structure generation

International Joint Conference on Autonomous Agents and Multiagent Systems, 2010
Determining the optimal coalition structure is a central problem in multi-agent systems. Two popular techniques include dynamic programming and anytime search algorithms. Dynamic programming algorithms guarantee an optimal solution and have the best worst case running time.
Travis C. Service, Julie A. Adams
openaire   +2 more sources

A Local Adaptive Perfect Coalition Structure Generation Problem Considering Coalition Breakup

2015 IIAI 4th International Congress on Advanced Applied Informatics, 2015
Forming effective coalitions is a major issue in multiagent systems. The existing coalition structure generation (CSG) algorithms fail to determine the structure 's robustness because agent withdrawals cannot be identified in all the coalition structures.
Katsuya Nakano   +3 more
openaire   +1 more source

A general coalition structure: some equivalence results [PDF]

open access: possible, 2013
The formation of coalition may imply some theoretical difficulties, such as costs arising from forming a coalition or sharing information among agents. In this paper we will assume that only a subset S of the set of all possible coalitions in an economy is the set of admissible coalitions. We define the S-core concept, as in Hervs-Moreno.
openaire   +3 more sources

An anytime algorithm for optimal simultaneous coalition structure generation and assignment

Autonomous Agents and Multi-Agent Systems, 2020
Fredrik Präntare   +2 more
exaly  

Home - About - Disclaimer - Privacy