3 problems

Let $V$ be a set of $n$ agents that build a connected graph $G=(V,E)$, where each agent buys a set of edges and pays an edge cost of $\alpha$ for every edge it buys, in addition to…

A distance-uniform graph is a graph in which the relevant distance distributions are uniform, as defined in the surrounding discussion. Logarithmic-diameter conjecture. Distance-un…

Let $N=\{1,\ldots,n\}$ be the set of players, let $\alpha>0$ be the link cost, and let a strategy profile determine a communication network on $N$. The cost of player $i$ is … The…