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: 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.

When the Dust Settles: The Consequences of Scandals for Organizational Competition

Abstract: Recent works have documented the dark side of scandals, revealing how they spread, contaminate associated organizations, and taint the perception of entire fields. We complement this line of work by exploring how scandals durably affect competition within a field, translating into relative advantages for certain organizations over others. First, scandals may benefit organizations that provide a close substitute to the offerings of the implicated organization. Second, scandals pave the way for moralizing discourses and practices, shake taken-for-granted assumptions about the conduct of organizations, and result in a shift in criteria used to evaluate organizations within the field. Our arguments suggest that organizations whose offerings are most similar to those of the implicated organization, yet are perceived as enforcing stricter standards of conduct, are likely to benefit the most from a scandal. We find support for these arguments in a county-level study of membership in the Catholic Church and 16 ot...

A nonlinear fourth-order parabolic equation and related logarithmic Sobolev inequalities

Abstract: A nonlinear fourth-order parabolic equation in one space dimension with periodic boundary conditions is studied. This equation arises in the context of fluctuations of a stationary nonequilibrium interface and in the modeling of quantum semiconductor devices. The existence of global-in-time non-negative weak solutions is shown. A criterion for the uniqueness of non-negative weak solutions is given. Finally, it is proved that the solution converges exponentially fast to its mean value in the “entropy norm” using a new optimal logarithmic Sobolev inequality for higher derivatives.

Application of the nested rollout policy adaptation algorithm to the traveling salesman problem with time windows

Abstract: In this paper, we are interested in the minimization of the travel cost of the traveling salesman problem with time windows. In order to do this minimization we use a Nested Rollout Policy Adaptation (NRPA) algorithm. NRPA has multiple levels and maintains the best tour at each level. It consists in learning a rollout policy at each level. We also show how to improve the original algorithm with a modified rollout policy that helps NRPA to avoid time windows violations.

A complexity approach for core-selecting exchange with multiple indivisible goods under lexicographic preferences

Abstract: Core-selection is a crucial property of social choice functions, or rules, in social choice literature. It is also desirable to address the incentive of agents to cheat by misreporting their preferences. This paper investigates an exchange problem where each agent may have multiple indivisible goods, agents' preferences over sets of goods are assumed to be lexicographic, and side payments are not allowed. We propose an exchange rule called augmented top-trading-cycles (ATTC) procedure based on the original TTC procedure. We first show that the ATTC procedure is core-selecting. We then show that finding a beneficial misreport under the ATTC procedure is NP-hard. Under the ATTC procedure, we finally clarify the relationship between preference misre-port and splitting, which is a different type of manipulation.