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

In many experiments, the Nash equilibrium concept seems not to predict well. One reason may be that players have non-selfish preferences over outcomes. As a consequence, even when they are told what the material payoffs of the game are, mutual knowledge of preferences may not be satisfied. We...

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