國立虎尾科技大學 |

Exploring Multiplexity with Evolutionary Game Theory and Complex Networks.

Record Type:	Language materials, manuscript : Monograph/item
Title/Author:	Exploring Multiplexity with Evolutionary Game Theory and Complex Networks./
Author:	Khoo, Tommy.
Description:	1 online resource (165 pages)
Notes:	Source: Dissertation Abstracts International, Volume: 79-10(E), Section: B.
Contained By:	Dissertation Abstracts International79-10B(E).
Subject:	Applied mathematics. -
Online resource:	click for full text (PQDT)
ISBN:	9780438010703

Exploring Multiplexity with Evolutionary Game Theory and Complex Networks.
Khoo, Tommy.

Exploring Multiplexity with Evolutionary Game Theory and Complex Networks. - 1 online resource (165 pages)

Source: Dissertation Abstracts International, Volume: 79-10(E), Section: B.

Thesis (Ph.D.)--Dartmouth College, 2018.

Includes bibliographical references

In recent years, there has been growing interest in studying linked social contexts through the lens of evolutionary games on complex networks. Despite much progress, accounting for this multiplexity is still a challenging task, and many questions remain open. In this thesis, we address the aforementioned issue with a model in which individuals are engaged in two domains of interactions: close proximity neighbors on a spatially embedded lattice network, and distant contacts with random individuals. We then incorporate multiplexity from two different perspectives.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2018

Mode of access: World Wide Web

ISBN: 9780438010703Subjects--Topical Terms:

1069907
Applied mathematics.
Index Terms--Genre/Form:

554714
Electronic books.

Exploring Multiplexity with Evolutionary Game Theory and Complex Networks.
LDR:03799ntm a2200397Ki 4500 001 918588
005 20181026115419.5
006 m o u
007 cr mn||||a|a||
008 190606s2018 xx obm 000 0 eng d
020 $a 9780438010703
035 $a (MiAaPQ)AAI10823899
035 $a (MiAaPQ)dartmouth:11380
035 $a AAI10823899
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Khoo, Tommy. $3 1192945
245 1 0 $a Exploring Multiplexity with Evolutionary Game Theory and Complex Networks.
264 0 $c 2018
300 $a 1 online resource (165 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertation Abstracts International, Volume: 79-10(E), Section: B.
500 $a Advisers: Scott Pauls; Feng Fu.
502 $a Thesis (Ph.D.)--Dartmouth College, 2018.
504 $a Includes bibliographical references
520 $a In recent years, there has been growing interest in studying linked social contexts through the lens of evolutionary games on complex networks. Despite much progress, accounting for this multiplexity is still a challenging task, and many questions remain open. In this thesis, we address the aforementioned issue with a model in which individuals are engaged in two domains of interactions: close proximity neighbors on a spatially embedded lattice network, and distant contacts with random individuals. We then incorporate multiplexity from two different perspectives.
520 $a We start by distinguishing the modifiability of links: ties with close neighbors are fixed, while long-range ties to random individuals are rewirable. Using a coevolutionary model of cooperation and partner rewiring range preference, we find resultant partner networks that are highly degree-heterogeneous, with low average shortest path lengths, while retaining high clustering, and thus possess small-world properties. We also discover an optimal availability of reputation information for the emergence of cooperators who form distant partnerships at a cost to themselves.
520 $a We then derive analytical solutions for a simpler model, and find a threshold frequency of partner switching that triggers a phase transition from full defection to cooperation. We also demonstrate how heterogenous social popularity can emerge in this simplified model.
520 $a Next, we disallow partner rewiring, and instead explore multiplexity from the perspective of cross-context interference, or spillover, of strategic behaviors between two distinct games. Individuals play the iterated Prisoner's Dilemma with neighbors on the lattice, and the one-shot Prisoner's Dilemma with random partners. We derive analytical results using extended pair approximation, which shows good agreement with extensive simulations.
520 $a Our investigation indicates that increasing the magnitude of spillover can encourage cooperation, provided cooperation is favored in one of the games, but too much spillover is deleterious. We also observe a bistability phenomenon: whether spillover benefits cooperation depends on initial proportions of cooperation in each game. Furthermore, comparing strategy combinations arising from each spillover mode effectively indicates the outcome of their coevolutionary dynamics with cooperation.
520 $a Our results are experimentally testable, inspire future research, and shed light on the evolution of cooperation across social realms.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2018
538 $a Mode of access: World Wide Web
650 4 $a Applied mathematics. $3 1069907
650 4 $a Behavioral sciences. $3 1148596
655 7 $a Electronic books. $2 local $3 554714
690 $a 0364
690 $a 0602
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a Dartmouth College. $b Mathematics. $3 1192946
773 0 $t Dissertation Abstracts International $g 79-10B(E).
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10823899 $z click for full text (PQDT)