In contexts in which players have no priors, we analyze a learning process based on ex-post regret as a guide to understand how to play games of incomplete information under private values. The conclusions depend on whether players interact within a fixed set (fixed matching) or they are...

In contexts in which players have no priors, we analyze a learning process based on ex-post regret as a guide to understand how to play games of incomplete information under private values. The conclusions depend on whether players interact within a fixed set (fixed matching) or they are...

We furnish conditions on the primitives of a Bayesian game that guarantee the existence of a Bayes-Nash equilibrium. By allowing for payoff discontinuities in actions, we cover various applications that cannot be handled by extant results.

Motivated by trying to better understand the norms that govern pedestrian traffic, I study symmetric two-player coordination games with independent private values. The strategies of "always pass on the left" and "always pass on the right" are always equilibria of this game. Some such games,...

For any given set-valued solution concept, it is possible to consider iterative elimination of actions outside the solution set. This paper applies it to define the concept of iterated monotone potential maximizer (iterated MP-maximizer). It is shown that under some monotonicity conditions, an...

In this paper we provide sufficient conditions for a social choice rule to be implementable in strong Nash equilibrium in the presence of partially honest agents, that is, agents who break ties in favor of a truthful message when they face indifference between outcomes. In this way, we achieve a...

This paper proposes a general competing mechanism game of incomplete information where a mechanism allows its designer to send a message to himself at the same time agents send messages. This paper introduces a notion of robust equilibrium. If each agent’s payoff function is separable with...