This paper proposes a dynamic lexicographic approach to tackle multi-objective optimization problems. In this method, the ordering of objectives, which reflects their relative preferences, is changed in a dynamic fashion during the search. This approach eliminates the need for the decision-maker to establish fixed preferences among the competing objectives, which is often difficult. At the same...

There is a variety of methods for ranking objectives in multiobjective optimization and some are difficult to define because they require information a priori (e.g. establishing weights in a weighted approach or setting the ordering in a lexicographic approach). In manyobjective optimization problems, those methods may exhibit poor diversification and intensification performance. We propose the...

We propose to improve word sense embeddings by enriching an automatic corpus-based method with lexicographic data. Information from a lexicon is introduced into the learning algorithm’s objective function through a regularizer. The incorporation of lexicographic data yields embeddings that are able to reflect expertdefined word senses, while retaining the robustness, high quality, and coverage ...

We present a rule-based method to automatically create a large-coverage semantic lexicon of French adjectives by extracting paradigmatic relations from lexicographic definitions. Formalized adjectival resources are, indeed, scarce for French and they mostly focus on morphological and syntactic information. Our objective is, therefore, to contribute enriching the available set of resources by ta...

We explore the interaction between evolutionary stability and lexicographic preferences. To do so, we define a limit Nash equilibrium for a lexicographic game as the limit of Nash equilibria of nearby games with continuous preferences. Nash equilibria of lexicographic games are limit Nash equilibria, but not conversely. Modified evolutionarily stable strategies (Binmore and Samuelson, 1992. J. ...

In a previous work [12], we proposed a method for generating permutations in lexicographic order. In this study, we extend it to generate multiset permutations. A multiset is a collection of items that are not necessarily distinct. The guideline of the extension is to skip, as soon as possible, those partially-formed permutations that are less than or equal to the latest generated eligible perm...

The applicability of lexicographic comparison in nonmonotonic reasoning with speciicity is investigated. A priority mechanism based on lexicographic comparison is deened for Reiter's default logic. The following principle earlier used by Geener and Pearl in conditional entail-ment is used as the basis for speciicity-based priorities for normal default theories: for each rule there is a context ...