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.

Too Much of a Good Thing? The Dual Effect of Public Sponsorship on Organizational Performance

Abstract: Existing research provides contradictory insights on the effect of public sponsorship on the market performance of organizations. We develop the nascent theory on sponsorship by highlighting the dual and contingent nature of the relationship between public sponsorship and market performance. By arguing that sponsorship differentially affects resource accumulation and allocation mechanisms, we suggest two opposing firm-level effects, leading to an inverted U-shaped relationship between the amount of public sponsorship received and the market performance of sponsored organizations. This non-linear relationship, we argue, is moderated by the breadth, depth and focus of the focal organization's resource accumulation and allocation patterns. While horizontal scope (i.e. increased breadth) and externally oriented resource profile (i.e. reduced depth) strengthen the relationship, market orientation (i.e. increased focus) attenuates it. We test and find strong support for our hypotheses using population data on French film production firms from 1998 to 2008. Our work highlights the performance trade-offs associated with public sponsorship, and carries important managerial and policy implications.

Stable Directions for Small Nonlinear Dirac Standing Waves

Abstract: We prove that for a Dirac operator, with no resonance at thresholds nor eigenvalue at thresholds, the propagator satisfies propagation and dispersive estimates. When this linear operator has only two simple eigenvalues sufficiently close to each other, we study an associated class of nonlinear Dirac equations which have stationary solutions. As an application of our decay estimates, we show that these solutions have stable directions which are tangent to the subspaces associated with the continuous spectrum of the Dirac operator. This result is the analogue, in the Dirac case, of a theorem by Tsai and Yau about the Schrodinger equation. To our knowledge, the present work is the first mathematical study of the stability problem for a nonlinear Dirac equation

Dirichlet problems for some Hamilton-Jacobi equations with inequality constraints

Abstract: This conference paper is a summary of the article “Dirichlet problems for some Hamilton-Jacobi equations with inequality constraints”, J.-P. Aubin, A. Bayen, P. Saint-Pierre, SIAM Journal on Control and Optimization, 47(5), pp. 23482380, 2008, doi:10.1137/060659569. The full article contains all proofs and theorems summarized here. We use viability techniques for solving Dirichlet problems with inequality constraints (obstacles) for a class of Hamilton-Jacobi equations. The hypograph of the “solution” is defined as the “capture basin” under an auxiliary control system of a target associated with the initial and boundary conditions, viable in an environment associated with the inequality constraint. From the tangential condition characterizing capture basins, we prove that this solution is the unique “upper semicontinuous” solution to the Hamilton-Jacobi-Bellman partial differential equation in the Barron-Jensen/Frankowska sense. We show how this framework allows us to translate properties of capture basins into corresponding properties of the solutions to this problem. For instance, this approach provides a representation formula of the solution which boils down to the Lax-Hopf formula in the absence of constraints.

Approximation algorithms and hardness results for labeled connectivity problems

Abstract: Let G=(V,E) be a connected multigraph, whose edges are associated with labels specified by an integer-valued function ℒ:E→ℕ. In addition, each label l∈ℕ has a non-negative cost c(l). The minimum label spanning tree problem (MinLST) asks to find a spanning tree in G that minimizes the overall cost of the labels used by its edges. Equivalently, we aim at finding a minimum cost subset of labels I⊆ℕ such that the edge set {e∈E:ℒ(e)∈I} forms a connected subgraph spanning all vertices. Similarly, in the minimum label s – t path problem (MinLP) the goal is to identify an s–t path minimizing the combined cost of its labels. The main contributions of this paper are improved approximation algorithms and hardness results for MinLST and MinLP.