Distributed Algorithmic Mechanism Design
Stub. Mechanism design where the mechanism itself must run as a distributed algorithm over a network with strategic nodes, with interdomain (BGP) routing as the driving example. (AGT ch. 14)
Mechanism design meets distributed computing: the mechanism’s outcome and payments must themselves be computed by a distributed protocol run by the (possibly strategic) participants, not by a trusted center. Interdomain (BGP) routing is the running example of a real system where this constraint bites.
Outline (TODO — flesh out each)
- Two examples of DAMD (distributed algorithmic mechanism design)
- Interdomain routing as a strategic distributed protocol
- Open problems