- This event has passed.
Jeong Ok Choi (최정옥), Various game-theoretic models on graphs
Tuesday, October 27, 2020 @ 4:30 PM - 5:30 PM KST
We introduce some of well-known game-theoretic graph models and related problems.
A contagion game model explains how an innovation diffuses over a given network structure and focuses on finding conditions on which structure an innovation becomes epidemic. Regular infinite graphs are interesting examples to explore. We show that regular infinite trees make an innovation least advantageous to be epidemic considering the whole class of infinite regular graphs.
A network creation game model, on the other hand, tries to explain the dynamics on forming a network structure when each vertex plays independently and selfishly. An important question is how costly a formation can be made without any central coordination, and the concept of Price of Anarchy (PoA) is introduced. In the model originally suggested by Fabrikant et al., PoA measures how bad the forming cost can be at Nash equilibria compared to absolute minimum, and they conjectured that this inefficiency can happen only when some tree structures are formed (Tree Conjecture). We will introduce recent progress on this tree conjecture, remaining open problems, and possible variations.
This talk includes part of joint work with Unjong Yu.