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,657 papers · 148 categories

Trend · papers per month

9192837 · Nov 201919922001200920172026
48 results for Short-term incentives

Short-term incentives lead to riskier trading strategies.

problem Optimal execution with performance barriers.
method Analyzes the impact of short-term performance incentives on trading behavior.
result Short-term incentives result in more aggressive but less risky trading strategies in the short term, but poorer performance over long periods.

We refine toxicity bounds for dynamic liquidation incentives in CP-AMM systems.

problem Ensuring stability in dynamic liquidation incentives in automated market makers.
method Derived state-dependent toxicity bounds for dynamic liquidation incentives, reconciling them with CP-AMM price dynamics.
result State-dependent bounds and liquidity-depth-only condition for dynamic liquidation incentives.

Study optimal incentives for cleaner energy production.

problem Accelerate transition to cleaner technologies in energy market.
method Stochastic control models for three scenarios: single firm, two firms, and two firms without incentives.
result Optimal strategies for investment and production emerge, highlighting firm interactions and incentive effects.

Reliable uncertainty estimation for time series prediction is critical in many fields, including physics, biology, and manufacturing. At Uber, probabilistic time series forecasting is used for robust prediction of number of trips during special events, driver incentive allocation, as well as real-time anomaly detection…

2017-09-06abs ↗pdf ↗

Two-stage mechanism designs reduce regret in recommender systems with stochastic covariates.

problem Designing effective recommender systems with user covariates sampled online.
method Two-stage algorithm integrating incentivized exploration with offline learning methods.
result Achieves sublinear regret while maintaining incentive compatibility.

Study assesses how much security restaking protocols need to pay for.

problem Determining the optimal security level for restaking protocols using token incentives.
method Expanding a model by Durvasula and Roughgarden to include strategic attackers and node operators, constructing an approximation algorithm for token-based incentives.
result Restaking protocols can be secure with proper incentive management, even against strategic adversaries.

Study on liquidity and market efficiency in auction games with imperfect information.

problem Generating liquidity in illiquid auction markets with imperfect information.
method Characterized Nash equilibria in a two-player game with imperfect information, linking market spreads to signal strength.
result Without incentives, the market is inefficient and does not lead to trades. Quadratic fees indexed on half spread can generate liquidity.

A novel incentive mechanism improves fairness and participation in federated learning.

problem Low-quality clients and lack of fairness in federated learning.
method Client selection process and money transfer mechanism to ensure fairness and participation.
result The proposed incentive mechanism improves the duration and fairness of federated learning.

The paper develops an economic foundation for multi-agent learning in markets.

problem Learning dynamics in markets with strategic externalities.
method A two-phase incentive mechanism that estimates and uses implementable transfers to steer long-run dynamics.
result The mechanism achieves sublinear social-welfare regret and asymptotically optimal welfare under mild rationality and exploration conditions.

We study online learning settings in which experts act strategically to maximize their influence on the learning algorithm's predictions by potentially misreporting their beliefs about a sequence of binary events. Our goal is twofold. First, we want the learning algorithm to be no-regret with respect to the best fixed …

2020-02-20abs ↗pdf ↗

Method uses ANN to estimate incentive salience from large behavioral data.

problem Estimating incentive salience in naturalistic settings.
method Artificial Neural Networks (ANNs) for latent state approximation.
result ANNs produce better representations for predicting future behaviour.

This paper addresses reward estimation and incentive design for agents with hidden rewards.

problem Estimating and incentivizing agents with unknown rewards in a learning setting.
method Repeated adverse selection game with a self-interested learning agent and a learning principal. Introduces an estimator for consistent reward estimation and a data-driven incentive policy.
result Finite-sample consistency of the estimator and a rigorous regret bound for the principal.

How can we design safe reinforcement learning agents that avoid unnecessary disruptions to their environment? We show that current approaches to penalizing side effects can introduce bad incentives, e.g. to prevent any irreversible changes in the environment, including the actions of other agents. To isolate the source…

2018-06-04abs ↗pdf ↗

Study optimizes health incentives to balance efficiency and fairness.

problem Designing health incentives to balance efficiency and fairness.
method Inverse behavioral optimization framework integrating QALY-based incentives and adaptive learning.
result Modern health systems operate near an efficiency-saturated frontier, with small fairness adjustments yielding diminishing returns.

Paper proposes incentive mechanism to encourage participation in federated learning.

problem Users are reluctant to participate in federated learning due to privacy concerns.
method Formulated as a two-stage Stackelberg game, designed an incentive mechanism to select and compensate users.
result Demonstrated effectiveness of the proposed incentive mechanism through simulations.

Study shows ethanol blends and incentives can significantly reduce transportation carbon emissions.

problem Rapid growth in electric vehicles requires complementary strategies to decarbonize transportation.
method Analysis of ethanol blending, regulatory incentives, and economic assessments.
result Ethanol blending, especially E15 and E85, can substantially reduce carbon emissions and provide economic benefits.

When the planning horizon is long, and the safe asset grows indefinitely, isoelastic portfolios are nearly optimal for investors who are close to isoelastic for high wealth, and not too risk averse for low wealth. We prove this result in a general arbitrage-free, frictionless, semimartingale model. As a consequence, op…

2013-06-12abs ↗pdf ↗

Study shows visual feedback and monetary incentives reduce plugload energy consumption in commercial buildings.

problem Mitigating energy consumption in commercial buildings through occupant plugload control.
method Field experiments with visual feedback and monetary incentives in government and university buildings.
result Mean energy reduction of ~9.52% in office environments and ~21.61% in university environments with visual feedback.

dYdX updates liquidity provider incentives to enhance trading efficiency.

