dec-pomdp-diagnostics 0.1.0__tar.gz

dec_pomdp_diagnostics-0.1.0/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

dec_pomdp_diagnostics-0.1.0/PKG-INFO

@@ -0,0 +1,278 @@
+Metadata-Version: 2.4
+Name: dec-pomdp-diagnostics
+Version: 0.1.0
+Summary: Information-theoretic diagnostics for cooperative MARL Dec-POMDPs (Tessera et al., AAMAS 2026).
+Author-email: Kale-ab Abebe Tessera <kaleabtessera@gmail.com>
+License-Expression: Apache-2.0
+Project-URL: Paper, https://arxiv.org/abs/2602.20804
+Project-URL: Repository, https://github.com/KaleabTessera/probing-dec-pomdps
+Project-URL: Website, https://www.kaleabtessera.com/probing
+Keywords: multi-agent reinforcement learning,Dec-POMDP,cooperative MARL,mutual information,diagnostics
+Classifier: Development Status :: 4 - Beta
+Classifier: Intended Audience :: Science/Research
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3.10
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: Python :: 3.12
+Classifier: Topic :: Scientific/Engineering :: Artificial Intelligence
+Requires-Python: >=3.10
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Requires-Dist: numpy>=1.24
+Requires-Dist: scipy>=1.10
+Requires-Dist: scikit-learn>=1.2
+Requires-Dist: pandas>=2.0
+Requires-Dist: joblib>=1.3
+Requires-Dist: rliable>=1.0
+Provides-Extra: collect
+Requires-Dist: wandb>=0.16; extra == "collect"
+Provides-Extra: dev
+Requires-Dist: pytest>=7; extra == "dev"
+Requires-Dist: ruff>=0.4; extra == "dev"
+Dynamic: license-file
+
+# Probing Dec-POMDP Reasoning in Cooperative MARL
+
+<p align="center">
+  <a href="https://arxiv.org/abs/2602.20804"><img alt="Paper" src="https://img.shields.io/badge/Paper-arXiv%3A2602.20804-b31b1b" /></a>
+  <a href="https://www.kaleabtessera.com/probing"><img alt="Website" src="https://img.shields.io/badge/Project-Website-0f766e" /></a>
+  <a href="LICENSE"><img alt="License" src="https://img.shields.io/badge/License-Apache--2.0-2563eb" /></a>
+</p>
+<p align="center">
+  <img src="hero.svg" alt="Pipeline: train policies, collect rollouts, compute probes, audit behaviours" width="100%" />
+</p>
+
+
+
+Metrics introduced in [Probing Dec-POMDP Reasoning in Cooperative MARL](https://arxiv.org/abs/2602.20804) (Oral, AAMAS 2026).
+
+This repository provides information-theoretic diagnostics for cooperative MARL trajectories. Given trained-policy rollouts, the package computes five probes, compares them against permutation nulls, and helps audit what behaviours are induced under the policy distribution rather than relying only on return.
+
+Use it when you want to ask:
+
+- Do actions depend on memory beyond the current observation?
+- Does one agent carry private information that predicts another agent's action?
+- Is coordination mostly synchronous action coupling, or is there temporal influence across agents?
+
+Quick links: [Installation](#installation) | [Quickstart](#quickstart) | [CLI](#cli-reference) | [Citation](#citation)
+
+## The five diagnostics
+
+For agent $i$ at time $t$, let $O_t^i$ denote the local observation, $A_t^i$ the action, $H_t^i$ the history representation, and $\tau_{t-1}^i$ the action-observation history up to $t-1$. For recurrent policies, $H_t^i$ is the RNN hidden state. For feed-forward policies, history is approximated using a length-$k$ window, such as $O_{t-k:t-1}^i$ or $(O_{t-k:t-1}^i, A_{t-k:t-1}^i)$, depending on the diagnostic.
+
+All diagnostics measure predictive statistical dependence under the rollout distribution, not causal influence and not worst-case/best-case properties of the environment. They should be interpreted together with the memory-reactive performance gap, permutation-null baselines, bootstrap uncertainty, and behavioural evaluations.
+
+| Diagnostic | Definition | If high, suggests… | Implementation |
+|---|---|---|---|
+| **OAR** | $I(O_t^i; A_t^i)$ | The current observation is highly predictive of the agent’s action. This is consistent with more **reactive behaviour**, especially when **HAR** is low. | `compute_oar` |
+| **HAR** | $I(H_t^i; A_t^i \mid O_t^i)$ | The agent’s action depends on history beyond the current observation. This indicates **history-dependent behaviour**, but not necessarily performance-critical memory use ($\Delta_{\mathrm{Mem}}$ can help with that). | `compute_har_hidden` (RNN), `compute_har_ohist` (FF) |
+| **PIF** | $I(\tau_{t-1}^i, O_t^i; A_t^j \mid \tau_{t-1}^j, O_t^j)$ | Agent $i$'s trajectory and current observation contain additional predictive information about agent $j$'s action beyond $j$'s own history and observation. This is consistent with **cross-agent information asymmetry**, where one agent’s information helps predict another agent’s behaviour.| `compute_pif_hidden` (RNN), `compute_pif_oa_hist` (FF) |
+| **AA**  | $I(A_t^i; A_t^j \mid O_t^i, O_t^j)$ | Residual same-timestep action dependence remains after conditioning on both agents’ current observations. This is consistent with **instantaneous conventions**, **symmetry breaking**, or shared unobserved drivers. | `compute_aa` |
+| **DAI** | $T^{-1}\sum_t I(\tau_{t-1}^i; A_t^j \mid \tau_{t-1}^j)$ | Agent $i$'s past provides additional predictive information about agent $j$'s future action beyond $j$'s own past. This is consistent with **temporally directed dependence**. | `compute_dai_hidden` (RNN), `compute_dai_oa_hist` (FF) |
+
+Each diagnostic also has a normalised form in $[0, 1]$, obtained by dividing by the relevant action entropy or residual action entropy:
+
+- **OAR**: divided by $H(A_t^i)$.
+- **HAR**: divided by $H(A_t^i \mid O_t^i)$.
+- **PIF**: divided by $H(A_t^j \mid \tau_{t-1}^j, O_t^j)$.
+- **AA**: divided by $H(A_t^j \mid O_t^i, O_t^j)$.
+- **DAI**: divided by $T^{-1}\sum_t H(A_t^j \mid \tau_{t-1}^j)$.
+
+We also compute a permutation-null baseline for each diagnostic. The action sequence is shuffled within each agent, preserving marginal action statistics while destroying temporal and cross-agent dependencies. A diagnostic is treated as **above-null** only when its value on the original trajectories exceeds the mean over null replicates. This helps account for finite-sample bias and noise in MI estimators.
+
+The **memory-reactive performance gap** $\Delta_{\mathrm{Mem}} = J(\pi_{\mathrm{RNN}}) - J(\pi_{\mathrm{FF}})$ is computed from training-time evaluation returns rather than trajectory data, so it lives outside this package.
+
+## Installation
+
+Requires Python ≥ 3.10. Core dependencies are NumPy, SciPy, scikit-learn, pandas, joblib, and rliable. The package is tested on Python 3.12.
+
+Install the released package:
+
+```bash
+pip install dec-pomdp-diagnostics
+```
+
+Install from source for development:
+
+```bash
+git clone https://github.com/KaleabTessera/probing-dec-pomdps.git
+cd probing-dec-pomdps
+pip install -e .
+```
+
+Install test/development extras:
+
+```bash
+pip install -e ".[dev]"
+pytest
+```
+
+## Quickstart
+
+If you already have MARL trajectories, you do not need the W&B pipeline. Wrap your arrays in `UserData`, call `compute_diagnostics` for each `(environment, algorithm, seed)` run, then use `build_paper_table` to aggregate results across scenarios.
+
+Expected array shapes:
+
+- `observations[agent]`: `(N, obs_dim)`
+- `actions[agent]`: `(N,)` for discrete actions or `(N, act_dim)` for continuous actions
+- `timesteps[agent]`: `(N,)`, integer step within episode
+- `episode_ids[agent]`: `(N,)`, integer episode or parallel-env id
+- `hidden_states[agent]`: optional `(N, hidden_dim)` for recurrent policies
+
+```python
+import numpy as np
+import dec_pomdp_diagnostics as dpd
+
+rng = np.random.default_rng(0)
+# N = total steps, T = timesteps per episode
+N, obs_dim, T = 1200, 8, 24
+n_eps = N // T
+obs0 = rng.normal(size=(N, obs_dim)).astype(np.float32)
+obs1 = rng.normal(size=(N, obs_dim)).astype(np.float32)
+act0 = rng.integers(0, 2, size=N, dtype=np.int64)
+act1 = rng.integers(0, 2, size=N, dtype=np.int64)
+ts = np.tile(np.arange(T, dtype=np.int64), n_eps)
+eps = np.repeat(np.arange(n_eps, dtype=np.int64), T)
+Sd = {"agent_0": obs0, "agent_1": obs1}
+Td = {"agent_0": ts, "agent_1": ts}
+Ed = {"agent_0": eps, "agent_1": eps}
+
+# OAR: raw action arrays from rollouts.
+Ad = {"agent_0": act0, "agent_1": act1}
+oar, oar_norm = dpd.compute_oar(Sd, Ad)
+print(oar_norm)
+
+# HAR / PIF / AA / DAI use the same raw-array pattern.
+har, har_norm = dpd.compute_har_ohist(Sd, Ad, Td, Ed, k_window=3)
+pif, pif_norm, _ = dpd.compute_pif_oa_hist(Sd, Ad, Td, Ed, k_window=3)
+aa, aa_norm, _ = dpd.compute_aa(Sd, Ad, Td, Ed)
+dai, dai_norm, _ = dpd.compute_dai_oa_hist(Sd, Ad, Td, Ed, k_window=3)
+
+result = dpd.compute_diagnostics(
+     dpd.UserData(
+         observations={"agent_0": obs0, "agent_1": obs1},
+         actions={"agent_0": act0, "agent_1": act1},
+         timesteps={"agent_0": ts, "agent_1": ts},
+         episode_ids={"agent_0": eps, "agent_1": eps},
+         env_name="my_env",
+         alg_name="IPPO",
+         seed=0,
+     ),
+     history_k=3,
+     null_reps=5,
+ )
+print(result.describe())
+# Run my_env/IPPO/seed0:
+#   ✗  Do actions depend on history?  (Diag 2: HAR^norm > permutation null, HAR^norm=0.0430, HAR^null=0.0442)
+#   ✗  Does teammate information help predict another agent's actions?  (Diag 4: PIF^norm > null, PIF^norm=0.0377, PIF^null=0.0355)
+#   ✗  Does synchronous coordination emerge?  (Diag 5: AA^norm > null, AA^norm=0.0278, AA^null=0.0278)
+#   ✗  Does temporal coordination emerge?  (Diag 6: DAI^norm > null, DAI^norm=0.0365, DAI^null=0.0360)
+#   Note: flags are guidance, not strict pass/fail; using min_effect=0.0100
+#   Table values: OAR^norm=0.0165, HAR^norm=0.0430, PIF^norm=0.0377, AA^norm=0.0278, DAI^norm=0.0365
+```
+
+For the full **memory–reactive performance gap** (Diagnostic 1), pair the
+mean evaluation returns of matched RNN/FF seeds:
+
+```python
+gap = dpd.memory_reactive_gap(rnn_returns=[...], ff_returns=[...])
+# {'delta_mean': 6.50, 'p_value': 0.031, 'benefits_from_memory': True, 'n_pairs': 10}
+```
+
+Pass `memory_gap_flags={env_name: gap['benefits_from_memory']}` to
+`build_paper_table` to combine it with the HAR-uses-history check, matching
+Decision Rule 1 exactly.
+
+### What `compute_diagnostics` does for you
+
+* **Validates** shapes, dtypes, and key consistency — clear errors if obs is
+  1D, timesteps are float, or agent keys don't match across fields.
+* Picks the right estimator per metric (Frenzel-Pompe KSG for continuous
+  actions, posterior-KL for discrete, Ross 2014 for low-D OAR).
+* Auto-detects continuous vs discrete actions; override with
+  `force_continuous_A=True` if needed.
+* Subsamples per agent jointly (preserving cross-agent alignment) when
+  trajectories are long; defaults to ≤ 8000 samples.
+* Runs the **permutation null** (shuffle each agent's actions independently)
+  and applies Decision Rules 2-4 directly: a flag is True iff the metric
+  exceeds its null mean by at least `min_effect` (default `0.01`).
+
+### Interpreting the outputs
+
+The flags are diagnostic guidance, not hard pass/fail labels. A metric can be large because the trained policies expose a behavioural dependence under the sampled rollout distribution; a different algorithm, architecture, or training seed may induce a different diagnostic profile in the same scenario. Borderline effects should be read with the reported null baselines and confidence intervals.
+
+## Project layout
+
+```
+dec_pomdp_diagnostics/
+├── api.py            # USER-FACING: UserData, compute_diagnostics, build_paper_table, memory_reactive_gap
+├── estimators.py     # kNN MI/CMI building blocks (KSG, Frenzel-Pompe, Ross, posterior-KL)
+├── metrics.py        # The five diagnostics (lower-level, dict-of-arrays API)
+├── data.py           # Dataset loading, packed-format unpacking, alignment, subsampling
+├── pipeline.py       # Per-run orchestration + permutation null
+├── summary.py        # rliable bootstrap CIs + LaTeX table (replication mode)
+├── wandb_collect.py  # Optional W&B artifact downloader
+├── cli.py            # `dec-pomdp-metrics` and `dec-pomdp-collect`
+└── __init__.py       # Top-level exports
+```
+
+## CLI reference
+
+```bash
+dec-pomdp-metrics --help
+```
+
+Common flags:
+
+* `--metrics oar har pif aa dai` — subset of diagnostics to compute (default: all)
+* `--history-k 3` — observation/action history window length (paper default)
+* `--cmi-k 25` — kNN neighbours for the CMI estimator (paper default)
+* `--posterior-alpha 0.5` — Laplace smoothing for discrete-action kNN posteriors
+* `--null-reps 5` — permutation-null replicates per run (paper default)
+* `--parallel --n-jobs 24` — joblib parallelism over runs
+* `--max-samples 8000` — joint subsampling per agent (preserves cross-agent alignment)
+* `--force-continuous-A` — required for continuous-action environments (e.g. MaBrax)
+* `--env <name> ... --alg <name> ...` — filter to a subset
+
+The output is three files: ``<input>_metrics_<set>.csv`` (per-run rows),
+``..._summary.csv`` (per-(env, alg) bootstrap CIs), and ``..._table.tex``
+(LaTeX table in the paper format).
+
+### Troubleshooting exact zeros
+
+If OAR/HAR/PIF/AA/DAI are unexpectedly all zero, check the runtime warnings.
+For discrete actions with many encoded classes, the posterior-kNN estimators
+can be over-smoothed when ``posterior_alpha * n_action_classes`` is large
+relative to ``cmi_k``. This is especially easy to hit with high-dimensional
+observations and sparse/non-compact action IDs. Try lowering
+``--posterior-alpha`` (for example ``0.01``), increasing ``--cmi-k`` and/or
+``--max-samples``, and verifying that action IDs are compact and intentional.
+
+For recurrent policies, make sure hidden states are present. If ``alg_name``
+contains ``RNN`` but ``UserData.hidden_states`` is omitted, the library warns
+and reports the feed-forward observation-history proxy metrics rather than
+hidden-state HAR/PIF/DAI.
+
+## Tests
+
+The test suite includes synthetic sanity checks where each diagnostic should
+be high under a designed dependency and low under an independent control, for
+both discrete and continuous actions:
+
+```bash
+pip install -e ".[dev]"
+pytest tests/test_synthetic_metrics.py
+```
+
+## Citation
+
+```bibtex
+@inproceedings{
+tessera2026probing,
+title={Probing Dec-{POMDP} Reasoning in Cooperative {MARL}},
+author={{Kale-ab} Abebe Tessera and Leonard Hinckeldey and Riccardo Zamboni and David Abel and Amos Storkey},
+booktitle={The 25th International Conference on Autonomous Agents and Multi-Agent Systems},
+year={2026},
+url={https://openreview.net/forum?id=gSK8tR7du3}
+}
+```