IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2512.02424.html

Optimal Comprehensible Targeting

Author

Listed:
  • Walter W. Zhang

Abstract

Developments in machine learning and big data allow firms to fully personalize and target their marketing mix. However, data and privacy regulations, such as those in the European Union (GDPR), incorporate a "right to explanation," which is fulfilled when targeting policies are comprehensible to customers. This paper provides a framework for firms to navigate right-to-explanation legislation. First, I construct a class of comprehensible targeting policies that is represented by a sentence. Second, I show how to optimize over this class of policies to find the profit-maximizing comprehensible policy. I further demonstrate that it is optimal to estimate the comprehensible policy directly from the data, rather than projecting down the black box policy into a comprehensible policy. Third, I find the optimal black box targeting policy and compare it to the optimal comprehensible policy. I then empirically apply my framework using data from a price promotion field experiment from a durable goods retailer. I quantify the cost of explanation, which I define as the difference in expected profits between the optimal black box and comprehensible targeting policies. Compared to the black box benchmark, the comprehensible targeting policy reduces profits by 7.5% or 23 cents per customer.

Suggested Citation

  • Walter W. Zhang, 2025. "Optimal Comprehensible Targeting," Papers 2512.02424, arXiv.org.
  • Handle: RePEc:arx:papers:2512.02424
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2512.02424
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2512.02424. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.