On Efficient Multi-Agent Reinforcement Learning for Large Scale Supply Demand Matching

The current technology advances in renewable power generation, fuel cell, and storage devices push forward the growing research interest on supply demand matching in smart grid, which could involve hundreds of thousands of agents making decisions in real time. In this multi-agent reinforcement learning (MARL) problem, the key questions are what to share and how to utilize the shared information. These questions remain open due to the complexity and difference among the subproblems of each agent. We consider this important problem in this work, and make the following major contributions. First, we formulate the problem to maximize the probability of correctly selecting (PCS) the best action for each agent under limited sampling budget. Second, we clarify what to be shared among the agents and quantify the value of such shared information. Third, we present an algorithm to asymptotically maximize the PCS. We hope this work shed light on MARL in general.

Authors

Institutions

Publication Details

Published
2024-08-21
DOI
https://doi.org/10.1109/iai63275.2024.10730200
Citations
1
Primary Topic
Supply Chain and Inventory Management
Type
article
Field-Weighted Citation Impact
0.53

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On Efficient Multi-Agent Reinforcement Learning for Large Scale Supply Demand Matching

Qing‐Shan Jia, Ruicheng Jiang
1 citations
Supply Chain and Inventory Management
0.53
article

On Efficient Multi-Agent Reinforcement Learning for Large Scale Supply Demand Matching

Qing‐Shan Jia, Ruicheng Jiang
article en
1 citations

Abstract

The current technology advances in renewable power generation, fuel cell, and storage devices push forward the growing research interest on supply demand matching in smart grid, which could involve hundreds of thousands of agents making decisions in real time. In this multi-agent reinforcement learning (MARL) problem, the key questions are what to share and how to utilize the shared information. These questions remain open due to the complexity and difference among the subproblems of each agent. We consider this important problem in this work, and make the following major contributions. First, we formulate the problem to maximize the probability of correctly selecting (PCS) the best action for each agent under limited sampling budget. Second, we clarify what to be shared among the agents and quantify the value of such shared information. Third, we present an algorithm to asymptotically maximize the PCS. We hope this work shed light on MARL in general.

Tsinghua University (CN)
National Natural Science Foundation of China, National Key Research and Development Program of China
Openalex Percentile: Top 25%
Supply Chain and Inventory Management
0.53
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.