We consider the problem of simultaneously testing multiple one-sided null hypotheses. Single-step procedures, such as the Bonferroni test, are characterized by the fact that the rejection or non-rejection of a null hypothesis does not take the decision for any other hypothesis into account. For stepwise test procedures, such as the Holm procedure, the rejection or non-rejection of a null hypoth...

The generalized Bonferroni mean is able to capture some interaction effects between variables and model mandatory requirements. We present a number of weights identification algorithms we have developed in the R programming language in order to model data using the generalized Bonferroni mean subject to various preferences. We then compare its accuracy when fitting to the journal ranks dataset.

The Bonferroni mean BM was introduced by Bonferroni six decades ago but has been a hot research topic recently since its usefulness of the aggregation techniques. The desirable characteristic of the BM is its capability to capture the interrelationship between input arguments. However, the classical BM andGBM ignore theweight vector of aggregated arguments, the general weighted BM WBM has not t...

in order to estimate the effects of the macrc~econornic indicators on the income distribution of iran, the time series data during the period of 1971-1991 were used. first the yammetric inequality indicators (the gini coefficients) were estimated for the years 1991-1972. the results show the lowest level of inequality in 1980 with g=0.42 and the highest level in 1982 with g=0.55. arzulysing the...

equitable distribution of income and economic growth are challenges for policy-makers. therefore, it is important to investigate the influencing factors of it. given that financial development is an important factor affecting on income inequality, in this study, the effect of financial development on the gini coefficient as income inequality index is examined with using panel data methods durin...

The notion of h-hypertree was deened in 9] in order to improve the Bonferroni inequalities. We prove that the problem of nding the optimal spanning h-hypertree of a complete hypergraph is NP complete, for h 3. Moreover, no polynomial time approximate algorithm even with poor approximation ratio seems to exist for this problem. The existence of such an algorithm for the minimum version achieving...