The paper proposes a framework to calibrate multi-agent simulation models from output series using Bayesian optimization.
problem Calibrating multi-agent simulation models from observable output series.
method Novel eligibility set concept, two-sample Kolmogorov-Smirnov test with Bonferroni correction, Bayesian optimization (BO), and trust-region BO (TuRBO).
result Demonstrated the efficiency of the proposed framework using numerical experiments.
Study models opaque financial markets using multi-agent simulation.
problem Challenges in financial markets with obscured data availability.
method Multi-agent simulation with small-scale meta-heuristic methods.
result Captures bilateral market dynamics of OTC trading.
Model predicts multi-agent trajectories using a differentiable simulator.
problem Predicting future positions of multiple interacting agents.
method Conditional recurrent variational neural networks (CVRNNs) with a kinematic bicycle model.
result Achieves state-of-the-art results on INTERACTION dataset.
INTAGS uses interactive simulation to improve realism in multi-agent systems.
problem Challenges in developing realistic agent-based simulators for multi-agent systems.
method INTAGS introduces a novel metric to evaluate the difference between real and synthetic multi-agent systems, optimizing a stochastic policy in reinforcement learning to adapt to interactive sequential decision-making environments.
result INTAGS generates more realistic market data compared to state-of-the-art approaches.
Paper proposes method to calibrate market simulator for various scenarios.
problem Calibrate market simulator to represent different market conditions.
method Two-step method using GAN with self-attention to train discriminator and optimize simulator parameters.
result Demonstrates effectiveness of method in capturing various market scenarios.
Deep learning has enabled traditional reinforcement learning methods to deal with high-dimensional problems. However, one of the disadvantages of deep reinforcement learning methods is the limited exploration capacity of learning agents. In this paper, we introduce an approach that integrates human strategies to increa…
Proposes ABIDES-Gym for financial markets simulation.
problem Training multi-agent systems in financial markets.
method Wrapping DEMAS into OpenAI Gym framework.
result Developed two financial markets OpenAI Gym environments.
Study compares MAPF and MARL algorithms for warehouse automation.
problem Optimizing multi-agent pickup and delivery in warehouse settings.
method Compared conflict-based search (MAPF) and shared experience actor-critic (MARL).
result Comprehensive benchmarking of MAPF and MARL in a simulated warehouse environment.
A new Python-C++ framework for agent-based simulation.
problem Understanding market dynamics and effects of delays.
method User-friendly Python API with efficient C++ implementation, message-driven architecture.
result Investigated the role of order processing delay in financial markets.
The paper shows how shared random seeds can reduce variance in machine learning evaluations.
problem The statistical structure of comparative evaluation under shared random seeds is not well understood.
method An extended learning-based multi-agent economic simulator was used to demonstrate the effects of shared random seeds on variance reduction.
result Pairing seeds can reduce variance in machine learning evaluations, especially when outcomes are positively correlated at the seed level.
Decentralized Gaussian processes for multi-agent systems.
problem Scalable and flexible learning solutions for multi-agent systems.
method Asymptotically exact decentralized solution to Gaussian processes, with online Bayesian model averaging for hyperparameter selection.
result Asymptotically exact decentralized Gaussian process approximation and online Bayesian model averaging.
Improves neural relational inference for dynamic multi-agent trajectories.
problem Limited accuracy of NRI in short output sequences for relational inference in multi-agent trajectories.
method Proposes DYnamic multi-AgentRelational Inference (DYARI) model to handle changing interactions over time.
result DYARI model outperforms NRI in dynamic relational inference tasks.
A variety of cooperative multi-agent control problems require agents to achieve individual goals while contributing to collective success. This multi-goal multi-agent setting poses difficulties for recent algorithms, which primarily target settings with a single global reward, due to two new challenges: efficient explo…
Study multi-agent RL in OTC markets, learning from agents' interactions.
problem Designing efficient RL solutions for OTC market interactions.
method Parameterized reward functions, shared policy learning, RL calibration.
result Agents learn to balance hedging and skewing in market simulations.
Deep Reinforcement Learning (DRL) has been applied to address a variety of cooperative multi-agent problems with either discrete action spaces or continuous action spaces. However, to the best of our knowledge, no previous work has ever succeeded in applying DRL to multi-agent problems with discrete-continuous hybrid (…
CODA resolves coordination issues in offline multi-agent reinforcement learning.
problem Coordination failure in offline multi-agent reinforcement learning.
method Diffusion-based multi-agent trajectory generator for data augmentation.
result CODA resolves coordination pathologies in continuous polynomial games and complex benchmarks.
TradingAgents uses LLM-powered multi-agent framework for financial trading.
problem Lack of collaborative dynamics in multi-agent financial trading systems.
method Inspired by real-world trading firms, TradingAgents features specialized LLM-powered agents and a risk management team.
result Framework outperforms baseline models in trading performance metrics.
FedSight AI predicts federal funds rate using LLMs and multi-agent reasoning.
problem Predicting Federal Open Market Committee's decisions on federal funds rate.
method Multi-agent framework with large language models, structured and unstructured inputs, and CoD extension for efficient reasoning.
result Achieved 93.75% accuracy and 93.33% stability in predicting FOMC outcomes.
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.
KineticSim: A lightweight, high-performance execution engine for real-time market simulators
problem Simulating financial markets at scale with multi-agent models
method Reusable parallel design pattern: persistent, state-carrying clearing for iterative multi-agent reductions
result Reduces per-step critical-path depth from Theta(L+A) to Theta(log L + ceil(A/L))
We present an experimental and simulated model of a multi-agent stock market driven by a double auction order matching mechanism. Studying the effect of cumulative information on the performance of traders, we find a non monotonic relationship of net returns of traders as a function of information levels, both in the e…
We propose a method to model multi-agent behaviors with limited observation and mechanical constraints.
problem Modeling real-world multi-agent behaviors with limited observation and mechanical constraints.
method Decentralized generative models with partial observation and mechanical constraints based on hierarchical variational recurrent neural networks.
result Our method effectively models and predicts biologically plausible behaviors with minimal constraint violations.
KineticSim accelerates financial market simulations 3406x over CPU.
problem Simulating financial markets at scale with multi-agent models is bottlenecked by sequential processing and GPU kernel overhead.
method Formalized and implemented a reusable parallel design pattern for iterative multi-agent reductions in thread-block shared memory.
result Achieved a peak throughput of over 54.7 billion agent-events per second, delivering 3406x speedup over CPU.
A model of fluctuations in the market price including many deterministic dealers, who predict their buying and selling prices from the latest price change, is developed. We show that price changes of the model is approximated by ARCH(1) process. We conclude that predictions of dealers affected by the past price changes…
Researchers develop multi-agent systems for quadcopters to collaborate in missions.
problem Enable multiple quadcopters to work together in remote sensing tasks.
method Agent dynamics, network topologies, collective behaviors, agreement protocol, equations of motion for quadcopters.
result Multi-agent systems can successfully collaborate in remote sensing missions.
Agents collaborate to reduce regret in a multi-agent linear bandit problem with side information.
problem Reducing regret in a multi-agent stochastic linear bandit with side information.
method A decentralized algorithm where agents communicate subspace indices and each plays a projected LinUCB on the corresponding low-dimensional subspace.
result Per-agent finite-time regret is much smaller when agents communicate compared to non-communicating case.
New NPG variants ensure parameter convergence in multi-agent learning.
problem Non-convergence of parameters in NPG for multi-agent learning.
method Proposed variants of NPG for multi-agent learning scenarios.
result Global last-iterate parameter convergence guarantees in various multi-agent learning settings.
Study uses AUVs and RL to map river plumes over multiple days.
problem Long-term mapping of dynamic river plumes with multiple AUVs.
method Multi-agent reinforcement learning with spatiotemporal GPR.
result Multi-agent approach outperforms single-agent and benchmarks.
Framework for multi-agent RL with human feedback in a Snake game.
problem Improving multi-agent reinforcement learning with human feedback.
method Developed a simulated game environment for offline model training and online competitions. Introduced HILL methods and reward manipulation heuristics.
result Agents with HILL methods outperform those without in online competitions.
This work analyzes how multi-agent reinforcement learning can bridge the gap to reality in distributed multi-robot systems.
problem Collaborative learning in distributed multi-robot systems with varying sensors and actuators.
method Simulation-based analysis using PPO and Bullet physics engine, considering different types of perturbations.
result PPO's robustness is affected by the presence of different types of perturbations and the number of agents experiencing them.
Transportation and traffic are currently undergoing a rapid increase in terms of both scale and complexity. At the same time, an increasing share of traffic participants are being transformed into agents driven or supported by artificial intelligence resulting in mixed-intelligence traffic. This work explores the impli…
A new method simulates large, diverse populations of learning agents evolving in games.
problem Limited scalability and efficiency of Multi-Agent Reinforcement Learning.
method Parallelizable implementation of Policy Gradient and Opponent-Learning Awareness for evolutionary simulations.
result Simulated large, diverse populations of learning agents evolve under various strategies.
Efficient algorithms for planning in cooperative multi-agent reinforcement learning with combinatorial action spaces.
problem Planning in cooperative multi-agent reinforcement learning with a combinatorial action space.
method Efficient algorithms using local access to a simulator and linear function approximation, with improvements for additive feature decomposition and kernelized settings.
result Polynomial compute and query complexity in relevant problem parameters.
This work improves generative models by using feedback from multiple dependent models.
problem Improving the performance of generative models in multi-agent systems.
method Building a hierarchical set-up of multiple dependent generative models and using feedback to improve lower-level models.
result The technique improves the performance of lower-level generative models under certain conditions.
Generative Adversarial Networks simulate realistic market interactions.
problem Lack of agent-level historical data limits market simulation realism.
method Conditional Generative Adversarial Networks (CGANs) trained on real data.
result CGAN-based synthetic market generator outperforms previous methods in market responsiveness and realism.
Study models crypto markets using multi-agent reinforcement learning.
problem Emulating crypto market dynamics and behaviors.
method Multi-agent reinforcement learning (MARL) with RL techniques.
result Model accurately emulates crypto market microstructure and behaviors.
RL agents optimize order execution in a realistic market simulation.
problem Optimal order execution challenges in a complex market.
method Multi-agent RL in a historical order book simulation.
result RL agents converge to TWAP strategies in some scenarios.
This study models AI traders' impact on financial markets using a multi-agent framework.
problem Lack of a comprehensive model to assess AI traders' effects on market price formation and volatility.
method Developed a multi-agent market model with microfoundations of the GARCH model.
result Validated the model through simulations and analyzed AI traders' impact.
ARCO-BO optimizes multi-agent design under heterogeneity, improving efficiency and performance.
problem Heterogeneous multi-agent optimization challenges in resource use and information sharing.
method ARCO-BO integrates a consensus mechanism, budget-aware sampling, and partial input sharing for heterogeneous design spaces.
result ARCO-BO outperforms independent and collaborative BO methods in complex multi-agent settings.
Liquidation is the process of selling a large number of shares of one stock sequentially within a given time frame, taking into consideration the costs arising from market impact and a trader's risk aversion. The main challenge in optimizing liquidation is to find an appropriate modeling system that can incorporate the…
Distributed Quantum Gaussian Processes improve modeling in multi-agent systems.
problem Limited expressivity of classical kernels in complex domains.
method Distributed Quantum Gaussian Process (DQGP) with DR-ADMM algorithm.
result Enhanced modeling capabilities and scalability in multi-agent systems.
The recent success of single-agent reinforcement learning (RL) in Internet of things (IoT) systems motivates the study of multi-agent reinforcement learning (MARL), which is more challenging but more useful in large-scale IoT. In this paper, we consider a voting-based MARL problem, in which the agents vote to make grou…
New algorithm minimizes regret in multi-agent bandit problem with probabilistic communication.
problem Minimizing group regret in multi-agent multi-armed bandit problem with probabilistic communication.
method Proposes a new UCB-based algorithm for decentralized multi-agent multi-armed bandit problem on d-regular graphs with probabilistic communication. result The proposed algorithm outperforms state-of-the-art algorithms in minimizing group regret.
A blockchain protocol uses bandit algorithms to dynamically price transactions.
problem Maximizing revenue from decentralized blockchain Indexers competing for queries.
method Dynamic pricing using Gaussian bandits for multiple agents.
result Improved revenue through dynamic pricing in a decentralized blockchain environment.
Market makers play an important role in providing liquidity to markets by continuously quoting prices at which they are willing to buy and sell, and managing inventory risk. In this paper, we build a multi-agent simulation of a dealer market and demonstrate that it can be used to understand the behavior of a reinforcem…
We propose a targeted communication architecture for multi-agent reinforcement learning, where agents learn both what messages to send and whom to address them to while performing cooperative tasks in partially-observable environments. This targeting behavior is learnt solely from downstream task-specific reward withou…
Proposes a graph neural network for efficient multi-agent routing.
problem Routing multiple agents in complex, sparsely connected graphs with dynamic traffic.
method Value Iteration Network based on graph neural networks for online coordination.
result Significantly outperforms traditional methods in terms of cost and runtime.
New strategies improve multi-agent decision-making on irregular networks.
problem Maximizing group reward in multi-agent settings with heterogeneous strategies.
method Design and analysis of heterogeneous explore-exploit strategies for multi-star networks.
result Group performance improves under heterogeneous strategies compared to homogeneous strategies.