The Border Gateway Protocol (BGP) handles the task of establishing routes between the smaller networks that make up the Internet, known as Autononous Systems (ASes). BGP is a simple distributed protocol that instructs each AS to continuously make greedy and myopic route choices.

We discuss two important desiderata in interdomain routing: BGP convergence to a ``stable'' solution, and incentive-compatibility of BGP. In particular, we show that two stable solutions always imply a BGP oscillation (thus closing a long-standing open question).
In addition, we show that well-known security enhancements of BGP are incentive-compatible.

Based on joint works with Hagay Levin, Rahul Sami, and Aviv Zoha