We define a generalized state-space model with interactive unawareness and probabilistic beliefs. Such models are desirable for many potential applications of asymmetric unawareness. We develop Bayesian games with unawareness, define equilibrium, and prove existence. We show how equilibria are...

In this paper we introduce incomplete information à la global games into a max-min two-group contest with binary actions and we characterize the set of equilibria. Depending on whether the complete information assumption is relaxed on the value of the prize or on the cost of providing effort,...

This paper studies incentives for the interim voluntary disclosure of verifiable information in probabilistic all-pay contests. Considered are unfair contests, i.e., contests in which, subject to activity conditions, one player (the favorite) is interim always more likely to win than the other...

Algorithms for equilibrium computation generally make no attempt to ensure that the computed strategies are understandable by humans. For instance the strategies for the strongest poker agents are represented as massive binary files. In many situations, we would like to compute strategies that...