Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

8162331 · Feb 202019922001200920172026
48 results for strategic manipulation

New framework reduces strategic manipulation cost for minority groups in fair classification.

problem Strategic manipulation disparities in fair classification.
method Constrained optimization framework that constructs classifiers to reduce strategic manipulation cost for minority groups.
result Empirically, the approach reduces strategic manipulation cost for minority groups over multiple real-world datasets.

Study strategic dynamic pricing for buyers with unknown manipulation costs.

problem Strategic buyers manipulate their features to get lower prices, hindering profit maximization.
method Proposes a strategic dynamic pricing policy that incorporates strategic behavior and binary response data.
result Achieves sublinear regret bound of O(T)O(\sqrt{T}) compared to linear Ω(T)Ω(T) regret of non-strategic policies.

Strategic feature manipulation helps learners identify meaningful variables in online regression settings.

problem Strategic feature manipulation poses a challenge for learners in online regression settings.
method Investigates how strategic feature manipulation by individuals can help learners recover meaningful features.
result Simple learner behavior can help accurately recover meaningful features and incentivize feature improvement.

Modified Perceptron handles strategic agents with limited position changes.

problem Learning linear classifiers in the presence of strategic agents that can manipulate their positions.
method Developed a modified Perceptron algorithm with bounded mistakes under various manipulation costs.
result The modified Perceptron achieves bounded mistakes even when manipulation costs are unknown.

The results of a learning process depend on the input data. There are cases in which an adversary can strategically tamper with the input data to affect the outcome of the learning process. While some datasets are difficult to attack, many others are susceptible to manipulation. A resourceful attacker can tamper with l…

2019-01-16abs ↗pdf ↗

Study compares employers with and without anticipating strategic labor force responses.

problem Understanding and optimizing strategic interactions in labor markets.
method Formulation of causal strategic classification, theory, and experiments.
result Performatively optimal hiring policies improve employer and labor outcomes, but can also harm labor force utility.

When consequential decisions are informed by algorithmic input, individuals may feel compelled to alter their behavior in order to gain a system's approval. Models of agent responsiveness, termed "strategic manipulation," analyze the interaction between a learner and agents in a world where all agents are equally able …

2018-08-27abs ↗pdf ↗

Paper generalizes strategic classification framework and introduces SVC for PAC-learning.

problem Strategic manipulation of testing data to fool classifiers.
method Unified framework for strategic classification, strategic VC-dimension (SVC).
result Characterizes the learnability and computational tractability of linear classifiers.

Research examines how strategic latency manipulation impacts Ethereum's network efficiency and decentralization.

problem Impact of artificial latency on Ethereum's network efficiency and decentralization.
method Comprehensive analysis of MEV-Boost auction system and empirical validation with a pilot.
result Increased profitability for node operators and significant systemic challenges like heightened network inefficiencies and centralization risks.

Collectives can manipulate learning platforms by coordinated data submission, requiring strategic assessments and algorithms.

problem Collectives can influence learning platforms by altering data, posing risks and requiring strategic planning.
method Developed a theoretical and algorithmic framework to understand and mitigate collective manipulation of learning platforms.
result Demonstrated the need for strategic assessments and implementable coordination algorithms to prevent collective manipulation.

Study allocates resources to strategic agents while balancing cost and incentives.

problem Dynamic allocation of reusable resources to strategic agents with private valuations under long-term cost constraints.
method Incentive-aware framework combining epoch-based lazy updates and randomized exploration rounds.
result Achieves ildeO(T) ilde{\mathcal{O}}(\sqrt{T}) social welfare regret, satisfies all cost constraints, and ensures incentive alignment.

Algorithm learns optimal coordination for strategic agents in uncertain settings.

problem Optimizing rewards for strategic agents with private types and actions.
method Combines delaying mechanism, reward angle estimation, and LinUCB algorithm.
result Near optimal regret bound of O~(T)\tilde{O}(\sqrt{T}) for learning optimal policy.

This paper examines how wash traders exploit market conditions in Bitcoin, finding strategic timing and spillover effects.

problem Wash trading in cryptocurrency markets to inflate volume and manipulate market conditions.
method Analysis of 18 million Mt. Gox transactions, exogenous demand shock study.
result Wash trading intensifies in low legitimate trading volume and responds to demand shocks, indicating strategic behavior.

Study one-shot strategic classification under unknown costs, improving worst-case accuracy.

