In the present paper we consider the allocation of costs in connection networks. Agents have connection demands in form of pairs of locations they want to have connected. Connections between locations are costly to build. The problem is to allocate costs of networks satisfying all connection...

In Poisson games, an extension of perfect equilibrium based on perturbations of the strategy space does not guarantee that players use admissible actions. This observation suggests that such a class of perturbations is not the correct one. We characterize the right space of perturbations to...

We study the infinitely repeated prisonerʼs dilemma with the option to maintain or to quit relationships. We show that if agents imitate successful strategies infrequently, defection is not dynamically stable and cooperation emerges regardless of the initial distribution of strategies.

We consider a robust version of the classic problem of optimal monopoly pricing with incomplete information. In the robust version, the seller faces model uncertainty and only knows that the true demand distribution is in the neighborhood of a given model distribution. We characterize the...

We characterize revenue maximizing mechanisms in auction settings with ‘rich’ type spaces, where bidders obtain information from sources other than their own valuation. By considering a relaxed problem, we provide an upper bound on revenue extraction that explicitly builds on the richness of...

The value of information is examined in a single-agent environment with unawareness. Although the agent has a correct prior about events he is aware of and has a clear understanding of his available actions and payoffs, his unawareness may lead him to commit information processing errors and to...

We consider dynamic auction mechanisms for the allocation of multiple items. Items are identical, but have different expiration times, and each item must be allocated before it expires. Buyers are of dynamic nature, and arrive and depart over time. Our goal is to design mechanisms that maximize...

This paper characterizes the set of equilibrium payoffs in bargaining with interdependent values when the informed party makes all offers, as discounting vanishes. The seller of a good is informed of its quality, which affects both his cost and the buyer's valuation, but the buyer is not. To...

This paper develops a model of repeated interaction in social networks among agents with differing degrees of sophistication. The focus of the model is observational learning; that is, each agent receives initial private information and makes inferences regarding the private information of...

I extend Myersonʼs [R. Myerson, Optimal auction design, Math. Oper. Res. 6 (1981) 58–73] ironing technique to more general objective functions. The approach is based on a generalized notion of virtual surplus which can be maximized pointwise even when the monotonicity constraint implied by...