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

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 an incomplete information setting, we analyze the sealed bid auction proposed by Knaster (cf. Steinhaus (1948)). This procedure was designed to efficiently and fairly allocate multiple indivisible items when participants report their valuations truthfully. In equilibrium, players do not...

In many auctions, matching between the bidder and seller raises the value of the contract for both parties. However, information about the quality of the match may be incomplete. We consider the case in which each bidder observes the quality of his match with the seller but the seller does not...

In many auctions, a good match between the bidder and seller raises the value of the contract for both parties although information about the quality of the match may be incomplete. This paper examines the case in which the bidder is better informed about the quality of his match with the seller...

We study a sealed-bid auction between two bidders with asymmetric independent private values. The two bidders own asymmetric shares in a partnership. The higher bidder buys the lower bidder's shares at a per-unit price that is a convex combination of the two bids. The weight of the lower bid is...

We introduce a general class of simplicity standards that vary the foresight abilities required of agents in extensive-form games. Rather than planning for the entire future of a game, agents are presumed to be able to plan only for those histories they view as simple from their current...

We introduce a general class of simplicity standards that vary the foresight abilities required of agents in extensive-form games. Rather than planning for the entire future of a game, agents are presumed to be able to plan only for those histories they view as simple from their current...