In the framework of the provision of one pure public good, we characterize the class of strategy-proof voting schemes on single-plateaued preferences over a convex and closed subset of the real line (the set of feasible levels of the public good).

A voting scheme assigns to each profile of alternatives chosen by "n" individuals a compromise alternative. Here the set of alternatives is represented by the Euclidean plane. The individual utilities for the compromise point are equal to the negatives of the distances of this point to the...

We consider the allocation of a finite number of indivisible objects to the same number of agents according to an exogenously given queue. We assume that the agents collaborate in order to achieve an efficient outcome for society. We allow for side-payments and provide a method for obtaining...

This paper studies the stability of a finite local public goods economy in horizontal differentiation, where a jurisdiction's choice of the public good is given by an exogenous decision scheme. In this paper, we characterize the class of decision schemes that ensure the existence of an...

This paper presents results from experiments with finitely repeated games with complete and incomplete information. We use two treatment variables: the number of rounds the game is played and the value of the probability that reflects the presence of incomplete information.

We study situations of allocating positions or jobs to students or workers based on priorities. An example is the assignment of medical students to hospital residencies on the basis of one or several entrance exams. For markets without couples, e.g., for ``undergraduate student placement,''...

We study two-sided matching markets with couples and show that for a natural preference domain for couples, the domain of weakly responsive preferences, stable outcomes can always be reached by means of decentralized decision making. Starting from an arbitrary matching, we construct a path of...

We propose and analyze a new solution concept, the R solution, for three-person, transferable utility, cooperative games. In the spirit of the Nash Bargaining Solution, our concept is founded on the predicted outcomes of simultaneous, two-party negotiations that would be the alternative to the...