Resolution and sensitivity of the eyes of the Asian honeybees Apis florea, Apis cerana and Apis dorsata

Bees of the genus Apis are important foragers of nectar and pollen resources. Although the European honeybee, Apis mellifera, has been well studied with respect to its sensory abilities, learning behaviour and role as pollinators, much less is known about the other Apis species. We studied the anatomical spatial resolution and absolute sensitivity of the eyes of three sympatric species of Asian honeybees, Apis cerana, Apis florea and Apis dorsata and compared them with the eyes of A. mellifera. Of these four species, the giant honeybee A. dorsata (which forages during moonlit nights) has the lowest spatial resolution and the most sensitive eyes, followed by A. mellifera, A. cerana and the dwarf honeybee, A. florea (which has the smallest acceptance angles and the least sensitive eyes). Moreover, unlike the strictly diurnal A. cerana and A. florea, A. dorsata possess large ocelli, a feature that it shares with all dim-light bees. However, the eyes of the facultatively nocturnal A. dorsata are much less sensitive than those of known obligately nocturnal bees such as Megalopta genalis in Panama and Xylocopa tranquebarica in India. The differences in sensitivity between the eyes of A. dorsata and other strictly diurnal Apis species cannot alone explain why the former is able to fly, orient and forage at half-moon light levels. We assume that additional neuronal adaptations, as has been proposed for A. mellifera, M. genalis and X. tranquebarica, might exist in A. dorsata.

Absolutely expedient algorithms for learning Nash equilibria

This paper considers a multi-person discrete game with random payoffs. The distribution of the random payoff is unknown to the players and further none of the players know the strategies or the actual moves of other players. A class of absolutely expedient learning algorithms for the game based on a decentralised team of Learning Automata is presented. These algorithms correspond, in some sense, to rational behaviour on the part of the players. All stable stationary points of the algorithm are shown to be Nash equilibria for the game. It is also shown that under some additional constraints on the game, the team will always converge to a Nash equilibrium.

Learning automata in feedforward connectionist systems

This paper analyses the behaviour of a general class of learning automata algorithms for feedforward connectionist systems in an associative reinforcement learning environment. The type of connectionist system considered is also fairly general. The associative reinforcement learning task is first posed as a constrained maximization problem. The algorithm is approximated hy an ordinary differential equation using weak convergence techniques. The equilibrium points of the ordinary differential equation are then compared with the solutions to the constrained maximization problem to show that the algorithm does behave as desired.