problem Learning robust decision rules in strategic settings with unknown user costs.
method Formal study of one-shot strategic classification, framing as a minimax problem, designing efficient algorithms for full-batch and stochastic settings.
result Proves efficient algorithms converge to minimax solution, revealing dual norm regularization's value.

The paper analyzes how leverage affects manipulation in event-linked markets, offering new insights into regulation.

problem Manipulation and insider information in leveraged event-linked markets.
method Develops a two-axis manipulation taxonomy and analyzes leverage's effects on market-price and outcome manipulation.
result Leverage scales market-price manipulation linearly but shifts the cost-benefit threshold for outcome manipulation.

New algorithms optimize decision rules in strategic scenarios, minimizing prediction risk and incentivizing better outcomes.

problem Strategic agents manipulate features to improve outcomes, complicating decision-making models.
method Efficient algorithms for learning decision rules that minimize prediction risk, incentivize better outcomes, and estimate true model coefficients.
result Optimal decision rules can be learned through testing and observing agent responses, circumventing hardness results.

The paper tackles performative policy learning with strategic agents, improving scalability and generalizability.

problem Strategic agents adjust their features in response to a released policy, causing endogenous distribution shifts.
method Relaxing parametric assumptions, the paper uncovers a low-dimensional structure in distribution shifts and proposes a gradient-based policy optimization algorithm.
result The proposed algorithm achieves high sample efficiency and provides theoretical guarantees for convergence.

Study reveals widespread manipulation of meme coins, leading to significant economic losses.

problem Widespread manipulation of meme coins leading to economic losses.
method Cross-chain analysis of 34,988 tokens across Ethereum, BNB Smart Chain, Solana, and Base.
result 82.8% of high-return tokens show evidence of artificial growth strategies.

Study on costs of manipulating AMM-based price oracles.

problem Cost of manipulation in AMM-based on-chain price oracles.
method Analyzes the robustness of AMM-based oracles to strategic manipulation, considering different aggregation methods and market conditions.
result Manipulation costs depend on the total quote depth and can be minimized by optimal liquidity weights.

Randomized classifiers improve strategic classification efficiency.

problem Designing optimal classifiers in strategic classification games.
method Investigation of randomized classifiers and their efficiency in strategic classification.
result Randomized classifiers are necessary for maximizing classification efficiency.

New method improves reliability of recommender systems in face of fake accounts and manipulation.

problem Improving reliability of recommender systems in the presence of fake accounts and manipulation.
method Robust Discrete Matrix Completion (RDMC) method designed to handle sparse rating data and manipulation.
result Evaluations show RDMC offers a statistically-sound blueprint for future studies on recommender systems.

In illiquid markets, option traders may have an incentive to increase their portfolio value by using their impact on the dynamics of the underlying. We provide a mathematical framework within which to value derivatives under market impact in a multi-player framework by introducing strategic interactions into the Almgre…

2008-12-31abs ↗pdf ↗

The paper addresses fairness in dynamic pricing for strategic buyers.

problem Price disparities among specific groups can lead to unfair perceptions and legal violations.
method Proposes a dynamic pricing policy that achieves fairness and discourages strategic behavior.
result Achieves an upper bound of O(T+H(T))O(\sqrt{T}+H(T)) regret over TT time horizons, reducing regret by 35.06% compared to a benchmark policy.

The paper develops classifiers that encourage positive adaptation in machine learning settings.

problem Strategic behavior by decision subjects leads to performance loss in machine learning models.
method Formulates a two-stage game to characterize optimal strategies for model designers and decision subjects.
result Trained classifiers maintain accuracy while inducing higher improvement and less manipulation.

Analyzes gaming in federated learning systems and provides design principles.

problem Gaming and cooperation in federated learning systems under partial observability.
method Developed an analytical framework to separate welfare-improving behavior from metric gaming.
result Derived threshold conditions for deterring harmful gaming and preserving cooperation.

Improved εε-greedy handles strategic bidding in PPC auctions.

problem Strategic bidding in PPC auctions with personalization and corruptions.
method Extended εε-greedy to handle strategic arms in contextual multi-arm bandit.
result εε-greedy is robust to adversarial corruptions and degrades linearly with corruption.

This paper tackles fair online decision-making in contextual bandits, achieving optimal performance and fairness.

