scispace - formally typeset
Search or ask a question
Institution

Paris Dauphine University

EducationParis, France
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.


Papers
More filters
Proceedings Article
09 May 2010
TL;DR: A "prototypical" preference logic is constructed, which combines features of existing preference logics, and it is shown that many well-known preference languages, such as CP-nets and its extensions, are natural fragments of it.
Abstract: Preference logics and AI preference representation languages are both concerned with reasoning about preferences on combinatorial domains, yet so far these two streams of research have had little interaction. This paper contributes to the bridging of these areas. We start by constructing a "prototypical" preference logic, which combines features of existing preference logics, and then we show that many well-known preference languages, such as CP-nets and its extensions, are natural fragments of it. After establishing useful characterizations of dominance and consistency in our logic, we study the complexity of satisfiability in the general case as well as for meaningful fragments, and we study the expressive power as well as the relative succinctness of some of these fragments.

61 citations

Journal ArticleDOI
TL;DR: An overview of applications of dioid and semiring structures is provided, stressing links with Fuzzy Sets and emphasizing linear algebraic problems (solving linear systems, computing eigenvalues and eigenvectors), non-classical path-finding problems (using algebras of endomorphisms) and connections between dioids structure and nonlinear analysis (in view of solving problems in Mathematical Physics).

61 citations

Journal ArticleDOI
TL;DR: It is suggested that economic development and gender equality in rights go hand-in-hand with a reshaping rather than a suppression of gender norms, with the emergence of new and more horizontal forms of social differentiation across genders.
Abstract: The so-called “gender-equality paradox” is the fact that gender segregation across occupations is more pronounced in more egalitarian and more developed countries. Some scholars have explained this paradox by the existence of deeply rooted or intrinsic gender differences in preferences that materialize more easily in countries where economic constraints are more limited. In line with a strand of research in sociology, we show instead that it can be explained by cross-country differences in essentialist gender norms regarding math aptitudes and appropriate occupational choices. To this aim, we propose a measure of the prevalence and extent of internalization of the stereotype that “math is not for girls” at the country level. This is done using individual-level data on the math attitudes of 300,000 15-y-old female and male students in 64 countries. The stereotype associating math to men is stronger in more egalitarian and developed countries. It is also strongly associated with various measures of female underrepresentation in math-intensive fields and can therefore entirely explain the gender-equality paradox. We suggest that economic development and gender equality in rights go hand-in-hand with a reshaping rather than a suppression of gender norms, with the emergence of new and more horizontal forms of social differentiation across genders.

61 citations

Book ChapterDOI
01 Jan 2011
TL;DR: What kind of performance the authors can expect for specific classes of problems is discussed and then some classical optimization problems in which this approach has been fruitfully applied are presented.
Abstract: In this survey the following model is considered. We assume that an instance I of a computationally hard optimization problem has been solved and that we know the optimum solution of such instance. Then a new instance I′ is proposed, obtained by means of a slight pertur- bation of instance I. How can we exploit the knowledge we have on the solution of instance I to compute a (approximate) solution of instance I′ in an efficient way? This computation model is called reoptimization and is of practical interest in various circumstances. In this article we first discuss what kind of performance we can expect for specific classes of problems and then we present some classical optimization problems (i.e. Max Knapsack, Min Steiner Tree, Scheduling) in which this approach has been fruitfully applied. Subsequently, we address vehicle routing prob- lems and we show how the reoptimization approach can be used to obtain good approximate solution in an efficient way for some of these problems.

61 citations

Posted Content
TL;DR: In this paper, the authors investigated the relationship between trading activity of a crossing network and the liquidity of a traditional dealer market by comparing data from the SEAQ quote-driven segment of the London Stock Exchange (LSE) and internal data from POSIT crossing network.
Abstract: This article provides new insights into market competition between traditional exchanges and alternative trading systems in Europe. It investigates the relationship between the trading activity of a crossing network (CN) and the liquidity of a traditional dealer market (DM) by comparing data from the SEAQ quote-driven segment of the London Stock Exchange (LSE) and internal data from the POSIT crossing network. A cross-sectional analysis of bid-ask spreads shows that DM spreads are negatively related to CN executions. Risk-sharing benefits from CN trading dominate fragmentation and cream-skimming costs. Further, risk-sharing gains are found to be related to dealer trading in the CN.

61 citations


Authors

Showing all 1819 results

NameH-indexPapersCitations
Pierre-Louis Lions9828357043
Laurent D. Cohen9441742709
Chris Bowler8728835399
Christian P. Robert7553536864
Albert Cohen7136819874
Gabriel Peyré6530316403
Kerrie Mengersen6573720058
Nader Masmoudi6224510507
Roland Glowinski6139320599
Jean-Michel Morel5930229134
Nizar Touzi5722411018
Jérôme Lang5727711332
William L. Megginson5516918087
Alain Bensoussan5541722704
Yves Meyer5312814604
Network Information
Related Institutions (5)
École Polytechnique
39.2K papers, 1.2M citations

88% related

University of Paris
174.1K papers, 5M citations

87% related

Carnegie Mellon University
104.3K papers, 5.9M citations

86% related

Eindhoven University of Technology
52.9K papers, 1.5M citations

86% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
202317
202291
2021371
2020408
2019415
2018392