Algorithmic Assistance with Recommendation-Dependent Preferences

TL;DR

This paper models how algorithmic recommendations can influence human decision-makers' preferences, potentially leading to over-reliance, and proposes algorithms that strategically withhold recommendations to improve decision quality.

Contribution

It introduces a joint human-machine decision-making model accounting for recommendation-dependent preferences and designs algorithms that improve outcomes by selectively withholding suggestions.

Findings

Recommendation-dependent preferences cause decision over-reliance.

Algorithms withholding recommendations can enhance decision quality.

Proposed algorithm is minimax optimal in confidence-based recommendation withholding.

Abstract

When an algorithm provides risk assessments, we typically think of them as helpful inputs to human decisions, such as when risk scores are presented to judges or doctors. However, a decision-maker may react not only to the information provided by the algorithm. The decision-maker may also view the algorithmic recommendation as a default action, making it costly for them to deviate, such as when a judge is reluctant to overrule a high-risk assessment for a defendant or a doctor fears the consequences of deviating from recommended procedures. To address such unintended consequences of algorithmic assistance, we propose a model of joint human-machine decision-making. Within this model, we consider the effect and design of algorithmic recommendations when they affect choices not just by shifting beliefs, but also by altering preferences. We motivate this assumption from institutional factors, such as a desire to avoid audits, as well as from well-established models in behavioral science that predict loss aversion relative to a reference point. We show that recommendation-dependent preferences create inefficiencies where the decision-maker is overly responsive to the recommendation. As a remedy, we discuss algorithms that strategically withhold recommendations and show how they can improve the quality of final decisions. Concretely, we prove that an intuitive algorithm achieves minimax optimality by sending recommendations only when it is confident that their implementation would improve over an unassisted baseline decision.