Beyond Independent Manipulation: Individual Fairness-aware Strategic Classification with Peer Imitation

• URL: http://arxiv.org/abs/2606.00827v1
• Date: Sat, 30 May 2026 17:54:37 GMT
• Title: Beyond Independent Manipulation: Individual Fairness-aware Strategic Classification with Peer Imitation
• Abstract summary: We introduce individual fairness-aware strategic classification (IFSC), a framework that models peer-driven manipulation arising from individual fairness.<n>IFSC characterizes strategic manipulation as similarity-based imitation toward visible accepted peers.<n>Experiments on synthetic and real-world datasets demonstrate that IFSC improves individual-fairness consistency and mitigates imitation-induced distortions.
• Score: 44.485292101066115
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Strategic classification (SC) investigates scenarios where agents manipulate their features to obtain favorable decisions from predictive models. Existing fairness-aware SC approaches primarily focus on group fairness and typically assume that agents respond independently. However, when individual fairness is required, ensuring similar individuals receive similar outcomes, agents' manipulation becomes interdependent: an agent's preferred manipulation depends on the neighborhoods' outcomes. This induces a mismatch between classical SC formulations and fairness-aware decision settings, where independent models no longer accurately characterize strategic manipulations. To address this issue, we introduce individual fairness-aware strategic classification (IFSC), a framework that models peer-driven manipulation arising from individual fairness, where agents imitate nearby positively decided peers to obtain favorable outcomes. IFSC characterizes strategic manipulation as similarity-based imitation toward visible accepted peers and learns classifiers under the resulting post-manipulation distributions. To account for uncertainty in peer observability, IFSC employs a robust learning process that introduces stochastic perturbations during manipulation simulation. Experiments on synthetic and real-world datasets demonstrate that IFSC improves individual-fairness consistency and mitigates imitation-induced distortions.

Related papers

• Strategic Feature Selection [62.74494413516484]
  We study strategic classification through feature selection and its interaction with ridge regularization.<n>We provide a fine-grained characterization of the performance of a feature subset under optimal regularization.<n>Motivated by this characterization, we develop a practical algorithm for jointly choosing the feature set and the level of ridge regularization.
  arXiv  Detail & Related papers  (2026-06-17T09:47:15Z)
• Partial Fairness Awareness: Belief-Guided Strategic Mechanism for Strategic Agents [23.40393298376199]
  We propose the problem of partial fairness awareness (PFA)<n>We introduce a belief-guided strategic mechanism, wherein agents iteratively interact with the decision system and maintain a belief distribution over the candidate set of fairness constraints.<n>This belief-guided process enables agents, through iterative interaction and feedback, to update their belief distribution over the candidate set, thereby gradually aligning their belief with the grounding fairness constraint employed by the system.
  arXiv  Detail & Related papers  (2026-05-30T17:53:43Z)
• Beyond Rational Illusion: Behaviorally Realistic Strategic Classification [56.458581740660236]
  We propose the Prospect-Guided Strategic Framework (Pro-SF) to address the behaviorally realistic strategic classification problem.<n>Pro-SF is a principled framework grounded in prospect theory to model and learn under behaviorally realistic strategic responses.<n> Experiments on synthetic and real-world datasets establish Pro-SF as a behaviorally grounded approach to strategic classification.
  arXiv  Detail & Related papers  (2026-05-19T11:04:55Z)
• Do Fair Models Reason Fairly? Counterfactual Explanation Consistency for Procedural Fairness in Credit Decisions [0.0]
  We show that existing outcome-fair models can still apply fundamentally different reasoning to individuals.<n>We propose Counterfactual Explanation Consistency ( CEC), a framework that detects and mitigates this bias.<n>Key contributions include a nearest-neighbor counterfactual generation method, a modified baseline for integrated gradient comparisons, and a corresponding training loss.
  arXiv  Detail & Related papers  (2026-05-12T19:54:25Z)
• Multimodal Learning on Low-Quality Data with Conformal Predictive Self-Calibration [72.0672328514289]
  Multimodal learning often grapples with the challenge of low-quality data.<n>We propose a unified framework, termed Conformal Predictive Self-Calibration.<n>Our framework consistently outperforms existing state-of-the-art methods.
  arXiv  Detail & Related papers  (2026-05-05T14:48:52Z)
• Individual Fairness In Strategic Classification [7.903744240517792]
  Strategic classification, where individuals modify their features to influence machine learning (ML) decisions, presents critical fairness challenges.<n>We analyze threshold-based classifiers and prove that deterministic thresholds violate individual fairness.<n>We introduce conditions under which a randomized classifier ensures individual fairness and leverage these conditions to find an optimal and individually fair randomized classifier.<n> Experiments on real-world datasets confirm that our method effectively mitigates unfairness and improves the fairness-accuracy trade-off.
  arXiv  Detail & Related papers  (2026-02-04T22:09:18Z)
• Gaming the Judge: Unfaithful Chain-of-Thought Can Undermine Agent Evaluation [76.5533899503582]
  Large language models (LLMs) are increasingly used as judges to evaluate agent performance.<n>We show this paradigm implicitly assumes that the agent's chain-of-thought (CoT) reasoning faithfully reflects both its internal reasoning and the underlying environment state.<n>We demonstrate that manipulated reasoning alone can inflate false positive rates of state-of-the-art VLM judges by up to 90% across 800 trajectories spanning diverse web tasks.
  arXiv  Detail & Related papers  (2026-01-21T06:07:43Z)
• 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)
• Fed-CBS: A Heterogeneity-Aware Client Sampling Mechanism for Federated Learning via Class-Imbalance Reduction [76.26710990597498]
  We show that the class-imbalance of the grouped data from randomly selected clients can lead to significant performance degradation. Based on our key observation, we design an efficient client sampling mechanism, i.e., Federated Class-balanced Sampling (Fed-CBS) In particular, we propose a measure of class-imbalance and then employ homomorphic encryption to derive this measure in a privacy-preserving way.
  arXiv  Detail & Related papers  (2022-09-30T05:42:56Z)

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.