We consider an exchange economy with an atomless space of consumers whose preference relations need not be monotone. We prove that if for every commodity, there is a group of consumers who regard it as potentially desirable, in a sense to be made precise, then there exists a competitive...

In this paper, we generalize the lattice theoretical comparative statics by Li Calzi and Veinott, and Milgrom and Shannon. While their theorem is constructed on lattices, particularly on partially ordered sets, we do not require the antisymmetry on a binary relation defined on the set. On the...

The standard Le Chatelier Principle states that the long-run demand for a good (in which by definition there are fewer restraints on the variables) is more elastic than short-run demand. The fundamental insight above goes well beyond demand theory, and proofs of this basic idea have been found...

A contractive method for computing stationary solutions of intertemporal equilibrium models is provided. The method is implemented using a contraction mapping derived from the first-order conditions. The deterministic dynamic programming problem is used to illustrate the method. Some numerical...

Financial economists usually assess market efficiency in absolute terms. This is a shortcoming. One way of dealing with the relative efficiency of markets is to resort to the efficiency interpretation provided by algorithmic complexity theory. This paper employs such an approach in order to rank...

This paper develops a model for optimal capital investment in continuous time when both existing and new capital stocks are subject to uncertainty. The model is generalized to allow for large and infrequent changes in the dynamics of the capital stock, which may arise as a result of natural and...

The infinitely repeated prisoners' dilemma has a multiplicity of Pareto-unranked equilibria. This leads to a battle of the sexes problem of coordinating on a single efficient outcome. One natural method of achieving coordination is for the players to bargain over the set of possible equilibrium...

We assess gains from parallel computation on Backlight supercomputer. The information transfers are expensive. We find that to make parallel computation efficient, a task per core must be sufficiently large, ranging from few seconds to one minute depending on the number of cores employed. For...

This work casts light upon a pair of restrictions inherent to the basic weighted updating model, which is a generalization of Bayesian updating that allows for biased learning. Relaxing the restrictions allows for the study of individuals who discriminate between observations or who treat...

In this paper, we generalize the lattice theoretical comparative statics by Li Calzi and Veinott, and Milgrom and Shannon. While their theorem is constructed on lattices, particularly on partially ordered sets, we do not require the antisymmetry on a binary relation defined on the set. On the...