— The Cartier-Perrin theorem, which was published in 1995 and is expressed in the language of nonstandard analysis, permits, for the first time perhaps, a clear-cut mathematical...
Abstract. Notoriously, quantum computation shatters complexity theory, but is innocuous to computability theory [17]. Yet several works have shown how quantum theory as it stands c...
— Computing the partition function and the marginals of a global probability distribution are two important issues in any probabilistic inference problem. In a previous work, we ...
—This paper studies the problem of high-dimensional multiple testing and sparse recovery from the perspective of sequential analysis. In this setting, the probability of error is...
We present a general framework to model strategic aspects and stable and fair resource allocations in networks via variants and generalizations of path coalitional games. In these ...