Related papers: A note on the combination of equilibrium problems
The paper focuses on some versions of connected dominating set problems: basic problems and multicriteria problems. A literature survey on basic problem formulations and solving approaches is presented. The basic connected dominating set…
In 1991, Yannakakis (J. Comput. System Sci., 1991) proved that no symmetric extended formulation for the matching polytope of the complete graph K_n with n nodes has a number of variables and constraints that is bounded subexponentially in…
In this paper, we firstly prove the existence of the equilibrium for the generalized abstract economy. We apply these results to show the existence of solutions for systems of vector quasi-equilibrium problems with multivalued trifunctions.…
We prove a lower bound on the number of the convex components of a compact set with non-empty interior in $\mathbb{R}^n$ for all $n\ge2$. Our result generalizes and improves the inequalities previously obtained in M. Carozza, F. Giannetti,…
It is proved that the continuum hypothesis implies the existence of a group M containing a nonalgebraic unconditionally closed set, i.e., a set which is closed in any Hausdorff group topology on M but is not an intersection of finite unions…
This work presents theorems which state (i) Z is a proper subset for any bijection f between A and Z, where Z is contained in P(A), A is a non-finite set and |Z|=|A|, and (ii) being Z a proper subset of P(A) nothing affirms or denies that…
We unify two recent results concerning equilibration in quantum theory. We first generalise a proof of Reimann [PRL 101,190403 (2008)], that the expectation value of 'realistic' quantum observables will equilibrate under very general…
We give several algorithms addressing computations of intersections of conjugate subgroups.
This brief note clarifies that the scenario described in Arunachaleswaran et al. (2025) -- titled `Algorithmic Collusion without Threats' -- is not one of collusion, but one where one player is behaving non-competitively and the other is…
Our general aim is to give sufficient conditions for robustness behavior and convergence to the equilibrium point of linear time-varying fractional system's solutions. We approach this problem using as a framework a series of recent results…
This paper presents the following results on sets that are complete for NP. 1. If there is a problem in NP that requires exponential time at almost all lengths, then every many-one NP-complete set is complete under length-increasing…
The Minimum Spanning Tree with Conflicting Edge Pairs is a generalization that adds conflict constraints to a classical optimization problem on graphs used to model several real-world applications. In the last few years several approaches,…
An outline of Morita's equilibrium ensemble approach to disordered systems is given, and hitherto unnoticed relations to other, more conventional approaches in the theory of disordered systems are pointed out. It is demonstrated to…
Upper bounds to the size of a family of subsets of an n-element set that avoids certain configurations are proved. These forbidden configurations can be described by inclusion patterns and some sets having the same size. Our results are…
We provide a construction of the fixed points of functors which may not be inital algebras or final coalgebras. For an endofunctor F, this fixed point construction may be expressed as a pair of adjoint functors between F-coalgebras and…
In combinatorial problems it is sometimes possible to define a $G$-equivariant mapping from a space $X$ of configurations of a system to a Euclidean space $\mathbb{R}^m$ for which a coincidence of the image of this mapping with an…
Kuhn-Tucker points play a fundamental role in the analysis and the numerical solution of monotone inclusion problems, providing in particular both primal and dual solutions. We propose a class of strongly convergent algorithms for…
This paper considers time-inconsistent problems when control and stopping strategies are required to be made simultaneously (called stopping control problems by us). We first formulate the timeinconsistent stopping control problems under…
We demonstrate that the forecasting combination puzzle is a consequence of the methodology commonly used to produce forecast combinations. By the combination puzzle, we refer to the empirical finding that predictions formed by combining…
The study of intersection problems on families of sets is one of the most important topics in extremal combinatorics. As we all know, the extremal problems involving certain intersection constraints are equivalent to that with the union…