We consider the problem of a principal who wishes to contract with a privately informed agent and is not able to commit to not renegotiating any mechanism. That is, we allow the principal, after observing the outcome of a mechanism to renegotiate the resulting contract without cost by proposing...

We consider the problem of a principal who wishes to contract with a privately informed agent and is not able to commit to not renegotiating any mechanism. That is, we allow the principal, after observing the outcome of a mechanism to renegotiate the resulting contract without cost by proposing...

This study explores mechanism design with allocation-based social preferences. Agents’ social preferences and private payoffs are all subject to asymmetric information. We assume quasi-linear utility and independent types. We show how the asymmetry of information about agents’ social...

This study explores mechanism design with allocation-based social preferences. Agents' social preferences and private payoffs are all subject to asymmetric information. We assume quasi-linear utility and independent types. We show how the asymmetry of information about agents' social preferences...

In a sequencing problem with linear time cost, Suijs (1996) proved that it is possible to achieve first best. By first best we mean that one can find mechanisms that satisfy efficiency of decision, dominant strategy incentive compatibility and budget balancedness. In this paper we show that...

Diagnostic errors are prevalent and can result in severe patient harm. Identifying a correct diagnosis often necessitates significant diagnostic effort. Nonetheless, most physician payment schemes are procedure-based and do not account for diagnostic effort or accuracy, due to observability...

It is well known that delegating the play of a game to an agent via incentive contracts may serve as a commitment device and hence provide a strategic advantage. Previous literature has shown that any Nash equilibrium outcome of an extensive-form principals-only game can be supported as a...

We consider the problem of fairly allocating one indivisible object when monetary transfers are possible, and examine the existence of Bayesian incentive compatible mechanisms to solve the problem. We propose a mechanism that satisfies envy-freeness, budget balancedness, and Bayesian incentive...

We consider rules (strategies, commitments, contracts, or computer programs) that make behavior contingent on an opponent's rule. The set of perfectly observable rules is not well defined. Previous contributions avoid this problem by restricting the rules deemed admissible. We instead limit the...