Related papers: A Branch and Bound Algorithm for Coalition Structu…
We propose a novel framework for value function factorization in multi-agent deep reinforcement learning (MARL) using graph neural networks (GNNs). In particular, we consider the team of agents as the set of nodes of a complete directed…
We introduce the partition function of edge-colored graph homomorphisms, of which the usual partition function of graph homomorphisms is a specialization, and present an efficient algorithm to approximate it in a certain domain. Corollaries…
In this paper, we consider networks with topologies described by some connected undirected graph ${\mathcal{G}}=(V, E)$ and with some agents (fusion centers) equipped with processing power and local peer-to-peer communication, and…
Let $G$ be graph with vertex set $V$ and order $n=|V|$. A coalition in $G$ is a combination of two distinct sets, $A\subseteq V$ and $B\subseteq V$, which are disjoint and are not dominating sets of $G$, but $A\cup B$ is a dominating set of…
We construct a new quantum algorithm for the graph collision problem; that is, the problem of deciding whether the set of marked vertices contains a pair of adjacent vertices in a known graph G. The query complexity of our algorithm is…
Particle competition and cooperation (PCC) is a graph-based semi-supervised learning approach. When PCC is applied to interactive image segmentation tasks, pixels are converted into network nodes, and each node is connected to its k-nearest…
Coalition formation is a key topic in multi-agent systems. Coalitions enable agents to achieve goals that they may not have been able to achieve on their own. Previous work has shown problems in coalitional games to be computationally hard.…
It has been recently shown that numerical semiparametric bounds on the expected payoff of fi- nancial or actuarial instruments can be computed using semidefinite programming. However, this approach has practical limitations. Here we use…
Graph Crossing Number is a fundamental problem with various applications. In this problem, the goal is to draw an input graph $G$ in the plane so as to minimize the number of crossings between the images of its edges. Despite extensive…
Motivated by the increasing need to understand the distributed algorithmic foundations of large-scale graph computations, we study some fundamental graph problems in a message-passing model for distributed computing where $k \geq 2$…
We consider the Banzhaf-Coleman and Owen power indices for weighted majority games modified by a coalition configuration. We present calculation algorithms of them that make use of the method of generating functions. We programmed the…
\noindent A paired coalition in a graph $G=(V,E)$ consists of two disjoint sets of vertices $V_1$ and $V_2$, neither of which is a paired dominating set but whose union $V_1 \cup V_2$ is a paired dominating set. A paired coalition partition…
A subset $D \subseteq V$ is a dominating set of a graph $G$ with vertex set $V$ if every vertex $v \in V \setminus D$ is adjacent to a vertex in $D$. Two subsets of $V$ form a coalition if neither of them is a dominating set, but their…
Capacity sharing networks are typical heterogeneous communication networks widely applied in information and communications technology (ICT) field. In such networks, resources like bandwidth, spectrum, computation and storage are shared…
We study a new formulation of the team-formation problem, where the goal is to form teams to work on a given set of tasks requiring different skills. Deviating from the classic problem setting where one is asking to cover all skills of each…
Given a graph $G=(V,E)$, the minimum branch vertices problem consists in finding a spanning tree $T=(V,E')$ of $G$ minimizing the number of vertices with degree greater than two. We consider a simple combinatorial lower bound for the…
\noindent A perfect dominating set in a graph $G=(V,E)$ is a subset $S \subseteq V$ such that each vertex in $V \setminus S$ has exactly one neighbor in $S$. A perfect coalition in $G$ consists of two disjoint sets of vertices $V_i$ and…
Given an n-vertex graph G, a drawing of G in the plane is a mapping of its vertices into points of the plane, and its edges into continuous curves, connecting the images of their endpoints. A crossing in such a drawing is a point where two…
The reassembling of a simple connected graph G = (V,E) is an abstraction of a problem arising in earlier studies of network analysis. The reassembling process has a simple formulation (there are several equivalent formulations) relative to…
We examine cooperative games where the viability of a coalition is determined by whether or not its members have the ability to communicate amongst themselves independently of non-members. This necessary condition for viability was proposed…