Routing in cost-shared networks: equilibria and dynamics by Debmalya Panigrahi (Part 2)
30 views · Published 14 July 2016 · 1:02:34 · Indexed 14 November 2026
Channel: International Centre for Theoretical Sciences · 2016 · Science & Technology
Games, Epidemics and Behavior URL: http://www.icts.res.in/discussion_meeting/geb2016/ DATES: Monday 27 Jun, 2016 - Friday 01 Jul, 2016 VENUE : Madhava lecture hall, ICTS Bangalore DESCRIPTION: The two main goals of this Discussion Meeting are: 1. To explore the foundations of policy design for controlling epidemics, using a broad class of epidemic games on complex networks involving uncertainty in network information, temporal evolution and learning and 2. To gain a better understanding of information flow that could assist in elucidating the complex mechanisms that underlie a variety of human dynamics and organizations giving rise to the ongoing Cambrian-style explosion in online social media. It will bring together topics in mathematical epidemiology, game theory and multi-agent systems, discrete dynamical systems, complex networks and economics, and will present new connections and opportunities for collaboration to participants. Some of the specific technical issues we expect to be discussed include: Behavioral and game theoretical models on epidemic dynamics Design of interventions to control epidemics and policy planning Co-evolution of epidemics, behavior and network structure Evolutionary games in epidemics Agent-based models of epidemics Phase transitions and critical phenomena Clustering and community formation Diffusion and spread of information Synchronization and rendezvous Structure and function of interdependent networks Cascades and Shocks Random walks Contagion and influence Chaos and nonlinear dynamics ORGANIZERS: Deeparnab Chakrabarty, Niloy Ganguly, Rajmohan Rajaraman and Ravi Sundaram Table of Contents (powered by https://videoken.com) 0:00:00 for 0:00:03 evolution and learning 0:00:07 Routing in cost-shared networks: equilibria and dynamics 0:00:12 we saw earlier 0:02:00 what if agents can join and leave the network? 0:06:09 UT 0:07:43 only need to show this for phase 1 0:26:21 when are the balls non-intersecting? 0:42:37 if the controller suggests (improving) moves to attain equilibrium between arrival/departure phases 0:43:53 partition graph into subgraphs of diameter 2k, for 1 k s log 0:49:02 hope: vertices with edges of same length are well separated 0:51:08 repeat 0:52:30 how do we extend to multiple arrivals/departures? 0:53:43 open: can we find any equilibrium in polynomial time? 0:57:25 thank you
More from this channel
-
49:14
The Universe Unravelled - P. James Peebles
-
1:04:26
The Origin of Life - from geophysics to biology - Albert Libchaber
-
1:15:34
Advances in Graphene, Majorana Fermions, Quantum Computation ( 2 ) - Sankar Das Sarma
-
1:14:26
Applied String Theory (Lecture 2) Dam Thanh Son
-
1:03:07
The Generalized Ramanujan Conjectures and Applications (Lecture 4) by Peter Sarnak
-
1:59:54
Scattering Without Space Time (Lecture 3) Nima Arkani Hamed
-
1:02:19
The Quantum Phases of Matter (Lecture 3) by Subir Sachdev
-
1:15:10
The Generalized Ramanujan Conjectures and Applications (Lecture 3) by Peter Sarnak