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: In this article, column generation is used during the tree search procedure, combined with a ranking procedure which ensures that the exact optimal integer solution is obtained for the matrix decomposition problem in the context of satellite communication system optimization.
79 citations
••
TL;DR: A new method for multiple criteria ordinal classification (sorting) problems that fulfills a set of structural requirements: uniqueness of the assignments, independence, monotonicity, homogeneity, conformity, and stability with respect to merging and splitting operations.
79 citations
••
04 Aug 2010
TL;DR: A general graphical representation called LP-trees is introduced which captures various natural classes of such preference relations, depending on whether the importance order between attributes and/or the local preferences on the domain of each attribute is conditional on the values of other attributes.
Abstract: We consider the problem of learning a user's ordinal preferences on a multiattribute domain, assuming that her preferences are lexicographic. We introduce a general graphical representation called LP-trees which captures various natural classes of such preference relations, depending on whether the importance order between attributes and/or the local preferences on the domain of each attribute is conditional on the values of other attributes. For each class we determine the Vapnik-Chernovenkis dimension, the communication complexity of preference elicitation, and the complexity of identifying a model in the class consistent with a set of user-provided examples.
79 citations
••
TL;DR: This work proposes to avoid the use of summaries and the ensuing loss of information by instead using the Wasserstein distance between the empirical distributions of the observed and synthetic data, and generalizes the well‐known approach of using order statistics within approximate Bayesian computation to arbitrary dimensions.
Abstract: A growing number of generative statistical models do not permit the numerical evaluation of their likelihood functions. Approximate Bayesian computation has become a popular approach to overcome this issue, in which one simulates synthetic data sets given parameters and compares summaries of these data sets with the corresponding observed values. We propose to avoid the use of summaries and the ensuing loss of information by instead using the Wasserstein distance between the empirical distributions of the observed and synthetic data. This generalizes the well‐known approach of using order statistics within approximate Bayesian computation to arbitrary dimensions. We describe how recently developed approximations of the Wasserstein distance allow the method to scale to realistic data sizes, and we propose a new distance based on the Hilbert space filling curve. We provide a theoretical study of the method proposed, describing consistency as the threshold goes to 0 while the observations are kept fixed, and concentration properties as the number of observations grows. Various extensions to time series data are discussed. The approach is illustrated on various examples, including univariate and multivariate g‐and‐k distributions, a toggle switch model from systems biology, a queuing model and a Levy‐driven stochastic volatility model.
79 citations
•
TL;DR: In this paper, the authors analyze the impact of heterogeneous beliefs in an otherwise standard competitive complete markets discrete time economy and show that the construction of a consensus belief, as well as a consensus consumer are valid modulo a predictable aggregation bias, which takes the form of a discount factor.
Abstract: The aim of the paper is to analyze the impact of heterogeneous beliefs in an otherwise standard competitive complete markets discrete time economy. The construction of a consensus belief, as well as a consensus consumer are shown to be valid modulo a predictable aggregation bias, which takes the form of a discount factor. We use our construction of a consensus consumer to investigate the impact of beliefs heterogeneity on the CCAPM and on the expression of the risk free rate. We focus on the pessimism/doubt of the consensus consumer and we study their impact on the equilibrium characteristics (market price of risk, risk free rate). We finally analyze how pessimism and doubt at the aggregate level result from pessimism and doubt at the individual level.
79 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 |