Optimal Taxation under Imperfect Trust
Emin Ablyatifov and
Georgy Lukyanov ()
Papers from arXiv.org
Abstract:
We study optimal taxation when citizens are not fully confident that the government will transform tax revenue into useful public goods. In an otherwise standard Ramsey framework, a representative agent values a public good financed by distortionary taxes, but believes that the government is honest only with some given probability and may otherwise divert all revenue. This simple departure from the canonical model delivers two central results. First, there is a sharp trust threshold: if perceived government honesty is too low, any positive tax rate lowers expected welfare and the optimal policy is a zero-tax corner, even though the public good is valued. Second, once trust exceeds this threshold, the usual sufficient-statistics logic of optimal taxation re-emerges, but with a trust-adjusted marginal value of public funds that scales down the benefits of raising revenue. In a simple parametric example we obtain closed-form expressions that map trust into the optimal tax rate and the size of the public sector. The framework provides a compact way to incorporate government credibility into tax design and suggests that in low-trust environments credibility-enhancing reforms should precede attempts to expand the tax base.
Date: 2025-09, Revised 2025-11
New Economics Papers: this item is included in nep-pbe, nep-pub and nep-soc
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)
Downloads: (external link)
http://arxiv.org/pdf/2509.03085 Latest version (application/pdf)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:2509.03085
Access Statistics for this paper
More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().