We provide comparable algorithms for the Dekel-Fudenberg procedure, iterated admissibility and proper rationalizability by means of the concepts of preference restrictions and likelihood orderings. We apply the algorithms for comparing iterated admissibility and proper rationalizability, and provide a sufficient condition under which iterated admissibility does not rule out properly rationaliza...

We identify two wide families of propositional sequent calculi for which cut-admissibility is a corollary of the subformula property. While the subformula property is often a simple consequence of cutadmissibility, our results shed light on the converse direction, and may be used to simplify cut-admissibility proofs in various propositional sequent calculi. In particular, the results of this pa...

This paper discusses the admissibility of agglomerative hierarchical clustering algorithms with respect to space distortion and monotonicity, as defined by Yadohisa et al. and Batagelj, respectively. Several admissibilities and their properties are given for selecting a clustering algorithm. Necessary and sufficient conditions for an updating formula, as introduced by Lance and Williams, are pr...

The admissibility analysis and robust admissible control problem of the uncertain discretetime switched linear singular (SLS) systems for arbitrary switching laws are investigated. Based on linear matrix inequalities, some sufficient conditions are given for: A) the existence of generalized common Lyapunov solution and the admissibility of the SLS systems for arbitrary switching laws, B) the ex...

We study admissibility conditions for the parameters of degenerate cyclotomic BMW algebras. We show that the u–admissibility condition of Ariki, Mathas and Rui is equivalent to a simple module theoretic condition.

The concept of support is central to data mining. While the definition of support in transaction databases is intuitive and simple, that is not the case in graph datasets and databases. Most mining algorithms require the support of a pattern to be no grater than that of its subpatterns, a property called anti-monotonicity or admissibility. This study examines the requirements for admissibility ...

In Ho and Russell (SIAM J Control Optim 21(4):614–640, 1983), and Weiss (Syst Control Lett 10(1): 79–82, 1988), a Carleson measure criterion for admissibility of one-dimensional input elements with respect to diagonal semigroups is given.We extend their results from the Hilbert space situation (L2-admissibility on the state space 2) to the more general situation of L p-admissibility on the stat...