problem Fairness in online decision-making systems under strategic manipulation.
method Develops algorithms for linear and smooth reward functions, maintaining fairness and optimal regret.
result Achieves nearly minimax-optimal regret with strong fairness guarantees, even in the presence of attacks.

We consider a dynamic pricing problem for repeated contextual second-price auctions with multiple strategic buyers who aim to maximize their long-term time discounted utility. The seller has limited information on buyers' overall demand curves which depends on a non-parametric market-noise distribution, and buyers may …

2019-11-08abs ↗pdf ↗

BadGD identifies gradient descent vulnerabilities through strategic backdoor attacks.

problem Gradient descent vulnerabilities through malicious data manipulation.
method Introduces Max RiskWarp, Max GradWarp, and Max GradDistWarp triggers to exploit gradient descent.
result Demonstrates how malicious triggers can significantly alter loss landscapes and gradient calculations.

This research tackles backdoor attacks on audio data using a stochastic investment approach.

problem The threat of backdoor attacks on audio data, especially in voice-activated systems.
method A Stochastic investment-based backdoor attack (MarketBack) approach.
result MarketBack can achieve an average attack success rate close to 100% with less than 1% of poisoned data.

Analyzes how learning algorithms affect and are affected by data manipulation.

problem Characterizing the closed-loop behavior of learning algorithms in the presence of decision-dependent data.
method Analyzes repeated risk minimization as perturbed gradient flows of performative risk minimization, considering multiple local minimizers.
result Characterizes the region of attraction for various equilibria and introduces performative alignment.

New algorithm learns optimal policies in strategic MDPs with private types.

problem Optimal policy learning in strategic MDPs with private types and information asymmetry.
method PLAN algorithm using instrumental variable regression and pessimism principle.
result PLAN achieves near-optimal policy with 1/K1 / \sqrt{K} optimality.

Deep neural network (DNN) has demonstrated its success in multiple domains. However, DNN models are inherently vulnerable to adversarial examples, which are generated by adding adversarial perturbations to benign inputs to fool the DNN model to misclassify. In this paper, we present a cross-layer strategic ensemble fra…

2019-10-01abs ↗pdf ↗

New findings show strategic interactions can undermine model expressiveness in machine learning.

problem How strategic interactions affect model performance in machine learning.
method Analyzing model expressiveness and strategic interactions in various machine learning settings.
result Optimizing over less expressive model classes can lead to better equilibrium outcomes in strategic environments.

Consequential decision-making typically incentivizes individuals to behave strategically, tailoring their behavior to the specifics of the decision rule. A long line of work has therefore sought to counteract strategic behavior by designing more conservative decision boundaries in an effort to increase robustness to th…

2018-08-25abs ↗pdf ↗

AI learns market manipulation through simulation, suggesting regulation.

problem Regulating AI to prevent market manipulation.
method Used a genetic algorithm in an artificial market simulation.
result AI discovered market manipulation as an optimal strategy.

The paper analyzes trading strategies in a competitive market with incomplete information.

problem Strategic trading under uncertainty when firms lack full knowledge of competitors' strategies.
method Bayesian games framework to incorporate uncertainty and derive optimal trading strategies.
result Uncertainty significantly impacts trading strategies compared to complete information scenarios.

New model improves neural network robustness against input manipulations.

problem Improving neural network robustness against input manipulations.
method Causal view and deep causal manipulation augmented model (deep CAMA) with data augmentation and test-time fine-tuning.
result Deep CAMA shows superior robustness against unseen manipulations compared to traditional models.

Randomised classifiers outperform deterministic ones in strategic classification.

problem Strategic modification of features by agents in classification tasks.
method Theoretical analysis of randomised classifiers in strategic classification.
result Randomised classifiers can achieve better accuracy than deterministic ones under certain conditions.

This paper studies poisoning attacks in episodic RL and discovers their effectiveness depends on reward bounds.

problem Understanding security threats to RL algorithms through poisoning attacks.
method Examined two types of poisoning attacks: reward and action manipulation, in bounded and unbounded reward settings.
result The effectiveness of poisoning attacks depends on reward bounds, with different attack costs and success rates.

Consequential decision-making incentivizes individuals to strategically adapt their behavior to the specifics of the decision rule. While a long line of work has viewed strategic adaptation as gaming and attempted to mitigate its effects, recent work has instead sought to design classifiers that incentivize individuals…

2019-10-23abs ↗pdf ↗