Institution
Paris Dauphine University
Education•Paris, France•
About: Paris Dauphine University is a education organization based out in Paris, France. It is known for research contribution in the topics: Population & Approximation algorithm. The organization has 1766 authors who have published 6909 publications receiving 162747 citations. The organization is also known as: Paris Dauphine & Dauphine.
Topics: Population, Approximation algorithm, Bounded function, Parameterized complexity, Time complexity
Papers published on a yearly basis
Papers
More filters
••
TL;DR: This work proves that the minimal super-replicating strategy is the least expensive buy-and-hold strategy for general path-independent claims, and provides a shorter and more intuitive, financial mathematics-type proof.
Abstract: We study the problem of finding the minimal price needed to dominate European-type contingent claims under proportional transaction costs in a continuous-time diffusion model. The result we prove has already been known in special cases – the minimal super-replicating strategy is the least expensive buy-and-hold strategy. Our contribution consists in showing that this result remains valid for general path-independent claims, and in providing a shorter and more intuitive, financial mathematics-type proof. It is based on a previously known representation of the minimal price as a supremum of the prices in corresponding shadow markets, and on a PDE (viscosity) characterization of that representation.
152 citations
•
TL;DR: The notion of viscosity solutions of scalar fully nonlinear partial differential equations of second order provides a framework in which startling comparison and uniqueness theorems, existence theorem, and continuous dependence may now be proved by very efficient and striking arguments.
Abstract: The notion of viscosity solutions of scalar fully nonlinear partial differential equations of second order provides a framework in which startling comparison and uniqueness theorems, existence theorems, and theorems about continuous dependence may now be proved by very efficient and striking arguments. The range of important applications of these results is enormous. This article is a self-contained exposition of the basic theory of viscosity solutions.
152 citations
••
TL;DR: In this paper, the authors show that weak solutions of Navier-Stokes equations in T2 turn out to be smooth as long as the density remains bounded in L∞(T2).
Abstract: Regularity of weak solutions of the compressible isentropic Navier-Stokes equations is proven for small time in dimension N = 2 or 3 under periodic boundary conditions. In this paper, the initial density is not required to have a positive lower bound and the pressure law is assumed to satisfy a condition that reduces to τ > 1 when N = 2 and p(φ) = aφτ. Moreover,weak solutions in T2turn out to be smooth as long as the density remains bounded in L∞( T2).
151 citations
••
TL;DR: Dolbeault et al. as discussed by the authors proposed a method for proving the hypocoercivity associated to a kinetic equation involving a linear time relaxation operator, which is based on the construction of an adapted Lyapunov functional satisfying a Gronwall-type inequality.
151 citations
••
TL;DR: In this paper, the well-posedness of an unsteady fluid-structure interaction problem was studied and its local solvability was proved in time through two fixed point procedures.
Abstract: We study the well-posedness of an unsteady fluid-structure interaction problem.
We consider a viscous incompressible flow, which is modelled by the
Navier-Stokes equations. The structure is a collection of rigid moving bodies. The fluid
domain depends on time and is defined by the position of the structure, itself resulting
from a stress distribution coming from the fluid. The problem is then
nonlinear and the equations we deal with are coupled. We prove its local
solvability in time through two fixed point procedures.
150 citations
Authors
Showing all 1819 results
Name | H-index | Papers | Citations |
---|---|---|---|
Pierre-Louis Lions | 98 | 283 | 57043 |
Laurent D. Cohen | 94 | 417 | 42709 |
Chris Bowler | 87 | 288 | 35399 |
Christian P. Robert | 75 | 535 | 36864 |
Albert Cohen | 71 | 368 | 19874 |
Gabriel Peyré | 65 | 303 | 16403 |
Kerrie Mengersen | 65 | 737 | 20058 |
Nader Masmoudi | 62 | 245 | 10507 |
Roland Glowinski | 61 | 393 | 20599 |
Jean-Michel Morel | 59 | 302 | 29134 |
Nizar Touzi | 57 | 224 | 11018 |
Jérôme Lang | 57 | 277 | 11332 |
William L. Megginson | 55 | 169 | 18087 |
Alain Bensoussan | 55 | 417 | 22704 |
Yves Meyer | 53 | 128 | 14604 |