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.

169,051 papers · 148 categories

Trend · papers per month

15294458 · May 202619922001200920172026
48 results for incentive allocation

New method optimizes incentive allocation with budget constraints.

problem Optimizing financial incentives in marketing campaigns with limited feedback.
method Two-step approach: domain adaptation for reward estimation followed by policy optimization.
result Significant improvement in synthetic and real datasets.

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.

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.

New pricing framework allocates costs of operating reserves and transmission.

problem Allocating costs of operating reserves and transmission efficiently.
method Causation-based framework using contingency-constrained scheduling models.
result More comprehensive and efficient cost-reflective market operations.

This paper tackles resource allocation in the Lightning Network using DRL.

problem Complex combinatorial problem of node selection and resource allocation in the Lightning Network.
method Attention-based Deep Reinforcement Learning framework.
result Improved resource allocation leads to better performance and decentralization in the LN.

Uber optimizes marketplace levers using machine learning to improve resource allocation efficiency.

problem Optimizing budget allocation for drivers and riders to maximize business value.
method End-to-end machine learning and optimization procedure using feature store, model training, and ADMM.
result Substantially improved Uber's resource allocation efficiency through high-dimensional optimization.

DaringFed incentivizes clients in OFL with dynamic rewards under TII.

problem Designing incentives for OFL clients under dynamic, incomplete information.
method Formulated as a dynamic signaling and pricing allocation problem in a Bayesian persuasion game.
result Optimal design of DaringFed improves accuracy and convergence speed by 16.99%.

Comonotonic allocations are restored under certain constraints, improving risk-sharing.

problem Feasibility constraints can distort optimal risk-sharing allocations.
method Identified componentwise convex-order solidity as a sufficient condition to restore comonotonic allocations.
result Componentwise convex-order solidity ensures comonotonic improvements under feasible constraints.

Heterogeneous SVO leads to diverse policies in sequential social dilemmas.

problem Understanding how diverse social value orientations affect behavior in sequential social dilemmas.
method Extending prior reinforcement learning studies, we instantiated heterogeneous SVO in a sequential social dilemma setting and measured task-specific diversity metrics.
result Heterogeneous SVO leads to meaningfully diverse policies across various incentive structures.

PoEL protocol aims to efficiently create and secure liquidity for blockchain networks.

problem Lack of sustainable liquidity and network security in Proof of Stake blockchains.
method PoEL uses staking rewards to attract risk capital, structuring incentives for capital efficiency and security.
result PoEL protocol enhances blockchain network security and liquidity sustainability.

OpenAlpha validates decentralized capital strategies using game theory and market aggregation.

problem Decentralized capital management's lack of trust-minimised, adaptive deployment.
method Game-theoretic validation, adversarial auditing, market-based belief aggregation.
result Confidence scores from validation phases inform capital allocation rules.

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

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 ↗

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.

No-regret learning with strategic experts, incentivized.

problem Online learning with strategic experts who misreport beliefs.
method Building on wagering mechanisms, we provide algorithms for no-regret and incentive compatibility in both full and partial information settings.
result Our algorithms achieve no regret and incentive compatibility for myopic experts, with comparable regret to classic no-regret algorithms and diminishing regret for forward-looking agents.

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.

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.

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

The paper proposes a rubric and incentives to prevent peer review from becoming a 'tragedy of the commons'.

problem The growth of machine learning threatens the sustainability of peer review.
method Proposes a rubric for objective review quality and financial compensation for reviewers.
result Avoiding a 'tragedy of the commons' outcome in peer review.