Robust designs for multinomial models

Abstract

Model misspecification in generalized linear models (GLMs) occurs usually when the linear predictor and/or the link function assumed are incorrect. This article discusses the effect of such misspecification on design selection for multinomial GLMs and proposes the use of quantile dispersion graphs to select robust designs. Due to misspecification in the model, parameter estimates are usually biased and the designs are compared on the basis of their mean squared error of prediction. Several numerical examples including a real data set are presented to illustrate the proposed methodology.     

Estimation in Second-Order Models with Errors in the Factor Levels

The impact of errors in the factor levels is examined on the estimation of parameters in second-order response models. Errors can occur in setting the factor levels for response surface and robust parameter design models. These errors can lead to heterogeneity of variances in model errors that make ordinary least squares estimation inappropriate. Weighted least squares and maximum likelihood estimation approaches are developed as viable alternatives where it is assumed the variances and covariances of the errors are known. Performance of these estimation techniques are examined in simulation studies for two examples. Another example is given that applies these results.     

Designs Robust Against the Presence of an Aberration in a Diallel Cross Design Setup

In this article, we find designs insensitive to the presence of an outlier in a diallel cross design setup for estimating a complete set of orthonormal contrasts among the effects of the general combining abilities of a set of parental lines. The criterion of robustness, suggested by Mandal (1989 Mandal , N. K. ( 1989 ). On robust designs . Cal. Stat. Assoc. Bull. 38 : 115 – 119 . [Google Scholar]) in block design setup and used by Biswas (2012 Biswas , A. ( 2012 ). Block designs robust against the presence of an aberration in a treatment-control setup . Commun. Statist. Theor. Meth. 41 : 920 – 933 .[Taylor & Francis Online], [Web of Science ®] , [Google Scholar]) in treatment-control setup, is adapted here. Complete diallel cross designs, suggested by Gupta and Kageyama (1994 Gupta , S. , Kageyama , S. ( 1994 ). Optimal complete diallel crosses . Biometrika 81 : 420 – 424 .[Crossref], [Web of Science ®] , [Google Scholar]), and partial diallel cross designs, suggested by Gupta et al. (1995 Gupta , S. , Das , A. , Kageyama , S. ( 1995 ). Single replicate orthogonal block designs for circulant partial diallel crosses . Commun. Statist. A 24 : 2601 – 2607 .[Taylor & Francis Online] , [Google Scholar]) and Mukerjee (1997 Mukerjee , R. ( 1997 ). Optimal partial diallel crosses . Biometrika 84 : 939 – 948 .[Crossref], [Web of Science ®] , [Google Scholar]), are found to be robust under certain conditions.     

Modified Robust Second-Order Slope-Rotatable Designs

Generally it is very difficult to construct robust slope-rotatable designs along axial directions. Present paper focuses on modified second-order slope-rotatable designs (SOSRDs) with correlated errors. Modified robust second-order slope-rotatability conditions are derived for a general variance–covariance structure of errors. These conditions get simplified for intraclass correlation structure. A few robust second-order slope-rotatable designs (over all directions, or with equal maximum directional variance slope, or D-optimal slope) are examined with respect to modified robust slope-rotatability. It is observed that robust second-order slope-rotatable designs over all directions, or with equal maximum directional variance slope, or D-optimal slope are not generally modified robust second-order slope-rotatable designs.     

Optimal strategies for the one-round discrete Voronoi game on a line

The one-round discrete Voronoi game, with respect to a n-point user set  $\mathcal {U}$ , consists of two players Player 1 (P1) and Player 2 (P2). At first, P1 chooses a set $\mathcal{F}_{1}$ of m facilities following which P2 chooses another set $\mathcal{F}_{2}$ of m facilities, disjoint from  $\mathcal{F}_{1}$ , where m(=O(1)) is a positive constant. The payoff of P2 is defined as the cardinality of the set of points in $\mathcal{U}$ which are closer to a facility in $\mathcal{F}_{2}$ than to every facility in $\mathcal{F}_{1}$ , and the payoff of P1 is the difference between the number of users in $\mathcal{U}$ and the payoff of P2. The objective of both the players in the game is to maximize their respective payoffs. In this paper, we address the case where the points in $\mathcal{U}$ are located along a line. We show that if the sorted order of the points in $\mathcal{U}$ along the line is known, then the optimal strategy of P2, given any placement of facilities by P1, can be computed in O(n) time. We then prove that for m≥2 the optimal strategy of P1 in the one-round discrete Voronoi game, with the users on a line, can be computed in $O(n^{m-\lambda_{m}})$ time, where 0<λ _m <1, is a constant depending only on m.     

The Melancholic Name

How to think the gift of the name that announces the finitude of the named and the name itself, insofar as finitude is not reducible to the negativity of the concept and sense, a Gift to the other insofar as the other concerns us with his finitude? There is, as it were, a note of melancholy that adheres our finite existence, which also intimates the very gift that is given to the other. The whole question of the ethico‐political, understood here as being‐towards‐others, is at stake here. The article reads Schelling, Heidegger and Benjamin to think anew the place of language as gift and its concern with the thoughts of the political.     

Binary designs are not always the best

We give an example of a nonbinary block design which is better than any binary design with respect to the E-optimality criterion. This shows that the class of binary designs is not essentially complete, at least with respect to E-optimality.