Mechanism Design with Moral Bidders

11/20/2021
by   Shahar Dobzinski, et al.
0

A rapidly growing literature on lying in behavioral economics and psychology shows that individuals often do not lie even when lying maximizes their utility. In this work, we attempt to incorporate these findings into the theory of mechanism design. We consider players that have a preference for truth-telling and will only lie if their benefit from lying is sufficiently larger than the loss of the others. To accommodate such players, we introduce α-moral mechanisms, in which the gain of a player from misreporting his true value, comparing to truth-telling, is at most α times the loss that the others incur due to misreporting. We develop a theory of moral mechanisms in the canonical setting of single-item auctions. We identify similarities and disparities to the standard theory of truthful mechanisms. In particular, we show that the allocation function does not uniquely determine the payments and is unlikely to admit a simple characterization. In contrast, recall that monotonicity characterizes the allocation function of truthful mechanisms. Our main technical effort is invested in determining whether the auctioneer can exploit the preference for truth-telling of the players to extract more revenue comparing to truthful mechanisms. We show that the auctioneer can extract more revenue when the values of the players are correlated, even when there are only two players. However, we show that truthful mechanisms are revenue-maximizing even among moral ones when the values of the players are independently drawn from certain identical distributions. As a by product we get an alternative proof to Myerson's characterization in the settings that we consider. We flesh out this approach by providing an alternative proof to Myerson's characterization that does not involve moral mechanisms whenever the values are independently drawn from regular distributions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/19/2022

Rigidity in Mechanism Design and its Applications

We introduce the notion of rigidity in auction design and use it to anal...
research
02/25/2020

Fair and Truthful Mechanisms for Dichotomous Valuations

We consider the problem of allocating a set on indivisible items to play...
research
04/18/2018

Optimal Deterministic Mechanisms for an Additive Buyer

We study revenue maximization by deterministic mechanisms for the simple...
research
10/31/2022

Monotonic Mechanisms for Selling Multiple Goods

Maximizing the revenue from selling two or more goods has been shown to ...
research
02/27/2021

Improved Two Sample Revenue Guarantees via Mixed-Integer Linear Programming

We study the performance of the Empirical Revenue Maximizing (ERM) mecha...
research
01/30/2023

The Cost of Sybils, Credible Commitments, and False-Name Proof Mechanisms

Consider a mechanism that cannot observe how many players there are dire...
research
12/05/2022

Characterization of incentive compatible single-parameter mechanisms revisited

We reexamine the characterization of incentive compatible single-paramet...

Please sign up or login with your details

Forgot password? Click here to reset