Paris Dauphine University

About: Paris Dauphine University is a education organization based out in Paris, France. It is known for research contribution in the topics: Context (language use) & Population. The organization has 1766 authors who have published 6909 publications receiving 162747 citations. The organization is also known as: Paris Dauphine & Dauphine.

Parallel Nested Monte-Carlo search

Abstract: We address the parallelization of a Monte-Carlo search algorithm. On a cluster of 64 cores we obtain a speedup of 56 for the parallelization of Morpion Solitaire. An algorithm that behaves better than a naive one on heterogeneous clusters is also detailed.

Data Abundance and Asset Price Informativeness

Abstract: We consider a model in which investors can acquire either raw or processed information about the payoff of a risky asset. Information processing filters out the noise in raw information but it takes time. Hence, investors buying processed information trade with a lag relative to investors buying raw information. As the cost of raw information declines, more investors trade on it, which reduces the value of processed information, unless raw information is very unreliable. Thus, a decline in the cost of raw information can reduce the demand for processed information and, for this reason, the informativeness of the asset price in the long run.

Local Exact Controllability for the One-Dimensional Compressible Navier–Stokes Equation

Abstract: In this paper we deal with the isentropic (compressible) Navier-Stokes equation in one space dimension and we adress the problem of the boundary controllability for this system. We prove that we can drive initial conditions which are sufficiently close to some constant states to those constant states. This is done under some natural hypotheses on the time of control and on the regularity on the initial conditions.

Lack of confidence in ABC model choice

Abstract: Approximate Bayesian computation (ABC) have become a essential tool for the analysis of complex stochastic models. Earlier, Grelaud et al. (2009) advocated the use of ABC for Bayesian model choice in the specific case of Gibbs random fields, relying on a inter-model sufficiency property to show that the approximation was legitimate. Having implemented ABC-based model choice in a wide range of phylogenetic models in the DIY-ABC software (Cornuet et al., 2008), we now present theoretical background as to why a generic use of ABC for model choice is ungrounded, since it depends on an unknown amount of information loss induced by the use of insufficient summary statistics. The approximation error of the posterior probabilities of the models under comparison may thus be unrelated with the computational effort spent in running an ABC algorithm. We then conclude that additional empirical verifications of the performances of the ABC procedure as those available in DIYABC are necessary to conduct model choice.