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

101202302403 · Jun 202019922001200920172026
48 results for agent dependencies

Efficiently models agent dependencies in large social networks.

problem Challenges in incorporating inter-agent dependencies in social reinforcement learning models.
method Clusters users based on payoff and contribution, combines cluster-level policies with personalized agent-level policies, and uses dynamic clustering.
result Our approach learns more accurate policy estimates and converges more quickly than existing methods.

New algorithm tackles multi-agent reinforcement learning with optimal convergence rate.

problem Multi-agent reinforcement learning with large state spaces and linear function approximations.
method Refined AVLPR framework with data-dependent pessimistic estimation and action-dependent bonuses.
result First algorithm with optimal O(T1/2)O(T^{-1/2}) convergence rate and no poly(AmaxA_{\max}) dependency.

Bayesian network approach for efficient cooperative MARL.

problem Leveraging inter-agent coupling information for scalable MARL algorithms.
method Modeling cooperative MARL via Bayesian networks, identifying value dependency sets, proposing P-DTDE paradigm.
result P-DTDE policy gradient estimator has lower total variance than CTDE.

A deep RL approach learns multi-agent coordination through dynamic graph communication.

problem Learning collaborative policies in multi-agent systems.
method Connectivity Driven Communication (CDC) approach using graph-based attention mechanisms.
result CDC learns effective collaborative policies and outperforms other methods in cooperative navigation tasks.

A dynamic agent model is introduced with an annual random wealth multiplicative process followed by taxes paid according to a linear wealth-dependent tax rate. If poor agents pay higher tax rates than rich agents, eventually all wealth becomes concentrated in the hands of a single agent. By contrast, if poor agents are…

2017-11-15abs ↗pdf ↗

Study on pairwise counter-monotonicity, a type of negative dependence.

problem Understanding and quantifying extremal negative dependence structures.
method Established stochastic representation and invariance property; showed implications and connections.
result Pairwise counter-monotonicity implies negative association and joint mix dependence.

Improved gap-dependent bounds for reinforcement learning with linear approximations.

problem Achieving nearly minimax-optimal performance with linear function approximation.
method Developed and analyzed the LSVI-UCB++ algorithm and its concurrent variant.
result First gap-dependent regret bound for nearly minimax-optimal algorithm LSVI-UCB++.

Study designs incentives for adapting multi-agent systems without knowing their learning dynamics.

problem Designing incentives for an adapting population in multi-agent systems without prior knowledge of their learning dynamics.
method Introduces a model-based non-episodic Reinforcement Learning (RL) formulation for steering Markovian agents towards desired policies, focusing on history-dependent strategies to handle model uncertainty.
result Identifies conditions for the existence of steering strategies to guide agents to desired policies and provides empirical algorithms to approximately solve the objective.

Optimal annuitization strategy depends on age, labor income, and mortality risk.

problem Maximizing utility from consumption and labor income under age-dependent mortality.
method Dynamic programming approach to derive closed-form solutions.
result Post-retirement labor income acts as a substitute for annuitization.

New scalable MARL framework for dynamic networked systems.

problem Scalability in multi-agent reinforcement learning with dynamic dependencies.
method Scalable Actor Critic framework for non-local and stochastic dependencies.
result Finite-time error bound showing convergence rate dependence on information spread speed.

Model trains agents to optimize saving and investment strategies for diverse retirement needs.

problem Optimal saving and investment strategies for individuals in varied employment and income profiles.
method Deep reinforcement learning to train intelligent agents with heterogeneous profiles.
result Flexible methodology estimates lifetime consumption and investment choices for different profiles.

Study shows market volatility affects optimal communication design for trading strategies.

problem Investigating how communication impacts trading strategy performance in multi-agent systems.
method 5-agent LLM-based trading systems across 450 experiments spanning 21 months, comparing 5 organizational structures.
result Communication improves performance but depends on market characteristics, with competitive conversation excelling in volatile tech stocks.

We review some statistical many-agent models of economic and social systems inspired by microscopic molecular models and discuss their stochastic interpretation. We apply these models to wealth exchange in economics and study how the relaxation process depends on the parameters of the system, in particular on the savin…

2006-08-17abs ↗pdf ↗

We study a networked version of the minority game in which agents can choose to follow the choices made by a neighbouring agent in a social network. We show that for a wide variety of networks a leadership structure always emerges, with most agents following the choice made by a few agents. We find a suitable parameter…

2011-06-02abs ↗pdf ↗

Core-Halo solves large-scale fixed-point problems by decentralizing updates.

problem Large-scale fixed-point equations with block dependencies.
method Core-Halo decomposition separates write ownership from read-only context, aligning with block-dependence structure.
result Core-Halo achieves near-centralized performance while retaining parallelism.

Decentralized learning for matching markets with time-varying preferences.

problem Matching between competing agents and supply arms with time-varying preferences.
method Linear contextual bandit framework, learning algorithms to identify latent environment and stable matchings.
result Achieve instance-dependent logarithmic regret, applicable for large markets.

This paper tackles no-regret learning for fair multi-agent social welfare optimization.

