Related papers: Stability of the linear complementarity problem pr…
We continue and extend previous work on the parameterized complexity analysis of the NP-hard Stable Roommates with Ties and Incomplete Lists problem, thereby strengthening earlier results both on the side of parameterized hardness as well…
Robustness measures are increasingly prominent resource quantifiers that have been introduced for quantum resource theories such as entanglement and coherence. Despite the generality of these measures, their usefulness is hindered by the…
We consider the robust version of items selection problem, in which the goal is to choose representatives from a family of sets, preserving constraints on the allowed items' combinations. We prove NP-hardness of the deterministic version,…
Linear Recurrence Sequences (LRS) are a fundamental mathematical primitive for a plethora of applications such as the verification of probabilistic systems, model checking, computational biology, and economics. Positivity (are all terms of…
Pairwise comparisons between alternatives are a well-known method for measuring preferences of a decision-maker. Since these often do not exhibit consistency, a number of inconsistency indices has been introduced in order to measure the…
Machine learning techniques for the solution of inverse problems have become an attractive approach in the last decade, while their theoretical foundations are still in their infancy. In this chapter we want to pursue the study of…
We address combinatorial problems that can be formulated as minimization of a partially separable function of discrete variables (energy minimization in graphical models, weighted constraint satisfaction, pseudo-Boolean optimization, 0-1…
We propose two solution concepts for matchings under preferences: robustness and near stability. The former strengthens while the latter relaxes the classic definition of stability by Gale and Shapley (1962). Informally speaking, robustness…
Hybrid inverse problems are mathematical descriptions of coupled-physics (also called multi-waves) imaging modalities that aim to combine high resolution with high contrast. The solution of a high-resolution inverse problem, a first step…
A new error bound for the linear complementarity problem when the matrix involved is a B-matrix is presented, which improves the corresponding result in [C.Q. Li et al., A new error bound for linear complementarity problems for B-matrices.…
This article concerns the question: which subsets of ${\mathbb R}^m$ can be represented with Linear Matrix Inequalities, LMIs? This gives some perspective on the scope and limitations of one of the most powerful techniques commonly used in…
The robustness to the prior of Bayesian inference procedures based on a measure of statistical evidence are considered. These inferences are shown to have optimal properties with respect to robustness. Furthermore, a connection between…
We consider linear systems of equations and inequalities with coefficients varying inside given intervals. We define their solutions (so called AE solutions) and solvability (so called AE solvability) by using forall-exists quantification…
A probabilistic database with attribute-level uncertainty consists of relations where cells of some attributes may hold probability distributions rather than deterministic content. Such databases arise, implicitly or explicitly, in the…
In this paper, we consider the robust linear infinite programming problem $({\rm RLIP}_c) $ defined by \begin{eqnarray*} ({\rm RLIP}_c)\quad &&\inf\; \langle c,x\rangle \textrm{subject to } &&x\in X,\; \langle x^\ast,x \rangle \le r…
This paper explores some sufficient conditions for the enhanced solvability of strong vector equilibrium problems, which can be established via a variational approach. Enhanced solvability here means existence of solutions, which are strong…
The paper presents a collection of results on continuous dependence for solutions to nonlocal problems under perturbations of data and system parameters. The integral operators appearing in the systems capture interactions via heterogeneous…
Discrete-time random walks and their extensions are common tools for analyzing animal movement data. In these analyses, resolution of temporal discretization is a critical feature. Ideally, a model both mirrors the relevant temporal scale…
The stability analysis of a class of discontinuous discrete-time systems is studied in this paper. The system under study is modeled as a feedback interconnection of a linear system and a set-valued nonlinearity. An equivalent…
In this paper, we consider the solution of ill-conditioned systems of linear algebraic equations that can be determined imprecisely. To improve the stability of the solution process, we "immerse" the original imprecise linear system in an…