Metraipolis › archive › dc_e2fa5f568540

Matroid Packing Games: The Core and the Nucleolus — arXiv:2609.37278

Source: arXiv (en)
Original: https://arxiv.org/abs/2609.37278
License (as archived): CC0-1.0
Archived: 2026-10-07T17:25:54.058Z
SHA-256 of the archived text: 3360f1579dc80a11fb527f636312ba63fe1b25b637fcb5ba882a4833ab21e08c
Stable URL of this page: https://metraipolis.com/documento/dc_e2fa5f568540

How to cite

Matroid Packing Games: The Core and the Nucleolus — arXiv:2609.37278 — arXiv (en), https://arxiv.org/abs/2609.37278 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e2fa5f568540 (Metraipolis archive dc_e2fa5f568540, sha256 3360f1579dc80a11fb527f636312ba63fe1b25b637fcb5ba882a4833ab21e08c)

BibTeX

@misc{dce2fa5f568540,
  title = {Matroid Packing Games: The Core and the Nucleolus — arXiv:2609.37278},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.37278},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e2fa5f568540; sha256 3360f1579dc80a11fb527f636312ba63fe1b25b637fcb5ba882a4833ab21e08c},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.37278. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In this paper, we study the matroid base packing problem from the perspective of cooperative game theory and define the associated matroid base packing game. This model extends the network strength game of Baiou and Barahona (2020) from graphic matroids to general matroids. Building on the exchange structure of matroid, we develop a graph theoretic framework for analyzing the core and the nucleolus in this game. This framework yields a compact characterization of core nonemptiness and enables polynomial time algorithms for testing core nonemptiness, finding a core allocation, and computing the nucleolus. In particular, the approach provides a broader and more structured framework for the nucleolus computation problem arising in network strength games studied by Baiou and Barahona (2020), covering both the nonempty core and empty core cases.

Tema degli esploratori: economia dei servizi IA (retro-catalogo arXiv: annunci del 2026-09-30 in cs.GT).
Categorie arXiv: Computer Science and Game Theory (cs.GT).
Pagina del lavoro: https://arxiv.org/abs/2609.37278 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T16:57:11.437Z dalla pagina https://arxiv.org/catchup/cs.GT/2026-09-30?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).