problem Incentivizing liquidity providers to maintain efficient market structures.
method Analyzed various metrics (makerVolume, depths, spreads) and used historical trades to update the LP Incentives Programme.
result Updated the LP Incentives Programme to encourage more active and efficient liquidity.

The study compares M6 competitors' performance to industry benchmarks and discusses incentives for investment managers.

problem Investors seek to understand the performance and skill of M6 competitors beyond the competition's metrics.
method Comparative analysis using financial metrics, factor models, and new strategies.
result Most competitors do not generate significant out-performance compared to industry benchmarks, but some show skill in recent performance.

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.

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.

Study incentive efficiency in monopoly insurance markets with hidden information.

problem Maximizing social welfare in a monopoly insurance market with hidden agent types.
method Maximizes social welfare function subject to incentive compatibility and individual rationality constraints.
result Optimal menus of contracts depend on the level of social welfare weight and agent risk attitudes.

Forward hedging reshapes incentive provision in firms.

problem How does forward hedging affect incentive provision in firms?
method We consider a CARA framework to jointly characterize optimal production, compensation, and static hedging in equilibrium.
result Delegation and external hedging are partial substitutes, and delegation can increase firm value even when the agent is more risk averse.

Firms delay write-downs for adverse macroeconomic and industry outcomes but not for firm-specific issues.

problem Timeliness of write-downs for adverse macroeconomic and industry outcomes versus firm-specific issues.
method Comparative analysis of write-downs driven by macroeconomic and industry outcomes versus firm-specific outcomes.
result Firms delay write-downs for adverse macroeconomic and industry outcomes but not for firm-specific issues.

This research simplifies lending pools in decentralized finance for better understanding and security.

problem Complexity and lack of executable models make lending pools hard to understand and predict.
method Developed a formal model to reflect common features of lending pools and proved general properties.
result Proved correct handling of funds and described vulnerabilities and attacks.

Paper proposes incentives for federated learning to ensure truthful contributions.

problem Ensuring truthful contributions from decentralized users in federated learning.
method Introduces a scoring rule based framework to incentivize truthful reporting of local hypotheses at a Bayesian Nash Equilibrium.
result Proposed solution verified using MNIST and CIFAR-10 datasets, showing decreasing scores for low-quality hypotheses.

Agents learn to give rewards to others in a shared learning environment.

problem How to encourage cooperation among RL agents in a shared environment.
method Each agent learns a reward function to influence others, optimizing for its own and others' extrinsic objectives.
result Agents significantly outperform standard RL in Markov games, often finding near-optimal division of labor.

Game theory models incentivizes honesty in collaborative learning among competitors.

problem Incentivizing honest updates among competitors in collaborative learning schemes.
method Formulated a game to model interactions, studied two learning tasks, proposed mechanisms to incentivize honest communication.
result Rational clients are incentivized to manipulate their updates, preventing learning; proposed mechanisms ensure comparable learning quality to full cooperation.

We consider models of financial markets in which all parties involved find incentives to participate. Strategies are evaluated directly by their virtual wealths. By tuning the price sensitivity and market impact, a phase diagram with several attractor behaviors resembling those of real markets emerge, reflecting the ro…

2007-08-01abs ↗pdf ↗

Neural networks improve VaR estimation accuracy and robustness.

problem Estimating Value at Risk (VaR) in financial markets.
method Generative regime switching framework with Monte-Carlo simulations, neural networks initialized via best model, balanced incentive function, reduced training data.
result Neural networks outperform traditional methods in VaR estimation, especially with less data.

When an insurance note is also a derivative a serious problem arises because a derivative must be fulfilled immediately. This feature of derivatives prevents claims processing procedures that screen out ineligible claims. This, in turn, creates a perverse incentive for insured holders of notes to commit acts that resul…

2017-10-18abs ↗pdf ↗

Proposes a Carbon Equivalence Principle for financial products to align incentives and drive sustainability.

problem Align financial market incentives with carbon emissions to limit global warming.
method Introduces a Carbon Equivalence Principle requiring financial products to describe equivalent carbon flows alongside cash flows.
result Transparency of carbon flows in financial products can align incentives and reduce future costs, necessitating project re-structuring and financial net-zero designs.

Study designs steering rewards for MFGs with unknown dynamics and model uncertainty.

problem Designing incentives for large populations of agents in MFGs with uncertain model details.
method Developed optimistic exploration algorithms for agents with no-adaptive regret behaviors.
result Sub-linear regret guarantees for cumulative gaps between agent behaviors and desired outcomes.

Optimizes fund manager's wealth with partial information on market risk.

problem Maximizing wealth with incomplete information about market risk.
method Formulated as optimization under partial information, solved via martingale method and concavification.
result Shows how learning about market risk affects optimal investment strategy.

The paper proposes a model reward scheme for collaborative ML based on Shapley value and information gain.

problem Designing fair incentives for collaborative machine learning.
method The paper proposes a reward scheme based on Shapley value and information gain, with properties like fairness and stability.
result The proposed reward scheme satisfies fairness and trade-offs between desirable properties via an adjustable parameter.

New framework solves dynamic bilevel optimization problems in reinforcement learning.

problem Dynamic objective functions in reinforcement learning and human feedback.
method Principled penalty-based methods for bilevel reinforcement learning.
result Demonstrated effectiveness of penalty-based algorithms in simulations.

Study optimal reinsurance contracts to prevent moral hazard under non-concave premium principles.

problem Preventing moral hazard in reinsurance contracts under non-concave premium principles.
method Develops optimal reinsurance contracts under a diffusion risk model with incentive compatibility constraints and extended distortion premium principles.
result An optimal reinsurance contract exists and is characterized by solving a double obstacle problem.