A note on the core of 2-matching games
Cooperative 2-matching games are a generalization of cooperative matching games, where the value function is given by maximum-weight b -matchings, for a vertex capacity vector b ≤ 2 . We show how to separate over the core of 2-matching games in polynomial time, fixing a small flaw in the literature, and prove the existence of a compact extended formulation for it.
Authors
- Lucy Verberk (ORCID: https://orcid.org/0000-0002-4695-0576)
- Laura Sanità (ORCID: https://orcid.org/0000-0002-6384-1857)
Institutions
- Bocconi University (IT)
- Eindhoven University of Technology (NL)
Publication Details
- Journal
- Operations Research Letters
- Published
- 2025-04-18
- DOI
- https://doi.org/10.1016/j.orl.2025.107299
- Citations
- 1
- Primary Topic
- Game Theory and Voting Systems
- Type
- article
- Field-Weighted Citation Impact
- 3.13
Funders
- Nederlandse Organisatie voor Wetenschappelijk Onderzoek