Engineering Applications of Artificial Intelligence, 2020,
91, p. art. 103577 [20 p.] ISSN 0952-1976
We consider multiple self-interested bounded-rational agents each of which has a goal it needs to achieve. Goals are achievable by executing a set of interdependent tasks. Some tasks exhibit time dependencies and may require sequential execution. For each agent, there may be several alternative sets of tasks that can achieve the goal. Execution of alternatives, may be more beneficial when done by a group of agents and not by a single agent. To jointly achieve goals, agents may form interdependent coalitions. Such coalition formation is computationally intractable. We nevertheless seek a practical solution that is not necessarily optimal yet acceptable by the agents. A solution where agents examine only coalitions in which they are members is inapplicable, as externalities are a major factor given task interdependencies. In this paper we study this coalition formation problem. We describe the problem and introduce a novel Multi-lateral Negotiation Protocol (MNP) that solves it by forming interdependent coalitions. We allow agents to heuristically make gradual concessions, revise their proposals and converge on specific alternatives, and nevertheless increase their expected gains.
