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

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

This research states the stylised n 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 after pertaining first-order conditions. Boundary...