In this section, the local stability of the nonlinear inverse problem stated in Theorem 1.2 will be proved following the ideas of  and . The proof is splited in several steps.
In this paper, we advocate using the results of setwise contests between candidates to design social welfare functions that are less myopic than those only based on pairwise comparisons. In this direction, we have studied a k-wise generalization of …
This section is devoted to the proof of Theorem 4. The proof relies on a compactness-uniqueness argument and the observability estimate (Theorem 5) on the whole network.
There aren't more papers