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...

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...

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 investigate a canonical search-theoretic model without entry. Two agents are randomly matched with a long side being rationed. The matched agents face a pair of randomly drawn non-transferable payoffs, and then choose whether or not to form a partnership subject to a small probability of...

We study how players learn to make decisions if they face many different games. Games are drawn randomly from a set of either two or six games in each of 100 rounds. If either there are few games or if extensive summary information is provided (or both) convergence to the unique Nash equilibrium...

We study the problem of assigning a set of objects to a set of agents, when each agent receives one object and has strict preferences over the objects. In the absence of monetary transfers, we focus on the probabilistic rules, which take the ordinal preferences as input. We characterize the...

We show that collusion and wrong beliefs may cause a dramatic efficiency loss in the Vickrey mechanism for auctioning a single good in limited supply. We thus put forward a new mechanism guaranteeing efficiency in a very adversarial collusion model, where the players can partition themselves...