I investigate the decision problem of a player in a game of incomplete information who faces uncertainty about the other players' strategies. I propose a new decision criterion which works in two steps. First, I assume common knowledge of rationality and eliminate all strategies which are not...

In contexts in which players have no priors, we analyze a learning process based on ex-post regret as a guide to understand how to play games of incomplete information under private values. The conclusions depend on whether players interact within a fixed set (fixed matching) or they are...

In this paper, we investigate behavior in two-player sequential-move contests with complete and incomplete information about the value of the prize, theoretically and experimentally. First, we describe a Bayesian equilibrium of a sequential contest in which both players have private prize...

This paper considers the introduction of stock options in an (dynamically) incomplete securities market made up of a riskless bond and the stock. The stock price follows a geometric Brownian motion with constant drift. However, there is incomplete information about the unknown stochastic...

In contexts in which players have no priors, we analyze a learning process based on ex-post regret as a guide to understand how to play games of incomplete information under private values. The conclusions depend on whether players interact within a fixed set (fixed matching) or they are...

This paper analyzes the signaling effect of bidding in a two-round elimination contest. Before the final round, bids in the preliminary round are revealed and act as signals of the contestants' private valuations. Depending on his valuation, a contestant may have an incentive to bluff or sandbag...

In this paper we analyze sequencing situations under incomplete information where agents have interdependent costs. We first argue why Vickrey-Clarke-Groves (or VCG) mechanism fails to implement a simple sequencing problem in dominant strategies. Given this impossibility, we try to implement...

In mechanism design problems under incomplete information, it is generally difficult to find decision problems that are first best implementable. A decision problem under incomplete information is first best implementable if there exists a mechanism that extracts the private information and...