Papers › A game-theoretic analysis of networked system control for common-pool resource...

A game-theoretic analysis of networked system control for common-pool resource management using multi-agent reinforcement learning

15 Oct 2020NeurIPS 2020 12arXiv:2010.07777archive 2025-07-28

Arnu Pretorius, Scott Cameron, Elan van Biljon, Tom Makkink, Shahil Mawjee, Jeremy du Plessis, Jonathan Shock, Alexandre Laterre, Karim Beguir

Multi-agent reinforcement learning has recently shown great promise as an approach to networked system control. Arguably, one of the most difficult and important tasks for which large scale networked system control is applicable is common-pool resource management. Crucial common-pool resources include arable land, fresh water, wetlands, wildlife, fish stock, forests and the atmosphere, of which proper management is related to some of society's greatest challenges such as food security, inequality and climate change. Here we take inspiration from a recent research program investigating the game-theoretic incentives of humans in social dilemma situations such as the well-known tragedy of the commons. However, instead of focusing on biologically evolved human-like agents, our concern is rather to better understand the learning and operating behaviour of engineered networked systems comprising general-purpose reinforcement learning agents, subject only to nonbiological constraints such as memory, computation and communication bandwidth. Harnessing tools from empirical game-theoretic analysis, we analyse the differences in resulting solution concepts that stem from employing different information structures in the design of networked multi-agent systems. These information structures pertain to the type of information shared between agents as well as the employed communication protocol and network topology. Our analysis contributes new insights into the consequences associated with certain design choices and provides an additional dimension of comparison between systems beyond efficiency, robustness, scalability and mean control performance.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 15 code samples harvested from 1 repository linked to this paper: 13 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified. Where Syntology's instrument failed: 1 where our contract draft was wrong; failures of Syntology's instrument, not of the code.

By repository: official repository: 15 samples from 1 repository, 13 ran (12 with no instrument failure; 1 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written between 2026-09-22 and 2026-09-25 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

instadeepai/EGTA-NMARL officialmentioned in paperpytorchMITSyntology: 15 samples, 13 ran (1 instrument-failed) · 2 unverified report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

15 samples harvested: 13 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

1ran · our draft was wrong
12ran
2unverified

Licence: 1 of the 15 samples is pointer only, meaning Syntology does not serve that copy's text. For that sample, this paper's copy is under a permissive licence and cleared, but the stored copy of the same code that Syntology serves is not; the licence label's tooltip gives Syntology's recorded reason. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from instadeepai/EGTA-NMARL. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

instadeepai/EGTA-NMARL official repository 15 samples, 13 ran (1 instrument-failed) · 2 unverified
Equality egta/experiments/evaluation_metrics.py ran MIT (permissive) · 286a6ee6f1c18b25 · report fixture: signature N:int/0/int, number_of_episodes:int/0/int, set_of_rewards:list/1/ndarray · returned float64 · level recorded 2026-09-25
Utilitarian egta/experiments/evaluation_metrics.py ran MIT (permissive) · 2a7651747e8463f0 · report fixture: signature T:int/0/int, number_of_episodes:int/0/int, set_of_rewards:list/1/ndarray · returned float64 · level recorded 2026-09-25
calculate_condition_3 egta/experiments/plot_schelling_diagram.py ran fingerprinted MIT (permissive) · 4452545364e90dfc · report fixture: signature defectors:list/1/float, cooperators:list/1/float · returned float · level recorded 2026-09-25
calculate_global_xlim_and_ylim egta/experiments/plot_schelling_diagram.py ran MIT (permissive) · dd717e5c4ccf4c7b · report fixture: signature transformed_data:dict/0/?, algo_names:dict/0/? · returned tuple · level recorded 2026-09-25
check_dir in 7 papers egta/utils.py ran MIT (permissive) · a774e08f7631887e · report fixture: signature cur_dir:str/0/str · returned bool · level recorded 2026-09-25
find_file in 6 papers egta/utils.py ran MIT (permissive) · 7c300262e2261af2 · report fixture: signature cur_dir:str/0/str, suffix:str/0/str · returned str · level recorded 2026-09-25
get_total_returns egta/experiments/evaluation_metrics.py ran fingerprinted MIT (permissive) · 0160b7b5a9ca4259 · report fixture: signature set_of_rewards_for_eps:ndarray/2/float · returned ndarray · level recorded 2026-09-25
init_dir egta/utils.py ran MIT (permissive) · 07e87df9a478ba23 · report fixture: signature base_dir:str/0/str, pathes:list/1/str · returned dict · level recorded 2026-09-25
load_actions egta/experiments/utils.py ran MIT (permissive) · e4affefdc674b157 · report fixture: signature folder_path:str/0/str, file_name:str/0/str · returned list · level recorded 2026-09-25
load_cooperator_ids egta/experiments/utils.py ran MIT (permissive) · 23557072b6c01f33 · report fixture: signature folder_path:str/0/str, file_name:str/0/str · returned list · level recorded 2026-09-25
load_rewards egta/experiments/utils.py ran MIT (permissive) · e1b3265de807b4aa · report fixture: signature folder_path:str/0/str, file_name:str/0/str · returned list · level recorded 2026-09-25
ortho_init in 12 papers egta/agents/utils.py ran · our draft was wrong MIT (permissive) here; the stored copy is pointer only · 6583a667fee3e221 · report fixture: signature scale:float/0/float, mode:NoneType/0/? · returned function · level recorded 2026-09-22
transform_data in 9 papers egta/experiments/plot_schelling_diagram.py ran MIT (permissive) · e8cde3414bc94ecb · report fixture: signature rewards:dict/0/?, cooperators_ids:dict/0/? · returned dict · level recorded 2026-09-25
conv in 178 papers egta/agents/utils.py unverified MIT (permissive) · 3d1a6d68723115b4 · report
norm_init egta/agents/utils.py unverified MIT (permissive) · 5af19b29d5176250 · report

Tasks

ManagementMulti-agent Reinforcement LearningReinforcement LearningReinforcement Learning (RL)reinforcement-learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections