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

A well-known result in incentive theory is that for a very broad class of decision problems, there is no mechanism which achieves truth-telling in dominant strategies, efficiency and budget balancedness (or first best implementability). On the contrary, Mitra and Sen (1998), prove that linear...

This research states the stylised n (more than two) players' splitting problem as a mathematical programme, relying on definitions of the values of the game and problem stationarity to generate tractable reduced forms, and derives the known solutions according to the properties of pertaining...

Sequential search problems such as secretary problems can be extended to a natural zero-sum two-player game where the Decision Maker faces an opponent with a similar move set. This paper analyzes the game for a sequential search problem known as the Cayley-Moser problem, which falls under the...

Italian Abstract: Vengono esposti i principi base della teoria delle aste. Quali le questioni da risolvere, quali ingredienti, quali ipotesi necessarie per semplificare una teoria altrimenti piuttosto complessa. Vengono sviluppati i meccanismi d'asta al I e al II prezzo, risolvendo per le...

We analyze the performance of various communication protocols in a generalization of the Crawford-Sobel (1982) model of cheap talk that allows for multiple receivers. We find that whenever the sender can communicate informatively with both receivers by sending private messages, she can...

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

If communication involves some transactions cost to both sender and recipient, what policy ensures that correct messages - those with positive social surplus - get sent? Filters block messages that harm recipients but benefit senders by more than transactions costs. Taxes can block positive...

This note considers a bargaining environment with two-sided asymmetric information and quasilinear preferences in which parties select bargaining mechanism after learning their valuations. I demonstrate that sometimes the buyer achieves a higher ex-ante payoff if the bargaining mechanism is...