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

3773110146 · May 202619922001200920172026
48 results for strategic gap

Study identifies a Strategic Gap in market efficiency due to AI-driven timing and complexity in disclosure.

problem Market inefficiency due to structural influence of disclosure timing and complexity.
method Introduces Autonomous Disclosure Regulator, a multi-node AI framework to audit disclosure complexity and unpredictability.
result Companies use confusing language and unpredictable timing to slow down market learning, creating a 60% Structural Gap.

New approach reduces simulator exploitation by learning robust models.

problem Simulator exploitation leading to reality gap in reinforcement learning.
method Formulated as a zero-sum minimax game between model player and policy player, providing theoretical guarantees and a convergent active data selection algorithm.
result Reduces prediction error in strategically important regions by 1.5-2.2 times and enables near-optimal real-world performance.

New approach reduces simulator exploitation by improving strategic robustness.

problem Simulator exploitation leading to reality gap between simulation and real-world performance.
method Formulated as a zero-sum minimax game, providing theoretical guarantees and a convergent active data selection algorithm.
result Proves convergence and reduces prediction error in strategically important regions by 1.5-2.2 times.

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.

Study examines pricing strategies in competitive supply chains with discrete prices.

problem Inaccurate assumptions in traditional SC models for pricing decisions.
method Examines a SC model with one supplier and two manufacturers, considering customer demand segmentation and discrete price setting.
result Nash equilibria among manufacturers are not unique, and low denomination factors can lead to instability.

Proposes a method to infer the distributional impacts of predictive models on stakeholders.

problem The influence of predictive models on target variable distribution, leading to performative prediction.
method Modeling agents' responses as a cost-adjusted utility maximization problem and using optimal transport to align pre- and post-model distributions.
result Provides estimates for the cost associated with these responses and demonstrates the quality of these estimates.

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.

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.

MpFL models clients as strategic players to reach equilibrium with less communication.

problem Real-world clients act independently with individual objectives, not aligned with a shared global model.
method MpFL uses game-theoretic modeling and PEARL-SGD algorithm for local updates and communication.
result PEARL-SGD reaches an equilibrium with less communication than non-local updates in stochastic setup.

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 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.

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 ↗

Based on interviews with 28 organizations, we found that industry practitioners are not equipped with tactical and strategic tools to protect, detect and respond to attacks on their Machine Learning (ML) systems. We leverage the insights from the interviews and we enumerate the gaps in perspective in securing machine l…

2020-02-04abs ↗pdf ↗

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.

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.

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.

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.

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 ↗

We consider a symmetric multi-players zero-sum game with two strategic variables. There are nn players, n3n\geq 3. Each player is denoted by ii. Two strategic variables are tit_i and sis_i, i{1,,n}i\in \{1, \dots, n\}. They are related by invertible functions. Using the minimax theorem by \cite{sion} we will show that Nas…

2018-06-17abs ↗pdf ↗

We study a strategic version of the multi-armed bandit problem, where each arm is an individual strategic agent and we, the principal, pull one arm each round. When pulled, the arm receives some private reward vav_a and can choose an amount xax_a to pass on to the principal (keeping vaxav_a-x_a for itself). All non-pulle…

2017-06-27abs ↗pdf ↗

COBRA addresses strategic behavior in online platforms by ensuring truthful reporting without monetary incentives.

problem Ensuring truthful reporting from strategic agents in online platforms.
method Proposes COBRA, an algorithm for contextual bandits involving strategic agents that disincentivizes strategic behavior.
result COBRA achieves sub-linear regret guarantee and incentive compatibility without monetary incentives.

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.

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 ↗

Model predicts option movements using residual transactions for better market timing.

problem Predicting option movements using standard metrics like open interest and trading volume.
method Analyzes residual transactions, integrates machine learning and regression techniques.
result Identifies early indicators of market trends for better option price forecasting.

This paper deals with the explicit design of strategy formulations to make the best strategic choices from a conventional matrix form of representing strategic choices. The explicit strategy formulation is an analytical model which is targeted to provide a mathematical strategy framework to find the best moment for str…

2019-08-15abs ↗pdf ↗

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.

Strategic brokers exploit private information in broker-mediated markets, affecting informed traders' performance.

problem Strategic interactions and information leakage in broker-mediated markets.
method Study of strategic trading behavior and information leakage in a broker-mediated market.
result Brokers hold a strategic advantage over informed traders due to information leakage in trading flows.

This paper tackles online strategic decision making with asymmetry and knowledge transportability.

problem Strategic decision making with information asymmetry and knowledge transportability challenges.
method Developed a sample-efficient algorithm for online learning under these conditions.
result Proved sample complexity of O(1/ε2)O(1/ε^2) for learning an εε-optimal policy.

User strategization undermines algorithmic trustworthiness.

problem User strategic behavior corrupts algorithmic data and trust.
method Modeling user-platform interactions as a game, analyzing strategic behavior's short-term benefits and long-term harms.
result User strategization can initially benefit platforms but ultimately harms their ability to make accurate decisions.

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.

Algorithms are often used to produce decision-making rules that classify or evaluate individuals. When these individuals have incentives to be classified a certain way, they may behave strategically to influence their outcomes. We develop a model for how strategic agents can invest effort in order to change the outcome…

2018-07-13abs ↗pdf ↗

To integrate strategic, tactical and operational decisions, the two-stage optimization has been widely used to guide dynamic decision making. In this paper, we study the two-stage stochastic programming for complex systems with unknown response estimated by simulation. We introduce the global-local metamodel assisted t…

2019-10-13abs ↗pdf ↗

A cased-based reasoning method predicts rare events on strategic sites using satellite imagery.

problem Manual prediction of rare events on strategic sites is impractical due to large datasets.
method Case-based reasoning approach incorporating expert knowledge for irregular time series and small datasets.
result The method significantly outperforms random selection on challenging applications.

New findings link causal models to strategic classification, improving robustness and alignment.

problem Strategic adaptation by users in classification tasks.
method Causal models to bound worst-case out-of-distribution risk.
result Causal classification optimizes classification error after adaptation under certain noise conditions.

New algorithm prevents strategic replication in multi-armed bandit problems.

problem Strategic replication by agents can exploit bandit algorithms' balance.
method Designs Hierarchical UCB (H-UCB) and Robust Hierarchical UCB (RH-UCB) algorithms.
result Achieves O(lnT)O(\ln T)-regret and sublinear regret in realistic scenarios.

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.

Abstract MDPs enable strategic exploration and fast reward transfer in complex environments.

problem Challenging to learn accurate MDPs for high-dimensional states.
method Learn an abstract MDP over low-dimensional coarse states, using an abstraction function.
result Achieves superhuman performance on Pitfall! and higher reward with fewer samples.

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.