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 derive necessary and sufficient conditions in order for binary voting choices over a finite number of pairs of alternatives to be consistent with voter preferences that admit concave utility representations. These conditions imply simple testable restrictions on the location of voters’ ideal points, and can be used to predict individual voting behavior. On the other hand, if the location of ...

People’s choices can be predicted given information about their preferences. Learning people’s preferences is the inverse problem of inferring preferences from choices. Given the apparent relationship between choice prediction and preference learning, it is natural to ask whether the two are mutually consistent. Given weak assumptions, we show that no single, consistent model of the relationshi...

This paper studies differences in inequality perceptions, distributional norms, and redistributive preferences between East and West Germany. As expected, there are substantial differences with respect to all three of these measures. Surprisingly, however, differences in distributional norms are much smaller than differences with respect to inequality perceptions or redistributive preferences. ...

In allocating goods with no use of monetary transfers, random allocation mechanisms can be designed in order to elicit information on preference intensities. I study the nontransfer allocation of two ex-ante identical objects under Bayesian incentive compatibility, with symmetric agents and independent private valuations. I …nd the ex-ante utilitarian-optimal mechanism, in which the probability...

A set of vertices W resolves a graph G if every vertex is uniquely determined by its coordinate of distances to the vertices in W . The minimum cardinality of a resolving set of G is called themetric dimension of G. In this paper, we consider a graphwhich is obtained by the lexicographic product between two graphs. The lexicographic product of graphs G and H , which is denoted by G ◦ H , is the...

An outer-connected dominating set for an arbitrary graph G is a set D̃ ⊆ V such that D̃ is a dominating set and the induced subgraph G[V \ D̃] be connected. In this paper, we focus on the outerconnected domination number of the product of graphs. We investigate the existence of outer-connected dominating set in lexicographic product and Corona of two arbitrary graphs, and we present upper bounds f...

This paper is a project report of the lexicographic Internet portal OWID, an Online Vocabulary Information System of German which is being built at the Institute of German Language in Mannheim (IDS). Overall, the contents of the portal and its technical approaches will be presented. The lexical database is structured in a granular way which allows to extend possible search options for lexicogra...

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 propose some global constraints for lexicographic orderings on vectors of variables. These constraints are very useful for breaking a certain kind of symmetry arising in matrices of decision variables. We show that decomposing such constraints carries a penalty either in the amount or the cost of constraint propagation. We therefore present a global consistency algorithm which enforces a lex...