The stable marriage problem is a matching problem that pairs members of two sets. The objective is to achieve a matching that satis es all participants based on their preferences. The stable roommate problem is a variant involving only one set, which is partitioned into pairs with a similar objective. There exist asymptotically optimal algorithms that solve both problems. In this paper, we inve...

We contribute to the research on stable minimum storage merging by introducing an algorithm that is particularly simply structured compared to its competitors. The presented algorithm performs O(m log( n m + 1)) comparisons and O((m + n) log m) assignments, where m and n are the sizes of the input sequences with m ≤ n. Hence, according to the lower bounds of merging the algorithm is asymptotica...

In this article, a new fractional order one–country game model (OCGM) with distinct incidence is explored. We propose a mathematical system to model this situation. All the feasible equilibria of the system are obtained and the conditions for the existence of the interior equilibrium are determined. The basic reproduction numbers R0 = β (α+1)(γ+μ) and R∗ 0 = E rv are found. It is shown that the...

We study the SIR epidemic model with varying total population size and constant immigration rate. We derive the sufficient conditions on parameters of the system to guarantee that the equilibrium points of the system are locally asymptotically stable or globally asymptotically stable. If the disease-free equilibrium point is stable, then the disease will not affect the population in the system....