Optimal Decision Making Under Strategic Behavior 3: A Three-Value Instance with General Costs Where No Optimal Policy Is Outcome MonotonicResearch Paper
Motivation
When a decision rule is announced in advance, people may change the features on which the rule acts. A lender, for example, may offer loans with different probabilities to applicants with different reported characteristics. An applicant then weighs the greater chance of receiving a loan against the cost of changing those characteristics. The decision maker must account for this response when choosing the rule. Tsirtsis and coauthors study this problem with a finite feature set and a policy that specifies the probability of a positive decision at each value.
If moving to a better-outcome feature costs more and moving to a worse-outcome feature costs nothing, the paper shows that at least one optimal policy can be chosen to respect the ordering of outcomes. Section 5 asks what remains of that conclusion when change costs are general. Its three-value example answers the question sharply: an optimal policy exists, but no optimal policy respects outcome monotonicity. The example isolates the role played by the cost assumption in the earlier result. Source, §§4–5
Setting
There are feature values . An individual initially has value with probability . At feature value , the probability of a positive underlying outcome is . A decision policy assigns a positive-decision probability to each value. The decision maker incurs a cost for a positive decision. This is the paper's base model: the individual benefit is , and the outcome probability does not change when an individual changes features. Source, §2, p. 3, equations (1)–(3)
An individual at may move to , paying change cost . Their best response maximizes over all destinations. If several destinations tie, the paper selects one with the highest outcome probability . The resulting population distribution depends on . The decision maker's strategic utility is the expected outcome surplus under that response:
This sum is equation (7) regrouped by each individual's initial value. An optimal policy maximizes it over every policy in . The paper assumes a positive cost for moving to a distinct feature whose outcome is at least as good as the starting feature; its Section 5 matrix meets that assumption. Source, §3, pp. 4–5, equations (5) and (7)
The example has , , , and . Rows of the following matrix are starting features and columns are destinations:
Moving from to the lower-outcome costs . That violates the zero-cost requirement for such moves in the paper's outcome monotonic cost definition. A policy is called outcome monotonic here when a larger positive-decision probability implies a larger outcome probability: . Source, §§2, 4–5, pp. 3, 6, 9
Formalization targets
The printed optimal family
For every admissible policy with , , and , the paper states that is optimal and that individuals initially at move to :
The endpoint matters: the move from to ties with staying in benefit less cost, and the paper's outcome tie rule chooses . Source, §5, p. 9
Goal: no outcome monotonic optimum
The principal target formalizes the Section 5 heading in this fixed instance:
The existence clause rules out an empty optimal set. This formulation follows the heading's assertion that an outcome-monotonic optimum may fail to exist, while the printed family supplies concrete optima. Source, §5, p. 9
Significance
The result gives an explicit boundary for the earlier outcome-monotonic-policy guarantee. With the Section 5 costs, favoring the lowest-outcome value as much as the highest-outcome value can be optimal, because the response to a published policy changes where population mass receives decisions. Thus a search restricted to outcome-monotonic policies can miss every optimum in a general-cost instance. The milestone on the printed family records a full interval of optimal policies, including its tie endpoint. Source, §§4–5, pp. 6, 9
The paper proves its example informally; this mission asks for a machine-checked account of the fixed instance and the universal quantifiers behind “every” and “no.” The development also yields reusable definitions for finite strategic policies, the outcome-aware best response, and utility. The other missions in this series treat the additive-cost theorem and a stochastic-optimum example separately. No theorem in this mission is presented as an open research problem.
Difficulty
Checking that one displayed policy has high utility is insufficient to establish optimality over every policy in . The best response changes at equality thresholds, so utility is piecewise defined and may jump when the tie rule changes the destination. The closed bound makes one such threshold part of the statement. A finite numerical grid misses both arbitrary real policies and the exact tie behavior. The negative goal also requires excluding outcome monotonicity for every maximizer, rather than exhibiting one nonmonotonic maximizer.
Formalization scope
The features are Fin 3 in the example, with Lean indices representing . The general model uses Fin m with a nonempty finite feature set. Probabilities, costs, and utility are real numbers; the example's decimals are exact rational reals. Policies range over all real-valued functions with each coordinate in , and optimality uses IsMaxOn on precisely that set. The best response is constructed from the maximizers of and then the largest . If tied destinations also have equal , the least index is chosen; the example has distinct outcome probabilities, so this final convention never affects its claims.
Equation (1) prints strict outcome and policy comparisons as a biconditional, although the paper's later policy class permits equal policy values at distinct outcomes. This mission uses its one-way implication from a strict policy comparison to a strict outcome comparison. Failure of this weaker condition is a stronger counterexample than failure of the printed biconditional. The cost definition applies its printed pair and triple comparisons only to distinct values and records , as required for free staying. The example's constants satisfy the paper's standing positive-upward-cost assumption. These readings are disclosed so the formal claim has a consistent, nonvacuous model.
A complete proof needs finite argmax reasoning, exact rational inequalities, a case analysis over real policy regions, and the semantics of IsMaxOn. The finite best-response and utility definitions can be reused for other strategic-decision instances. Contributions may establish the printed family, its transport claim, bounds for all admissible policies, or the final exclusion of monotonic maximizers. Policies are never restricted to a grid, and the best response is computed from the model data rather than supplied as a free variable. The paper's algorithms, complexity claims, empirical studies, and changes to are outside this mission.
Selected references
- S. Tsirtsis, B. Tabibian, M. Khajehnejad, A. Singla, B. Schölkopf, and M. Gomez-Rodriguez, Optimal Decision Making Under Strategic Behavior, Management Science, 2024. arXiv:1905.09239v5, the source version used here.