Cooperative game theory is a branch of (micro-) economics that studies the behavior of self-
interested agents in strategic settings where binding agreements among agents are …

This paper deals with the problem of classical planning for multiple cooperative agents who
have private information about their local state and capabilities they do not want to reveal …

Multiagent planning is computationally hard in the general case due to the exponential
blowup in the action space induced by concurrent action of different agents. At the same …

If the complexity of planning for a single agent is described by some function f of the input,
how much more difficult is it to plan for a team of n cooperating agents? If these agents are …

In many real-world settings, the structure of the environment constrains the formation of
coalitions among agents. These settings can be represented by characteristic function …

The computational complexity of relevant corerelated questions for coalitional games is
addressed from the coalition structure viewpoint, ie, without assuming that the grand …

As our world becomes better connected and autonomous agents no longer appear to be
science fiction, a natural need arises for enabling groups of selfish agents to cooperate in …

Aggregating preferences over combinatorial domains has many applications in artificial
intelligence (AI). Given the inherent exponential nature of preferences over combinatorial …

In many real-world settings, the structure of the environment constrains the formation of
coalitions among agents. Therefore, examining the stability of formed coalition structures in …

The framework of cooperative games with overlap** coalitions (OCF games), which was
proposed by Chalkiadakis et al.[1], generalizes classic cooperative games to settings where …