A Common Interest game is a game in which there exists a unique vector of payoffs which strictly Pareto-dominates all other payoffs. We consider the undiscounted repeated game obtained by the infinite repetition of such an n-player Common Interest game. We restrict supergame strategies to be computable within Church's thesis, and we introduce computable trembles on these strategies. If the trem...

We study the problem of providing two public goods on tree networks, in which each agent has a single-peaked preference. We show that if the number of agents is at least four, then there exists no social choice rule that satisfies efficiency and replacement– domination. In fact, it is shown that these two properties are incompatible even if agents’ preferences are restricted to a smaller domain...

This paper suggests a theory of choice among strategic situations when the rules of play are not properly specified. We take the view that a “strategic situation” is adequately described by a TU game since it specifies what is feasible for each coalition but is silent on the procedures that are used to allocate the surplus. We model the choice problem facing a decision maker (DM) as having to c...

In a market with stochastic demand at most one seller can acquire costly information about demand. Other sellers entertain idiosyncratic beliefs about the market demand and the probability that an informed seller is trading in the market. These idiosyncratic beliefs co-evolve with the potential insider’s inclination to acquire information. True demand expectations are not evolutionarily stable ...

We discuss four solution concepts for games with incomplete information. We show how each solution concept can be viewed as encoding informational robustness. For a given type space, we consider expansions of the type space that provide players with additional signals. We distinguish between expansions along two dimensions. First, the signals can either convey payoff relevant information or onl...

We consider the problem of dividing some amount of an infinitely divisible and homogeneous resource among agents having claims on this resource that cannot be jointly honored. A “rule” associates with each such problem a feasible division. Our goal is to uncover the structure of the space of rules. For that purpose, we study “operators” on the space, that is, mappings that associate to each rul...

We consider the problem of allocating some amount of an infinitely divisible and homogeneous resource among agents having claims on this resource that cannot be jointly honored. A “rule” associates with each such problem a feasible division. Our goal is to uncover the structure of the space of rules. For that purpose, we study “operators” on the space, that is, mappings that associate to each r...

We study the problem of allocating objects when monetary transfers are possible. We are interested in mechanisms that allocate the objects in an e cient way and induce the agents to report their true preferences. Within the class of such mechanisms, rst we characterize egalitarian-equivalent mechanisms. Then, we add a bounded-de cit condition and characterize the corresponding class. Finally, w...

Two standard schemes for awarding a prize have been examined in the literature. The prize is awarded (πD) deterministically: to the contestant with the highest output; (πP ) probabilistically: to all contestants, with probabilities proportional to their outputs. Our main result is that if there is suffi cient diversity in contestants’skills, and not too much noise on output, then πP will elicit...

We propose a model on strategic formation of communication networks with (i) link specificity: the more direct links somebody maintains, the less she can specify her attention per link, the lower her links’ value, while this negative externality was previously ignored in the communication context, and (ii) value transferability via indirect links for informational but not for social value from ...