Sequential Strategic Classification with Multi-Stage Selective Classifiers

• URL: http://arxiv.org/abs/2605.04202v1
• Date: Tue, 05 May 2026 18:42:21 GMT
• Title: Sequential Strategic Classification with Multi-Stage Selective Classifiers
• Abstract summary: We study the problem where self-interested individuals or agents manipulate their response to obtain favorable decision outcomes.<n>Prior works have demonstrated a fundamental inability to get out of this conundrum by only focusing on the design of a classifier.<n>This paper introduces a sequential, multi-stage model of strategic classification, by capturing how agents adapt their behavior.
• Score: 11.395181681423892
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Strategic classification studies the problem where self-interested individuals or agents manipulate their response to obtain favorable decision outcomes made by classifiers, typically turning to dishonest actions when they are less costly than genuine efforts. Prior works have demonstrated a fundamental inability to get out of this conundrum by only focusing on the design of a classifier. We note that prior work also heavily focuses on either one-shot settings or repeated interaction with the same classifier. Real-world decision making is often multi-stage, involving a sequence of potentially different classifiers as an agent progresses. This paper introduces a sequential, stochastic, multi-stage model of strategic classification, by capturing how agents adapt their behavior, through improvement actions (enhancing both observable features and true attributes) and gaming actions (enhancing only observable features), over multiple levels of classification with increasing difficulty as well as reward. For each level, we adopt a selective classifier that can abstain from making a prediction at low confidence. Consequently, a positive (resp. negative) outcome leads to promotion (resp. demotion) of the agent to the next higher (resp. lower) level, while abstention keeps the agent at the same level. We fully characterize the agent's optimal instantaneous action under selective classifiers and compare the long-term properties and utility of the agent repeatedly following an optimal myopic policy of either no-improvement (never choose the improvement action) or no-gaming (never choose the gaming action). We further examine design principles over the sequence of classifiers that yield higher long-term utility for the latter policy, thereby effectively incentivizing genuine effort in the long run.

Related papers

• Reuse Before You Retrieve: Diagnosing Headroom and Complementarity for Test-Time Augmentation of Embodied Multimodal Policies [56.86456077356948]
  Frozen-language-action (VLA) policies are increasingly improved at test time.<n>Additional sampling is useful only when better behavior already exists within the policy's rollouts.<n>Retrieval is most useful when the relevant action prior is not reliably represented by the policy.
  arXiv  Detail & Related papers  (2026-08-18T08:11:31Z)
• APPO: Agentic Procedural Policy Optimization [28.730334202611257]
  We study agentic RL from two perspectives: textitwhere to branch and how to assign credit after branching<n>We propose APPO, which shifts branching and credit assignment from coarse interaction units to fine-grained decision points in the sequence.<n>APPO consistently improves strong agentic RL baselines by nearly 4 points, while keeping efficient tool-calls and maintaining behavior interpretability.
  arXiv  Detail & Related papers  (2026-06-10T17:47:07Z)
• Multi-Level Strategic Classification: Incentivizing Improvement through Promotion and Relegation Dynamics [11.395181681423892]
  We study the problem where self-interested individuals or agents manipulate their response to obtain favorable decision outcomes.<n>Our model captures the critical inter-temporal incentives driven by an agent's farsightedness, skill retention, and a leg-up effect where qualification and attainment can be self-reinforcing.<n>We prove that under mild conditions, this mechanism enables agents to reach arbitrarily high levels solely through genuine improvement efforts.
  arXiv  Detail & Related papers  (2026-02-11T23:35:21Z)
• When In Doubt, Abstain: The Impact of Abstention on Strategic Classification [11.395181681423892]
  This paper studies abstention within a strategic classification context.<n>We show that optimal abstention ensures that the principal's utility is no worse than in a non-abstention setting.<n>We also show that abstention can also serve as a deterrent to manipulation, making it costlier for agents to manipulate to achieve a positive outcome.
  arXiv  Detail & Related papers  (2025-10-15T09:13:44Z)
• Know When to Abstain: Optimal Selective Classification with Likelihood Ratios [10.317060648446828]
  We revisit the design of optimal selection functions through the lens of the Neyman-Pearson lemma.<n>We show that this perspective unifies the behavior of several post-hoc selection baselines, and also motivates new approaches to selective classification.<n>We evaluate our proposed methods across a range of vision and language tasks, including both supervised learning and vision-language models.
  arXiv  Detail & Related papers  (2025-05-21T01:26:21Z)
• Strategic Classification With Externalities [11.36782598786846]
  We propose a new variant of the strategic classification problem.<n>Motivated by real-world applications, our model crucially allows the manipulation of one agent to affect another.<n>We show that under certain assumptions, the pure Nash Equilibrium of this agent manipulation game is unique and can be efficiently computed.
  arXiv  Detail & Related papers  (2024-10-10T15:28:04Z)
• DCIR: Dynamic Consistency Intrinsic Reward for Multi-Agent Reinforcement Learning [84.22561239481901]
  We propose a new approach that enables agents to learn whether their behaviors should be consistent with that of other agents. We evaluate DCIR in multiple environments including Multi-agent Particle, Google Research Football and StarCraft II Micromanagement.
  arXiv  Detail & Related papers  (2023-12-10T06:03:57Z)
• Pure Exploration under Mediators' Feedback [63.56002444692792]
  Multi-armed bandits are a sequential-decision-making framework, where, at each interaction step, the learner selects an arm and observes a reward. We consider the scenario in which the learner has access to a set of mediators, each of which selects the arms on the agent's behalf according to a and possibly unknown policy. We propose a sequential decision-making strategy for discovering the best arm under the assumption that the mediators' policies are known to the learner.
  arXiv  Detail & Related papers  (2023-08-29T18:18:21Z)
• Inferring Lexicographically-Ordered Rewards from Preferences [82.42854687952115]
  This paper proposes a method for inferring multi-objective reward-based representations of an agent's observed preferences. We model the agent's priorities over different objectives as entering lexicographically, so that objectives with lower priorities matter only when the agent is indifferent with respect to objectives with higher priorities.
  arXiv  Detail & Related papers  (2022-02-21T12:01:41Z)
• Randomized Entity-wise Factorization for Multi-Agent Reinforcement Learning [59.62721526353915]
  Multi-agent settings in the real world often involve tasks with varying types and quantities of agents and non-agent entities. Our method aims to leverage these commonalities by asking the question: What is the expected utility of each agent when only considering a randomly selected sub-group of its observed entities?''
  arXiv  Detail & Related papers  (2020-06-07T18:28:41Z)
• Incentivizing Exploration with Selective Data Disclosure [70.11902902106014]
  We propose and design recommendation systems that incentivize efficient exploration. Agents arrive sequentially, choose actions and receive rewards, drawn from fixed but unknown action-specific distributions. We attain optimal regret rate for exploration using a flexible frequentist behavioral model.
  arXiv  Detail & Related papers  (2018-11-14T19:29:16Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.