We develop an approach to providing epistemic conditions for admissible behavior in games. Instead of using lexicographic beliefs to capture infinitely less likely conjectures, we postulate that players use tie-breaking sets to help decide among strategies that are outcome-equivalent given their conjectures. A player is event-rational if she best responds to a conjecture and uses a list of subs...

The proof of Farrell (1968. Ann. Math. Statist. 26 518-522) is adapted to the special problems presented by discrete problems. Continuity of the risk functions is veritied, sequential subcompactness is verified, and a necessary and sufficient condition for admissibility proven. In the discrete problems considered one obtains pointwise convergence of the sequence of Bayes estimators to the admis...

In this article, we derive uniform admissibility and observability properties for the finite element space semi-discretizations of iż = A0z, where A0 is an unbounded self-adjoint positive definite operator with compact resolvent. In order to address this problem, we present several spectral criteria for admissibility and observability of such systems, which will be used to derive several result...

In the current paper, we re-examine the concept of strong admissibility, as was originally introduced by Baroni and Giacomin. We examine the formal properties of strong admissibility, both in its extension-based and in its labelling-based form. Moreover, we show that strong admissibility plays a vital role in discussionbased proof procedures for grounded semantics. In particular it allows one t...

for all z0 ∈ D(A). Here T (t) is the C0-semigroup generated by A. A system (1) that satisfies the above conditions will be denoted by Σ(A,C). The admissibility of C, eqn. (2), implies that we can extend the mapping z0 → CT (·)z0 to a bounded linear mapping from Z to L2(0,∞). We denote this mapping by C. Thus we have that for any initial condition z0 the solution of (1) is given by z(t) = T (t)z...

Kwaśniewski’s cobweb posets uniquely represented by directed acyclic graphs are such a generalization of the Fibonacci tree that allows joint combinatorial interpretation for all of them under admissibility condition. This interpretation was derived in the source papers and it entailes natural enquieres already formulated therein. In our note we response to one of those problems. This is a tili...

Let Sp(n,R) be the symplectic group, and K∗ n its maximal compact subgroup. Then G = Sp(n,R)/K∗ n can be realized as the Siegel domain of type one. The square-integrable representation of G gives the admissible wavelets AW and wavelet transform. The characterization of admissibility condition in terms of the Fourier transform is given. The Bergman kernel follows from the viewpoint of coherent s...

The largest class of hyperstructures is the one which satisfies the  weak properties. We connect the theory of P-hopes, a large class of  hyperoperations, with the Lie-Santilli admissibility used in  Hardonic Mechanics. This can be achieved by a kind of Ree,  sandwich hyperoperation.

A method based on conceptual tools of predictive control is described for tackling tracking problems of uncertain linear systems wherein pointwise-in-time input and/or state inequality constraints are present. The method consists of adding to a primal compensated system a nonlinear device called Predictive Reference Filter (PRF) which manipulates the desired reference in order to fullll the pre...

We study dispersive properties of one-dimensional surface waterwaves under surface tension, based on the formulation of the problem as a nonlinear dispersive equation coupled with a transport-type equation. We establish a dispersion estimate on time scales depending on the size of the frequencies. We infer that, if s is large enough, then a solution u of the dispersive equation satisfies local-...