Received Almost a decade ago, Girard invented linear logic with the notion of proof-net. Proof-nets are special graphs built from formulas, links and boxes. However, not all nets are proof-nets. Firstly, they must be well constructed (we say that such graphs are proof-structures). Secondly, a proof-net is a proof-structure that corresponds to a sequential proof. It must verify a correctness cri...

Consensus problems in time-varying networks are studied in this paper. We consider two cases. In the first case, the networks are basically connected and the conditions for reaching consensus are described by means of the algebraic properties of connectivity for network graph. In the second case, the networks are possibly disconnected all time. A concept called integral connectivity of networks...

In most financial markets, securities are traded in isolation. Such a disconnected market design can be inefficient if agents trade more than one security. I assess welfare effects of connecting markets by allowing orders for security to depend on prices other securities. show that everyone trades identical amounts under both structures and only the clearing perfectly correlated or all price-ta...