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

This paper provides a unified approach to equilibrium analysis in models for competing mechanisms (e.g., Szentes (2009), Yamashita (2010)), which may differ in terms of delegation of action choice, announcement of mechanisms, observability of messages, and equilibrium notions