In this paper, we study N-player Colonel Blotto games with incomplete information about battlefield valuations. Such games arise in job markets, research and development, electoral competition, security analysis, and conflict resolution. For M Ï N + 1 battlefields, we identify a Bayes-Nash...

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

We consider a class of incomplete-information Colonel Blotto games in which N Ï 2 agents are engaged in (N + 1) battlefields. An agent's vector of battlefield valuations is drawn from a generalized sphere in Lp-space. We identify a Bayes-Nash equilibrium in which any agent's resource allocation...

Heifetz, Meier and Schipper (2005) introduced a generalized state-space model that allows for non-trivial unawareness among several individuals and strong properties of knowledge. We show that this generalized state-space model arises naturally if states consist of maximally consistent sets of...

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

This paper studies the incentives for interim voluntary disclosure of verifiable information in probabilistic all-pay contests. Provided that the contest is uniformly asymmetric, full revelation is the unique perfect Bayesian equilibrium outcome. This is so because the weakest type of the...

This paper studies the incentives for interim voluntary disclosure of verifiable information in probabilistic all-pay contests with two-sided incomplete information. Private information may concern marginal cost, valuations, and ability. Our main result says that, if the contest is uniformly...

We define an extensive-form analogue of iterated admissibility, called Prudent Rationalizability (PR). In each round of the procedure, for each information set of a player a surviving strategy of hers is required to be rational vis-a-vis a belief system with a full-support belief on the...

We define a generalized state-space model with interactive unawareness and probabilistic beliefs. Such models are desirable for potential applications of asymmetric unawareness. We compare unawareness with probability zero belief. Applying our unawareness belief structures, we show that the...

We define generalized extensive-form games which allow for mutual unawareness of actions. We extend Pearce's (1984) notion of extensive-form (correlated) rationalizability to this setting, explore its properties and prove existence.