We provide yet another proof of the existence of calibrated forecasters; it has two merits. First, it is valid for an arbitrary finite number of outcomes. Second, it is short and simple and it follows from a direct application of Blackwell’s approachability theorem to carefully chosen vector-valued payoff function and convex target set. Our proof captures the essence of existing proofs based on...

We prove an identity between three infinite families of polynomials which are defined in terms of ‘bosonic’, ‘fermionic’, and ‘one-dimensional configuration’ sums. In the limit where the polynomials become infinite series, they give different-looking expressions for the characters of the two integrable representations of the affine su(2) algebra at level one. We conjecture yet another fermionic...

Over the years many easily computable strategies for the game of Mastermind have been proposed. In this paper we present a new strategy (at least to our knowledge) that performs better than the wellknown strategies: guess the code that has the highest number of possible answers. It is motivated and compared to four well-known strategies. Some empirical results are presented and discussed.

We use the kernel category to give a finiteness condition for semigroups. As a consequence we provide yet another proof that finitely generated periodic semigroups of matrices are finite.

Many navigation techniques have been tried out and implemented by many researchers. However, their research is focused on the navigation techniques themselves (how to turn, how to move forward/backwards, how to change the speed of travel, etc.), and not on how precise the navigation is in complex virtual environments when many turns need to be taken to reach a destination. In addition, in many ...

Since the introduction of the h-index in 2005 (Hirsch, 2005), many h-type indices have been proposed. In this short note, we propose yet another h-type index, which differs from other proposals in the way that it takes recent change in the value of the h-index into account. As such, we are convinced that this proposal is more useful for hiring purposes than the lifetime-achievement h-index. For...

We propose a theory of intertemporal choice that is robust to specific assumptions on the discount rate. One class of models requires that one utility stream be chosen over another if and only if its discounted value is higher for all discount factors in a set. Another model focuses on an average discount factor. Yet another model is pessimistic, and evaluates a flow by the lowest available dis...

Predicting overall student performance and monitoring progress have attracted more attention in the past five years than before. Demographic data, high school grades and test result constitute much of the data used for building prediction models. This study demonstrates how data from a peer-assessment environment can be used to build student progress prediction models. The possibility for autom...

This paper presents yet another argument for the view that both the causative and inchoative verbs in the Japanese causative alternation are syntactically equally complex, derived independently from common bases. While morphological considerations alone suggest that such an approach must be taken to account for cases involving equipollent alternations, which have overt morphemes for both the ca...