On Admissibility and Uniform Admissibility in Finite Population Sampling
نویسندگان
چکیده
منابع مشابه
Checking Admissibility in Finite Algebras
Checking if a quasiequation is admissible in a finite algebra is a decidable problem, but the naive approach, i.e., checking validity in the corresponding free algebra, is computationally unfeasible. We give an algorithm for obtaining smaller algebras to check admissibility and a range of examples to demonstrate the advantages of this approach.
متن کاملAdmissibility of Linear Predictors of Finite Population Parameters under Reflected Normal Loss Function
One of the most important prediction problems in finite population is the prediction of a linear function of characteristic values of a finite population. In this paper the admissibility of linear predictors of an arbitrary linear function of characteristic values in a finite population under reflected normal loss function is considered. Under the super-population model, we obtain the condition...
متن کاملOn the Lie-Santilli Admissibility
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.
متن کاملInference Rules in Nelson's Logics, Admissibility and Weak Admissibility
Our paper aims to investigate inference rules for Nelson’s logics and to discuss possible ways to determine admissibility of inference rules in such logics. We will use the technique offered originally for intuitionistic logic and paraconsistent minimal Johannson’s logic. However, the adaptation is not an easy and evident task since Nelson’s logics do not enjoy replacement of equivalences rule....
متن کاملAdmissibility and Event-rationality Admissibility and Event-rationality
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 Annals of Statistics
سال: 1975
ISSN: 0090-5364
DOI: 10.1214/aos/1176343077