Let G= (V, E) be a graph with p vertices and q edges. A graph G={V, E} with p vertices and q edges is said to be a Permutation labelling graph if there exists a bijection function f from set of all vertice G( ) to {1, 2,3... }p such that the induced edge labelling function h E G N : ( ) → is...

OmniGraph, a novel representation to support a range of NLP classification tasks, integrates lexical items, syntactic dependencies and frame semantic parses into graphs. Feature engineering is folded into the learning through convolution graph kernel learning to explore different extents of the...

This paper starts from the doctoral thesis on non-cooperative games by John Forbes Nash and applies a multidimensional coordinate space approach to visualize a full model of non-cooperative games in the same graphical space and time, with infinity equilibrium points, solutions, strong solutions,...

We introduce the two-step average tree value for transferable utility games with restricted cooperation represented by undirected communication graphs or hypergraphs. The solution can be considered as an alternative for both the average tree solution for graph games and the average tree value...

The purpose of this research is to understand the profitability of finance companies in Indonesia. The method of research using a time series analysis. The data used are secondary data sourced from the Financial Sevices Authority. The method of analysis used in this research is the graph method...

In this paper we introduce two values for cooperative games with communication graph structure. For cooperative games the shapley value distributes the worth of the grand coalition amongst the players by taking into account the worths that can be obtained by any coalition of players, but does...