Network Games

Strategic network formation, diffusion, influence maximization, centrality as power.
TUTORIALS

Network Games

Strategic network formation, diffusion, influence maximization, centrality as power.

Braess’s paradox — when adding roads makes traffic worse

network-games
braess-paradox
routing-games
price-of-anarchy

Implement Braess’s paradox in R, compute Wardrop equilibrium flows on networks with selfish routing, demonstrate how adding capacity can increase total latency, and compare the price of anarchy across network topologies.

May 8, 2026

Congestion games and potential functions

network-games
congestion-games
potential-games
braess-paradox

Implement Rosenthal’s congestion games with Monderer-Shapley potential functions, demonstrate the existence of pure Nash equilibria, and visualise Braess’s paradox in a traffic network.

May 8, 2026

Strategic network formation — who links with whom?

network-games
network-formation
pairwise-stability

Implement the Jackson-Wolinsky connections model in R, analyse pairwise stability and efficiency of network structures, and visualise the tension between stable and efficient networks using igraph.

May 8, 2026

Public goods provision on networks

network-games
public-goods
network-topology
free-riding

Public goods games played on networks where contributions benefit neighbours: how network topology — star, circle, and random graphs — shapes equilibrium provision, free-riding by central agents, and aggregate welfare through best-response dynamics on adjacency matrices.

May 8, 2026

Two-sided markets and platform competition

network-games
two-sided-markets
platform-economics
network-externalities

Model platform markets as two-sided network games with cross-side externalities, analyzing pricing structure, platform competition, tipping, and multihoming.

May 8, 2026
No matching items
Back to top