Graph Games (Game Theory)
The Shapley value for directed graph games
... cooperative games with transferable utility (TU games) is the Shapley value [7] which is defined as the average of the marginal contribution vectors corresponding to all permutations on the player ...TU ...
9
Average tree solutions for graph games
... are games with communication structures (see, e.g. Myerson [9]), games with permission structures (see, ...[5]), games with precedence constraints (see, ...of games restricted on regular ...
23
Compensations in the Shapley value and the compensation solutions for graph games
... communication graph is a forest, each player is the root of exactly one rooted spanning ...of graph games, the compensation solution can be characterized by the axioms of component efficiency and ...
20
PP 2019 03: Graph Games and Logic Design
... What happens to the winning positions, say, in the sabotage game, as the size of the finite graphs goes to infinity? Now there is a link with logic here. The Zero-One Law for first-order logic says that, for each ...
21
A Characterization of the Average Tree Solution for Cycle-Free Graph Games
... cycle-free graph. A directed graph is a pair (N, D), where N is the set of nodes and D is the set of directed edges (ordered pairs of nodes), ...undirected graph case, we can define the notion of ...
14
The Component Fairness Solution for Cycle- Free Graph Games
... a link between two players yields for both players the same change in payoff. Clearly, the Myerson value is the average of all marginal vectors of v L and is guaranteed to be in the core if the restricted game is convex. ...
17
MT-DP 2014/18 On the Core of Directed Acyclic Graph Games
... acyclic graph games lie somewhere between standard tree games and monotonic minimum cost spanning tree ...acyclic graph is that determining the cost of a coalition becomes computationally ...
29
The average covering tree value for directed graph games
... the graph is ...digraph games with complete communication structure the average covering tree value equals to the Shapley value ...undirected graph games by taking the directed analog of an ...
18
Optimal Network Security Hardening Using Attack Graph Games
... We compare DP to other two approaches that can compute the optimal policy for an attack graph. The first method converts the AG it to an Unconstrained Influence Diagram (UID) as described in [16] and uses GUIDO ...
8
Optimal Network Security Hardening Using Attack Graph Games
... We compare DP to other two approaches that can compute the optimal policy for an attack graph. The first method converts the AG it to an Unconstrained Influence Diagram (UID) as described in [Lis´y and P´ıbil, ...
7
Average Tree Solution and Core for Cooperative Games with Graph Structure
... underlying graph is complete and with the average tree solution as defined by Herings et ...ing graph is ...for graph games. For games with complete graph, link-convexity ...
24
Graph parsing with s graph grammars
... 3.1 The HR algebra of graphs with sources Our grammars describe how to build graphs from smaller pieces. They do this by accessing nodes (called source nodes) which are assigned “public names”. We define an ...
10
Graph Neural Tangent Kernel: Fusing Graph Neural Networks with Graph Kernels
... including graph isomorphism network (GIN) [Xu et al., 2019a], graph con- volutional network (GCN) [Kipf and Welling, 2016], and GNN with jumping knowledge [Xu et ...benchmark graph classification ...
11
Criminal Offence of Illegal Games in Croatia: Chain Games - Games without Borders
... chain games. In the modern Croatian criminal legislation chain games are regulated within the offence of illegal games of chance and even deprived of the own legal ...of games of chance and ...
32
On the planarity of line Mycielskian graph of a graph
... planar graph G is the minimum number of vertices not belonging to the boundary of the exterior region in any embed- ding of G in the ...A graph G is said to be k - minimally nonouterplanar if i(G) = k, k ≥ ...
11
A Study on the Inj Equitable Graph of a Graph
... equitable graph of a graph IE G ( ) and the injective equitable graph IE ...Inj-equitable graph of some graph’s ...a graph and the lower degree injective equitable number are ...
10
Topics in graph colouring and graph structures
... a graph on n vertices containing o(n 3 ) triangles can be made triangle- free by the removal of o(n 2 ) edges (where we say that a graph G contains k copies of a graph H if G has, as subgraphs, k ...
292
Product Cordial Graph in the Context of Some Graph Operations on Gear Graph
... some graph elements in gear ...gear graph. Similar problems can be discussed for the graph obtained by duplication of an edge in gear ...these graph operations of wheel graph, helm ...
9
Some Graph Labelings on Middle Graph of Extended Duplicate Graph of a Path
... of graph labeling was introduced by Rosa in 1967. A graph labeling is an assignment of integers to the vertices or edges or both subject to certain ...duplicate graph was introduced by Thirusangu, et ...
6
Extrapolation in games of coordination and dominance solvable games
... We also find some evidence for ‘naive extrapolation’ (or learning about successful strategies, irrespective of the strategic context). In particular, we find that in the first round of the 3x3 game subjects are relatively ...
21