For many problems of statistical inference in regression modelling, the Fisher information matrix depends on certain nuisance parameters which are unknown and which enter the model nonlinearly. A common strategy to deal with this problem within the context of design is to construct maximin...

The problem of constructing standardized maximin D-optimal designs for weighted polynomial regression models is addressed. In particular it is shown that, by following the broad approach to the construction of maximin designs introduced recently by Dette, Haines and Imhof (2003), such designs...

We derive strong uniform approximations for the eigenvalues in general Laguerre and Hermite beta-ensembles by showing that the maximal discrepancy between the suitably scaled eigenvalues and roots of orthogonal polynomials converges almost surely to zero when the dimension converges to infinity....

An explicit formulation of D- and DS-optimal designs for the binary logistic regression model in several variables, without interaction between the variables, is presented. The proof of the optimality of the designs is “traditional” in the sense that it invokes the Equivalence Theorem, and...

The repeated Prisoner's Dilemma is usually known as a story of tit-for-tat (TFT). This remarkable strategy has won both of Robert Axelrod's tournaments. TFT does whatever the opponent has done in the previous round. It will cooperate if the opponent has cooperated, and it will defect if the...

We analyze a class of imitation dynamics with mutations for games with any finite number of actions, and give conditions for the selection of a unique equilibrium as the mutation rate becomes small and the population becomes large. Our results cover the multiple-action extensions of the...