Data

Tools

Indexes

Applications

Experiments

Open Source Science

matching-paradox-sim

https://github.com/shuligraph/matching-paradox-sim

Science Score: 44.0%

This score indicates how likely this project is to be science-related based on various indicators:

  • ✓
    CITATION.cff file
    Found CITATION.cff file
  • ✓
    codemeta.json file
    Found codemeta.json file
  • ✓
    .zenodo.json file
    Found .zenodo.json file
  • ○
    DOI references
  • ○
    Academic publication links
  • ○
    Academic email domains
  • ○
    Institutional organization owner
  • ○
    JOSS paper metadata
  • ○
    Scientific vocabulary similarity
    Low similarity (10.2%) to scientific vocabulary
Last synced: 6 months ago · JSON representation ·

Repository

Basic Info
  • Host: GitHub
  • Owner: shuligraph
  • License: other
  • Language: Python
  • Default Branch: main
  • Size: 30.3 KB
Statistics
  • Stars: 0
  • Watchers: 1
  • Forks: 0
  • Open Issues: 0
  • Releases: 2
Created 10 months ago · Last pushed 9 months ago
Metadata Files
Readme License Citation

README.md

matching-paradox-sim

Python implementation for the paper
“Performance paradoxes in matching systems are not that rare”
A. Busic · J.M. Fourneau · S. Li — NETGCOOP 2025

Contents

| File | Purpose | |------|---------| | simulator.py | Core algorithm | | README.md | Project documentation (this file) | | CITATION.cff | Citation metadata (YAML) | | references.bib | BibTeX entry for the paper | | requirements.txt | Python dependencies | | LICENSE | MIT License | | .gitignore | Standard Python ignores |

Quick Start

```bash git clone https://github.com/shuligraph/matching-paradox-sim.git cd matching-paradox-sim

python -m venv .venv source .venv/bin/activate

pip install -r requirements.txt python simulator.py
````

Example output

```text --- G1 --- Bottleneck set: {1, 4} Bottleneck: 0.077080 E[Q] = 7.861968

--- G1_mod1 --- Bottleneck set: {1, 4} Bottleneck: 0.077080 E[Q] = 8.179189 ```

Using Your Graph

  1. Open simulator.py and scroll to the # -- Example -- block.

  2. Replace that block with your graph:

```python G = nx.Graph() G.addedgesfrom([(1, 2), (1, 3), (2, 3), (3, 4)])

mu = {1: 0.15, 2: 0.30, 3: 0.25, 4: 0.10}

G1mod1 = G1.copy(); G1mod1.add_edge(1, 4)

```

  1. Run the script again:

bash python simulator.py

The script will print stability, the bottleneck set, and the expected queue length $E[G,α]$.

Contributing

Bug reports, documentation improvements, and additional examples are welcome. For large changes, please open an issue first.

License

Released under the MIT License (see LICENSE).

Citation

See CITATION.cff for software citation and references.bib for the paper’s BibTeX entry.

Owner

  • Name: Shu Li
  • Login: shuligraph
  • Kind: user
  • Company: INRIA

(ಡωಡ)

Citation (CITATION.cff) 

cff-version: 1.0.0
title: "Matching Paradox Simulator"
version: "1.0.0"
date-released: 2025-05-21
license: MIT
authors:
  - family-names: Li
    given-names: Shu
    affiliation: "Inria"
    orcid: "0000-0002-4075-9885"
  - family-names: Busic
    given-names: Ana
    affiliation: "Inria"
  - family-names: Fourneau
    given-names: Jean-Michel
    affiliation: "Inria"
repository-code: https://github.com/shuligraph/matching-paradox-sim
doi: 10.5281/zenodo.15481720
url: https://github.com/shuligraph/matching-paradox-sim
type: software

GitHub Events

Total
  • Release event: 3
  • Delete event: 1
  • Push event: 14
  • Create event: 7
Last Year
  • Release event: 3
  • Delete event: 1
  • Push event: 14
  • Create event: 7

Dependencies

requirements.txt pypi
  • networkx >=2.8