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

12/26/2018
by   Haoyang Wu, et al.
0

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 agents' types are modelled as their private information, what the designer can do is to construct a mechanism and choose an outcome after observing a specific profile of agents' strategies. Traditionally, the designer has no way to adjust agents' types and hence may be in a dilemma in the sense that even if she is not satisfied with some outcome, she has to announce it because she must obey the mechanism designed by herself. In this paper, we consider a generalized case where the designer can actively adjust agents' private types. After defining a series of notions such as adjusted types, adjustable mechanism, 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 a maximum expected profit greater than what she obtains in the traditional optimal auction.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/26/2018

Profitable Bayesian implementation

In mechanism design theory, a designer would like to implement a desired...
research
12/26/2018

Profitable Bayesian implementation in one-shot mechanism settings

In the mechanism design theory, a designer would like to implement a des...
research
11/16/2020

The revelation principle fails when the format of each agent's strategy is an action

In mechanism design theory, a designer would like to implement a social ...
research
01/21/2021

Mechanism Design for Cumulative Prospect Theoretic Agents: A General Framework and the Revelation Principle

This paper initiates a discussion of mechanism design when the participa...
research
02/19/2018

Incentive Design in a Distributed Problem with Strategic Agents

In this paper, we consider a general distributed system with multiple ag...
research
04/27/2018

Probabilistic Verification for Obviously Strategyproof Mechanisms

Obviously strategyproof (OSP) mechanisms maintain the incentive compatib...
research
02/27/2023

Private Blotto: Viewpoint Competition with Polarized Agents

Colonel Blotto games are one of the oldest settings in game theory, orig...

Please sign up or login with your details

Forgot password? Click here to reset