Publication Type
Working Paper
Version
publishedVersion
Publication Date
11-2021
Abstract
I study the optimal algorithmic disclosure in a lending market where lenders use a predictive algorithm to mitigate adverse selection. The predictive algorithm is unobservable to borrowers and uses a manipulable borrower feature as input. A regulator maximizes market efficiency by disclosing information about the statistical properties of variables embedded in the predictive algorithm to borrowers. Under the optimal disclosure policy, the posterior belief consists of two disjoint regions in which the borrower feature is more relevant and less relevant in predicting borrower quality, respectively. The optimal disclosure policy differentiates posterior lending market equilibria by the equilibrium data manipulation levels. Equilibria with more data manipulation hurt market efficiency, but also discourage lenders’ use of the borrower feature. Equilibria with less data manipulation benefit from that and generate more efficient market outcomes. Unconditionally, the borrower feature is used less intensively under optimal disclosure. This information design problem can be reduced to a one-dimensional maximization problem by imposing a mild distributional assumption on manipulation cost. As an extension, I also discuss the joint design of algorithmic disclosure and costly verification.
Keywords
adverse selection, FinTech, Bayesian persuasion, algorithmic transparency
Discipline
Finance | Finance and Financial Management
Research Areas
Finance
First Page
1
Last Page
70
Citation
SUN, Jian.
Algorithmic transparency. (2021). 1-70.
Available at: https://ink.library.smu.edu.sg/lkcsb_research/7109
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
https://www.jian-sun.com/_files/ugd/41f990_d7878dbc34aa40a2bf5dde151adf7f3a.pdf
Comments
This is my job market paper, it's still a working paper, and I haven't submitted it to any journal yet.