problem Maximizing social welfare in a fair manner for multiple agents.
method Developed algorithms for stochastic and adversarial multi-agent settings, proving regret bounds and tightness.
result Achieved no-regret learning for fair multi-agent social welfare optimization in various settings.

Study time-inconsistent portfolio optimization for competitive agents with relative performance criteria.

problem Time-inconsistent mean field and n-agent games under relative performance criteria.
method Construct open-loop equilibrium strategies for n-agent games and mean field games.
result Explicit solutions for n-agent games and mean field games, unique in a special class of equilibria.

We investigate a classification problem using multiple mobile agents capable of collecting (partial) pose-dependent observations of an unknown environment. The objective is to classify an image over a finite time horizon. We propose a network architecture on how agents should form a local belief, take local actions, an…

2019-05-13abs ↗pdf ↗

We propose a method for modeling and learning turn-taking behaviors for accessing a shared resource. We model the individual behavior for each agent in an interaction and then use a multi-agent fusion model to generate a summary over the expected actions of the group to render the model independent of the number of age…

2018-12-10abs ↗pdf ↗

New algorithm tackles unknown utility network resource allocation.

problem Maximizing network utility with unknown agent utilities.
method Modeling as a bandit problem, proposing algorithms for resource allocation.
result Proposed algorithms are optimal when all agents have the same utility.

PPO algorithm converges to global optimality in multi-agent reinforcement learning.

problem Designing statistical guarantees for policy optimization methods in multi-agent reinforcement learning.
method Leveraging a multi-agent performance difference lemma, a localized action value function is used as a descent direction for each local policy, leading to a multi-agent PPO algorithm.
result The multi-agent PPO algorithm converges to the globally optimal policy at a sublinear rate under standard regularity conditions.

PredictionMarketBench benchmarks trading agents on prediction markets.

problem Evaluating trading agents on prediction markets with realistic conditions.
method Deterministic replay of historical data, execution-realistic simulator, agent interface.
result Fee-aware algorithmic strategies outperform naive agents in volatile episodes.

A risk-aware RL approach using RDEU and Wasserstein ball for robust performance.

problem Optimizing risk-aware performance criteria in uncertain environments.
method Rank dependent expected utility (RDEU) for risk assessment, Wasserstein ball for robustness, actor/agent framework.
result Explicit policy gradient formulae for robust optimization.

We introduce an auto-regressive model which captures the growing nature of realistic markets. In our model agents do not trade with other agents, they interact indirectly only through a market. Change of their wealth depends, linearly on how much they invest, and stochastically on how much they gain from the noisy mark…

2008-03-27abs ↗pdf ↗

Study optimal trading strategies with differing views and market prices.

problem Maximizing portfolio value with subjective asset value vs market price.
method Mean-field game approach to analyze interactions among agents with differing signals.
result Cross-sectional distribution of agents' inventories and price distribution dependence on shared information.

Reduces necessary conditions for collision avoidance on curved spaces.

problem Finding non-intersecting trajectories for multiple agents on curved spaces.
method Reduction by Lie group symmetries of variational collision avoidance problems.
result Derives necessary conditions for reduced extremals.

We study a large economy in which firms cannot compute exact solutions to the non-linear equations that characterize the equilibrium price at which they can sell future output. Instead, firms use polynomial expansions to approximate prices. The precision with which they can compute prices is endogenous and depends on t…

2016-11-06abs ↗pdf ↗

This paper presents a model of capital accumulation for a large number of heterogenous producer-consumers in an exchange space in which interactions depend on agents' positions. Each agent is described by his production, consumption, stock of capital, as well as the position he occupies in this abstract space. Each age…

2019-09-09abs ↗pdf ↗

We study analytically and numerically Minority Games in which agents may invest in different assets (or markets), considering both the canonical and the grand-canonical versions. We find that the likelihood of agents trading in a given asset depends on the relative amount of information available in that market. More s…

2006-03-19abs ↗pdf ↗

New algorithm reduces complexity in multi-agent reinforcement learning.

problem High computational complexity in exact computations for multi-agent reinforcement learning.
method Design of a scalable algorithm based on Natural Policy Gradient, using local information and limited communication.
result Converges to globally optimal policy with dimension-free complexity and localization error.

A UCB algorithm reduces regret in cooperative multi-agent graph bandits.

problem Cooperative multi-agent decision-making on a graph with shared rewards.
method Upper Confidence Bound (UCB) algorithm for minimizing regret.
result The Multi-G-UCB algorithm achieves expected regret O(γNlog(T)[KT+DK])O(γN\log(T)[\sqrt{KT} + DK]).

Investigates portfolio selection among competitive agents with mean-variance preferences.

problem Optimizing portfolios with multi-agent competition and relative wealth comparison.
method Reformulated as a constrained, non-homogeneous stochastic linear-quadratic control problem; derived optimal feedback strategies; used decoupling techniques and fixed-point theory to solve nonlinear BSDEs.
result Characterized three scenarios based on market and competition parameters: unique Nash equilibrium, no Nash equilibrium, or infinitely many Nash equilibria.