Chiara Mocenni
Course on Game Theory
Lecture of May 31, 2019: Comparison of the replicator equation on graphs and the standard replicator equation for different graph topologies
24
0
0
Testo completo
(2)
(3)
(4)
(5)
(6)
(7)
(8)
(9)
(10)
(11)
(12)
(13)
(14)
(15)
(16)
(17)
(18)
(19)
(20)
(21)
(22)
(23)
(24)
Documenti correlati
The shortestPaths(landmarks) method of the GraphFrame class returns the length of the shortest path(s) from each vertex to a given set of landmarks vertexes. For each
The previous discussion shows that any finite simple graph which is dual to some simplicial complex is the dual graph of a ring.. However, not all finite simple graphs are dual to
The dual graph is also defined for a pure simplicial complex ∆..
Infinite population of equal individuals (players or replicators) Each individual exhibits a certain phenotype (= it is.. preprogrammed to play a
In the critical power p = 2, it was shown in [5, Theorem 3.3] that the ground state on the metric graph G with exactly one half-line (e.g., on the tadpole graph T ) is attained if
Therefore the intersection graph of ideals of the lattice L is isomorphic to the graph with vertex-set L \ {0, 1} in which two distinct vertices a and b are adjacent if and only if a
The degree graph of a finite group G, that we denote by ∆(G), is defined as the (simple undirected) prime graph related to the set cd(G) of the irreducible complex character degrees
