This paper’s objective is to use SKAT, the author’s Stages of Knowledge Ahead Theory of risk, to shed fresh light on the treatment and prevention of mental disorders. SKAT employs a broad definition of risk that allows for nice – not merely nasty – possibilities. SKAT is here shown to...

This paper’s objective is to use SKAT, the author’s Stages of Knowledge Ahead Theory of risk, to shed fresh light on the treatment and prevention of mental disorders. SKAT employs a broad definition of risk that allows for nice – not merely nasty – possibilities. SKAT is here shown to...

This paper reports the first experimental study of the serial and the average cost pricing mechanism under three different treatments: a complete information treatment and two treatments designed to simulate distributed systems like the Internet with extremely limited information, synchronous...

In a recent paper Bagwell (1995) pointed out that only the Cournot outcome, but not the Stackelberg outcome, can be supported by a pure Nash equilibrium when actions of the Stackelberg leader are observed with the slightest error. The Stackelberg outcome, however, remains close to the outcome of...

We report an experiment on a decision task by SAMUELSON and BAZERMAN (1985). Subjects submit a bid for an item with an unknown value. A winner’s curse phenomenon arises when subjects bid too high and make losses. Learning direction theory can account for this. However, other influences on...

The paper deals with bounded rationality understood in the tradition of H.A. Simon. Fundamental problems and theoretical issues are discussed. Special emphasis is put on aspiration adaptation theory. Further remarks concern basic models of decision behavior (like learning and expectation...

The rational expectations hypothesis is supported if rational expectations are stable with respect to reasonable learning procedures. We consider the Stochastic Gradient-Algorithm as a boundedly rational learning procedure in an univariate ARX-Model with forecast feedback. We prove that whenever...

In consectutive rounds, each agent in a finite population chooses an action, is randomly matched, obtains a payoff and then observes the performance of another agent. An agent determines future behavior based on the information she receives from the present round. She chooses among the...

We use an experiment to explore how subjects learn to play against computers which are programmed to follow one of a number of standard learning algorithms. The learning theories are (unbeknown to subjects) a best response process, fictitious play, imitation, reinforcement learning, and a trial...

In this note we study a very simple trial & error learning process in the context of a Cournot oligopoly. Without any knowledge of the payoff functions players increase, respectively decrease, their quantity by one unit as long as this leads to higher profits. We show that despite the absence of...