We consider the lexicographic max-min fair rate control problem at the link layer in a random access wireless network. In lexicographic max-min fair rate allocation, the minimum link rates are maximized in a lexicographic order. For the Aloha multiple access model, we propose iterative approaches that attain the optimal rates under very general assumptions on the network topology and communicat...

The approach called the Lexicographic Min-Max (LMM) optimization depends on searching for solutions minimal according to the lex-max order on a multidimensional outcome space. LMM is a refinement of the standard Min-Max optimization, but in the former, in addition to the largest outcome, we minimize also the second largest outcome (provided that the largest one remains as small as possible), mi...

In this article an account is given of the experience in fieldwork by the Dictionary of the Flemish Dialects (Woordenboek van de Vlaamse Dialecten, WVD), Ghent University, Belgium. The focus is on the practical aspects with regard to methods of lexicographic fieldwork. It is maintained that the analysis of 'metalinguistical conversations' with groups of respondents in which their lexicographic ...

Many large graphs can be constructed from existing smaller graphs by using graph operations, for example, the Cartesian product and the lexicographic product. Many properties of such large graphs are closely related to those of the corresponding smaller ones. In this short note, we give some properties of the lexicographic products of vertextransitive and of edge-transitive graphs. In particula...

We investigate the connection between choice functions and lexicographic probabilities, by means of the convexity axiom considered by [7] but without imposing any Archimedean condition. We show that lexicographic probabilities are related to a particular type of sets of desirable gambles, and investigate the properties of the coherent choice function this induces via maximality. Finally, we sho...

We examine the effects of various political campaign activities on voter preferences in the domain of US Presidential elections. We construct a comprehensive data set that covers the three most recent elections, with detailed records of voter preferences at the state-week level over an election period. We include various types of the most frequently utilized marketing instruments: two forms of ...

In many interactive decision making scenarios there is often no solution that satisfies all of the user’s preferences. The decision process can be helped by providing explanations. Relaxations show sets of consistent preferences and, thus, indicate which preferences can be enforced, while exclusion sets show which preferences can be relaxed to obtain a solution. We propose a new approach to exp...

We present a survey on the results related to the theory of lexicographic differentiation. This theory ensures an efficient computation of generalized (lexicographic) derivative of a nonsmooth function belonging to a special class of lexicographically smooth functions. This class is a linear space which contains all differentiable functions, all convex functions, and which is closed with respec...

This paper explores lexicographic semirings and their application to problems in speech and language processing. Specifically, we present two instantiations of binary lexicographic semirings, one involving a pair of tropical weights, and the other a tropical weight paired with a novel string semiring we term the categorial semiring. The first of these is used to yield an exact encoding of backo...