Logo
Munich Personal RePEc Archive

Generalizing mechanism design theory to a case where agents' types are adjustable

Wu, Haoyang (2018): Generalizing mechanism design theory to a case where agents' types are adjustable.

Warning
There is a more recent version of this item available.
[thumbnail of MPRA_paper_90804.pdf] PDF
MPRA_paper_90804.pdf

Download (88kB)

Abstract

In mechanism design theory, a designer would like to implement a desired social choice function which specifies her favorite outcome for each possible profile of all agents' types. Since the designer does not know each agent's private type, what she can do is to construct a mechanism and choose an outcome after observing a profile of agents' strategies. There is a dilemma in the sense that even if the designer is not satisfied with some outcome, she has to obey the mechanism designed by herself and announce this outcome. In this paper, we generalize the mechanism design theory to a case where the designer can take some action to actively adjust agents' private types, and yield a more favorite outcome. After defining a series of notions such as adjustable types, optimal adjustment cost and profitably Bayesian implementability, we propose that the traditional notion of Bayesian incentive compatibility does not hold in this generalized case. Finally, we construct a model to illustrate that the auctioneer can obtain an expected profit greater than what she obtains in the traditional optimal auction.

Available Versions of this Item

Atom RSS 1.0 RSS 2.0

Contact us: mpra@ub.uni-muenchen.de

This repository has been built using EPrints software.

MPRA is a RePEc service hosted by Logo of the University Library LMU Munich.