Various problems in AI and multiagent systems can be tackled by finding the “most desirable” elements of a set given some binary relation. Examples can be found in areas as diverse as voting theory, game theory, and argumentation theory. Some particularly attractive solution sets are defined in terms of a covering relation—a transitive subrelation of the original relation. We consider three dif...

We use the theory of poset resolutions to construct the minimal free resolution of an arbitrary stable monomial ideal in the polynomial ring whose coefficients are from a field. This resolution is recovered by utilizing a poset of Eliahou-Kervaire admissible symbols associated to a stable ideal. The structure of the poset under consideration is quite rich and in related analysis, we exhibit a r...

We prove existence of wide types in a continuous theory expanding a Banach space, and density of minimal wide types among stable types in such a theory. We show that every minimal wide stable type is “generically” isometric to an l2 space. We conclude with a proof of the following formulation of Henson’s Conjecture: every model of an uncountably categorical theory expanding a Banach space is pr...

This paper introduces interdiction branching, a new branching method for binary integer programs that is designed to overcome the difficulties encountered in solving problems for which branching on variables is inherently weak. Unlike traditional methods, selection of the disjunction in interdiction branching takes into account the best feasible solution found so far. In particular, the method ...

Abstract In this paper, the general and supplementary conditions are used to determine inverse heat conduction in parabolic equation. The measured ensure that problem has a unique solution, but solution is not stable, so ill-posed. Using boundary element method discretize original problem, it solve problem. On basis, direct method, least square regular tried. Finally, minimal energy system. Num...

Various Condorcet consistent social choice functions based on majority rule (tournament solutions) are considered in the general case, when ties are allowed: the core, the weak and strong top cycle sets, versions of the uncovered and minimal weakly stable sets, the uncaptured set, the untrapped set, classes of k-stable alternatives and k-stable sets. The main focus of the paper is to construct ...