Designing Networks with Good Equilibria under Uncertainty

Abstract

We consider the problem of designing network costsharing protocols with good equilibria under uncertainty. The underlying game is a multicast game in a rooted undirected graph with nonnegative edge costs. A set of k terminal vertices or players need to establish connectivity with the root. The social optimum is the Minimum Steiner Tree. We are interested in… (More)

Topics

4 Figures and Tables

Slides referencing similar topics