2013
DOI: 10.1016/j.automatica.2013.08.008
|View full text |Cite
|
Sign up to set email alerts
|

Algebraic formulation and strategy optimization for a class of evolutionary networked games via semi-tensor product method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
50
0

Year Published

2016
2016
2019
2019

Publication Types

Select...
8

Relationship

3
5

Authors

Journals

citations
Cited by 137 publications
(54 citation statements)
references
References 26 publications
(27 reference statements)
0
50
0
Order By: Relevance
“…Combining the above deduction with (11) and (12) in Lemma 3, we conclude that (14) holds for t = t 0 + 1 and then by induction holds for any t ≥ t 0 . In fact, a much stronger statement than Proposition 1 can be made, which shows the invariant state/set is also globally attractive.…”
Section: Proof: For a Biased Population It Holds Thatmentioning
confidence: 80%
See 1 more Smart Citation
“…Combining the above deduction with (11) and (12) in Lemma 3, we conclude that (14) holds for t = t 0 + 1 and then by induction holds for any t ≥ t 0 . In fact, a much stronger statement than Proposition 1 can be made, which shows the invariant state/set is also globally attractive.…”
Section: Proof: For a Biased Population It Holds Thatmentioning
confidence: 80%
“…So from Lemma 1 we know that if an SD i , i > k p , agent is active at t 0 , her strategy at t 0 + 1 remains to defect, which proves (11). Now we prove (12). At x n SDj ) = n * SD kp (5) = ⇒ n C (t 0 ) < n * SD kp −1…”
Section: B Proof Of Lemmamentioning
confidence: 99%
“…A normal evolutionary networked game consists of three basic components [25,29]: (ii) A two-person symmetric game at each period G := (S, A), where S := {s 1 , s 2 , . .…”
Section: Evolutionary Networked Game Modelmentioning
confidence: 99%
“…Up to now, many fundamental results have been presented for the analysis and control of Boolean networks [13][14][15][16][17][18][19][20][21], the coloring problem [22], the design of shifting register [23], the fault detection [24], and so on. In addition, since the dynamics of a finite game can be modeled as a logical network [25], the semi-tensor product method has also been applied to the study of game theory [25][26][27][28].…”
Section: Introductionmentioning
confidence: 99%
“…In addition, the STP method has reached some meaningful conclusions on probabilistic logical networks, such as [24][25][26][27][28][29][30][31][32][33] . Furthermore, it is noted that the STP tool has been used in the investigation of game theory [34,35] . In [34] , the STP was used to formulate NEGs and a kind of algebraic expression was obtained.…”
Section: Introductionmentioning
confidence: 99%