<p>Fraction of games solved (y-axis) as a function of the number of global communicators (x-axis); all other nodes communicate locally.</p
Using network control structures this paper introduces network communication games as a generalizati...
The problem of solving a parity game is at the core of many problems in model checking, satisfiabili...
TU games with two-level communication structure, in which a two-level communication structure relate...
<p><b>A</b>: differences in success rate of none, local, and global communication grouped by network...
<p>The fraction of nodes is a function of the fraction of links retained by the filters. The dash li...
We introduce an efficient solution for games with communication graph structures and show that it is...
We introduce an efficient solution for games with communication graph structures and show that it is...
<p>Number of components analysed that have a given percentage of explained nodes (i.e. nodes that ha...
A communication situation consists of a coalitional game and a graph, the nodes of the graph corresp...
<p>The average number of neighbors of “majority” nodes who are global communicators (Red, dashed), a...
Fraction of cooperators fc as a function of m for different r on network of different degree k. (a) ...
A population of players is considered in which each player may select his neighbors in order to play...
<p>Fraction of friendship and contact links as a function of the number of features shared by two st...
<p>The cooperation level as a function of for different distributions of , i.e., fixed, uniform, ex...
We introduce an efficient solution for games with communication graph structures and show that it is...
Using network control structures this paper introduces network communication games as a generalizati...
The problem of solving a parity game is at the core of many problems in model checking, satisfiabili...
TU games with two-level communication structure, in which a two-level communication structure relate...
<p><b>A</b>: differences in success rate of none, local, and global communication grouped by network...
<p>The fraction of nodes is a function of the fraction of links retained by the filters. The dash li...
We introduce an efficient solution for games with communication graph structures and show that it is...
We introduce an efficient solution for games with communication graph structures and show that it is...
<p>Number of components analysed that have a given percentage of explained nodes (i.e. nodes that ha...
A communication situation consists of a coalitional game and a graph, the nodes of the graph corresp...
<p>The average number of neighbors of “majority” nodes who are global communicators (Red, dashed), a...
Fraction of cooperators fc as a function of m for different r on network of different degree k. (a) ...
A population of players is considered in which each player may select his neighbors in order to play...
<p>Fraction of friendship and contact links as a function of the number of features shared by two st...
<p>The cooperation level as a function of for different distributions of , i.e., fixed, uniform, ex...
We introduce an efficient solution for games with communication graph structures and show that it is...
Using network control structures this paper introduces network communication games as a generalizati...
The problem of solving a parity game is at the core of many problems in model checking, satisfiabili...
TU games with two-level communication structure, in which a two-level communication structure relate...
DOI
Add to ORKG