In the article m dimensional lexicographic noncooperative games   ) ,..., ( 1 m   are defined for the players’ } ,..., 2 , 1 { n N  for which there exists a characteristic function T m v v v v ) ,..., , ( 2 1  . Some main features are proved of v function in a lexicographic case. A lexicographic cooperative game is called a couple   v N , , where v is a real vectorfunction on N subsets ...

McKinsey–Tarski (1944), Shehtman (1999), and Lucero-Bryan (2011) proved completeness theorems for modal logics with modalities 2, 2 and ∀, and [∂] and ∀, respectively, with topological semantics over the real numbers. We give short proofs of these results using lexicographic sums of linear orders.

The paper investigates the public’s attitude towards monetary union arrangements associated with different levels of monetary policy autonomy. The results indicate that support for monetary union declines significantly with expected loss of autonomy. Survey data from Kenya shows that public support for the proposed East African Community monetary union is highest in an arrangement where the cou...

We show that finding lexicographically minimal n bases in a matroid can be done in polynomial time in the oracle model. This follows from a more general result that the shifted problem over a matroid can be solved in polynomial time as well.

Multi-Objective Combinatorial Optimization (MOCO) problems find a wide range of practical application problems, some of which involving Boolean variables and constraints. This paper develops and evaluates algorithms for solving MOCO problems, defined on Boolean domains, and where the optimality criterion is lexicographic. The proposed algorithms build on existing algorithms for either Maximum S...