We consider inhomogeneous matrix products over max-plus algebra, where the matrices in the product satisfy certain assumptions under which the matrix products of sufficient length are rank-one, as it was shown in [6] (Shue, Anderson, Dey 1998). We establish a bound on the transient after which any product of matrices whose length exceeds that bound becomes rank-one.

When a system of one-sided max-plus linear equations is inconsistent, its right-hand side vector may be slightly modified to reach a consistent one. It is handled in this note by minimizing the sum of absolute deviations in the right-hand side vector. It turns out that this problem may be reformulated as a mixed integer linear programming problem. Although solving such a problem requires much computational effort, it may propose a solution that just modifies few elements of the right-hand side vector,...

We consider a decision-making problem to evaluate absolute ratings of alternatives that are compared in pairs according to two criteria, subject to box constraints on the ratings. The problem is formulated as the log-Chebyshev approximation of two pairwise comparison matrices by a common consistent matrix (a symmetrically reciprocal matrix of unit rank), to minimize the approximation errors for both matrices simultaneously. We rearrange the approximation problem as a constrained bi-objective optimization...

A game is considered where the communication network of the first player is explicitly modelled. The second player may induce delays in this network, while the first player may counteract such actions. Costs are modelled through expectations over idempotent probability measures. The idempotent probabilities are conditioned by observational data, the arrival of which may have been delayed along the communication network. This induces a game where the state space consists of the network delays. Even...

The paper presents an iterative algorithm for computing the maximum cycle mean (or eigenvalue) of $n\times n$ triangular Toeplitz matrix in max-plus algebra. The problem is solved by an iterative algorithm which is applied to special cycles. These cycles of triangular Toeplitz matrices are characterized by sub-partitions of $n-1$.

This paper is dealing with solvability of interval systems of linear equations in max-min algebra. Max-min algebra is the algebraic structure in which classical addition and multiplication are replaced by $\oplus$ and $\otimes$, where $a\oplus b=max\{a,b\},a\otimes b=min\{a,b\}$. The notation $𝔸\otimes x=𝕓$ represents an interval system of linear equations, where $𝔸=[\underline{A},\overline{A}]$ and $𝕓=[\underline{b},\overline{b}]$ are given interval matrix and interval vector, respectively. We can define several types of solvability of interval systems. In this paper, we define the T4 and T5 solvability and give necessary and...