Efficient and Robust Routing in the Presence of Competing Interests

About this video

Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidence

Addresses routing efficiency when agents have competing interests in networks. Teaches game-theoretic and algorithmic approaches to resource allocation.

A 72-minute video from Microsoft Research: “Efficient and Robust Routing in the Presence of Competing Interests”.

Video by Microsoft Research, played through YouTube's embedded player.