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

14274154 · May 202619922001200920172026
48 results for token incentives

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.

This study measures decentralization in blockchain finance governance.

problem Defining and measuring decentralization in blockchain finance applications.
method Aggregating and analyzing empirical data of four finance applications to calculate coefficients for governance token distribution.
result Gauges for objective evaluation of token governance capabilities and limitations.

Centralized exchanges influence staking behavior and decentralization in Proof of Stake blockchain ecosystems.

problem How do centralized exchanges affect staking behavior and decentralization in Proof of Stake blockchain ecosystems?
method Formulate a continuous-time mean field model of miners as validators and traders in a centralized market.
result Centralized trading activities enhance staking participation and promote decentralization through market incentives.

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.

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

Neural sequence generation is typically performed token-by-token and left-to-right. Whenever a token is generated only previously produced tokens are taken into consideration. In contrast, for problems such as sequence classification, bidirectional attention, which takes both past and future tokens into consideration, …

2019-08-16abs ↗pdf ↗

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.

This research improves capital efficiency and impermanent loss in cryptocurrency markets using multi-token trading pools.

problem Poor impermanent loss and capital efficiency in automated market makers.
method Analysis and construction of a multi-token token proactive market maker (MPMM).
result MPMM shows better impermanent loss and capital efficiency than comparable market makers.

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.

This study examines whether tokenized assets improve liquidity and finds significant differences across categories.

problem Improving liquidity for real-world assets through tokenization.
method Examined tokenized real-world assets using Ethereum-based data, measuring liquidity through turnover, active addresses, and active-month indicator.
result Gold-backed tokens show more persistent on-chain activity than Treasury and private-credit-related products, but asset value alone does not reliably predict liquidity.

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.

Paper introduces a method to assess liquidity risk in meme tokens using entity-linked address analysis.

problem High market volatility and vulnerability to manipulation in meme tokens.
method Multi-dimensional approach integrating fund flow analysis, behavioral similarity, and anomalous transaction detection.
result Significant disparities between apparent and actual liquidity in meme token markets.

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.

DOS improves language model generation by considering inter-token dependencies.

problem Lack of sequence-level information and inter-token dependencies in existing decoding strategies.
method Dependency-Oriented Sampler (DOS) that uses attention matrices to approximate inter-token dependencies.
result DOS consistently achieves superior performance on code generation and mathematical reasoning tasks.

Proving that next-token prediction makes language models generate coherent long documents.

problem Understanding why language models generate coherent documents despite focusing on next-token prediction.
method Proving the power of next-token prediction in learning longer-range structure using Recurrent Neural Networks (RNN).
result Optimizing next-token prediction in RNNs yields a model that closely approximates the training distribution, even for long-range coherence.