License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ITCS.2022.55
URN: urn:nbn:de:0030-drops-156513
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2022/15651/
Dobzinski, Shahar ;
Oren, Sigal
Mechanism Design with Moral Bidders
Abstract
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. Note that a 0-moral mechanism is a truthful mechanism.
We develop a theory of moral mechanisms in the canonical setting of single-item auctions within the "reasonable" range of α, 0 ≤ α ≤ 1. 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 indeed 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 (e.g., the uniform and exponential distributions).
A by-product of our proof that optimal moral mechanisms are truthful is an alternative proof to Myerson’s optimal truthful mechanism characterization in the settings that we consider. We flesh out this approach by providing an alternative proof that does not involve moral mechanisms to Myerson’s characterization of optimal truthful mechanisms to all settings in which the values are independently drawn from regular distributions (not necessarily identical).
BibTeX - Entry
@InProceedings{dobzinski_et_al:LIPIcs.ITCS.2022.55,
author = {Dobzinski, Shahar and Oren, Sigal},
title = {{Mechanism Design with Moral Bidders}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {55:1--55:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2022/15651},
URN = {urn:nbn:de:0030-drops-156513},
doi = {10.4230/LIPIcs.ITCS.2022.55},
annote = {Keywords: Mechanism Design, Cognitive Biases, Revenue Maximization}
}
|
Keywords: |
|
Mechanism Design, Cognitive Biases, Revenue Maximization |
|
Collection: |
|
13th Innovations in Theoretical Computer Science Conference (ITCS 2022) |
|
Issue Date: |
|
2022 |
|
Date of publication: |
|
25.01.2022 |
