have proposed a family of algorithms based on a simple psychological mechanism: onereason decision making. These fast and frugal algorithms violate fundamental tenets of classical rationality: They neither look up nor integrate all information. By computer simulation, the authors held a competition

–117]. This construction is substantially more complicated than the corresponding construction for classical Turing machines (TMs); in fact, even simple primitives such as looping, branching, and composition are not straightforward in the context of quantum Turing machines. We establish how these familiar primitives can

. In this paper classical matrix perturbation theory is approached from a probabilistic point of view. The perturbed quantity is approximated by a first-order perturbation expansion, in which the perturbation is assumed to be random. This permits the computation of statistics estimating

use of these methods in an online setting suitable for real-time applications. In this paper we consider online learning in a Reproducing Kernel Hilbert Space. By considering classical stochastic gradient descent within a feature space, and the use of some straightforward tricks, we develop simple

In the multiarmed bandit problem, a gambler must decide which arm of K non-identical slot machines to play in a sequence of trials so as to maximize his reward. This classical problem has received much attention because of the simple model it provides of the trade-off between exploration (trying

A two-step maximum likelihood procedure is proposed for estimating simultaneous probit models and is compared to alternative limited information estimators. Conditions under which each estimator attains the Cramer-Rao lower bound are obtained. Simple tests for exogeneity based on the new two

outer bounds are. In this work, we show that the existing outer bounds can in fact be arbitrarily loose in some parameter ranges, and by deriving new outer bounds, we show that a very simple and explicit Han–Kobayashi type scheme can achieve to within a single bit per second per hertz (bit

of monetary theory and the appli-cation of them to the techniques of quantitative economic analysis.... One can safely predict that it will be the classic reference on its subject for many years to come. H. G. Johnson (1965, 388) The book is clearly destined to become a classic, perhaps one of the few

repeated game. We show here how incomplete information about one or both players ’ options, motivation or behavior can explain the observed cooperation. Specifically, we provide a bound on the number of rounds at which Fink may be played, when one player may possibly be committed to a “Tit

Recently a great deal of attention has focused on quantum computation following a sequence of results [4, 16, 15] suggesting that quantum computers are more powerful than classical probabilistic computers. Following Shor’s result that factoring and the extraction of discrete logarithms are both