Optimal Decision Making Under Strategic Behavior

Author:

Tsirtsis Stratis1ORCID,Tabibian Behzad2,Khajehnejad Moein3,Singla Adish4,Schölkopf Bernhard5,Gomez-Rodriguez Manuel1ORCID

Affiliation:

1. Max Planck Institute for Software Systems, 67663 Kaiserslautern, Germany;

2. Reasonal, Inc., 10119 Berlin, Germany;

3. Monash University, Melbourne, Victoria 3800, Australia;

4. Max Planck Institute for Software Systems, 66123 Saarbrücken, Germany;

5. Max Planck Institute for Intelligent Systems, 72076 Tübingen, Germany

Abstract

We are witnessing an increasing use of data-driven predictive models to inform decisions in high-stakes situations, from lending and hiring to university admissions. As decisions have implications for individuals and society, there is increasing pressure on decision makers to be transparent about their decision policies. At the same time, individuals may use knowledge, gained by transparency, to invest effort strategically in order to maximize their chances of receiving a beneficial decision. Our goal is to find decision policies that are optimal in terms of utility in such a strategic setting. First, we characterize how strategic investment of effort by individuals leads to a change in the feature distribution. Using this characterization, we show that, in general, optimal decision policies are hard to find in polynomial time, and there are cases in which deterministic policies are suboptimal. Then, we demonstrate that, if the cost individuals pay to change their features satisfies a natural monotonicity assumption, we can narrow down the search for the optimal policy to a particular family of decision policies with a set of desirable properties, which allow for a highly effective polynomial time-heuristic search algorithm using dynamic programming. Finally, under no assumptions on the cost, we develop an iterative search algorithm that is guaranteed to converge to locally optimal decision policies. Experiments on synthetic and real credit card data illustrate our theoretical findings and show that the decision policies found by our algorithms achieve higher utility than those that do not account for strategic behavior. This paper was accepted by Vivek Farias, data science. Funding: This work was supported by Machine Learning Cluster of Excellence [EXC #2064/1, Project #390727645], H2020 European Research Council [Grant 945719], and Bundesministerium für Bildung und Forschung [Grant 01IS18039B]. Supplemental Material: The online appendix and data files are available at https://doi.org/10.1287/mnsc.2021.02567

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3