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

The paper addresses the mechanism design problem of eliciting truthful information from a committee of informed experts who collude in their information disclosure strategies. It is shown that under fairly general conditions full information disclosure is possible if and only if the induced...

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

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

This paper studies optimal decision rules for a decision maker who can consult two experts in an environment without monetary payments. This extends the previous work by Holmström (1984) and Alonso and Matouschek (2008) who consider environments with one expert. In order to derive optimal...

We consider a dynamic auction environment with a long-lived seller and short-lived buyers mediated by a third party. A mediator has incomplete information about traders' values and selects an auction mechanism to maximize her expected revenue. We characterize mediator-optimal mechanisms and show...

In e-commerce, where information collection is essentially costless and geographic location of traders matters very little, fierce competition between providers of similar services is expected. We consider a model where two e-commerce intermediaries (internet shops) compete for sellers. We show...