A note on the core of 2-matching games

Laura Sanità; Lucy Verberk

doi:10.1016/j.orl.2025.107299

A note on the core of 2-matching games

Laura Sanità, Lucy Verberk (Corresponding author)

Combinatorial Optimization

Research output: Contribution to journal › Article › Academic › peer-review

3 Downloads (Pure)

Abstract

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.

Original language	English
Article number	107299
Number of pages	4
Journal	Operations Research Letters
Volume	61
DOIs	https://doi.org/10.1016/j.orl.2025.107299
Publication status	Published - Jul 2025

Bibliographical note

Publisher Copyright:
© 2025 The Authors

Keywords

2-matching
Cooperative matching games
Core

Access to Document

10.1016/j.orl.2025.107299

pdfFinal published version, 579 KBLicence: CC BY

Cite this

@article{924fec5e3594420592cd0cf1089a4ce1,

title = "A note on the core of 2-matching games",

abstract = "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.",

keywords = "2-matching, Cooperative matching games, Core",

author = "Laura Sanit{\`a} and Lucy Verberk",

note = "Publisher Copyright: {\textcopyright} 2025 The Authors",

year = "2025",

month = jul,

doi = "10.1016/j.orl.2025.107299",

language = "English",

volume = "61",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - A note on the core of 2-matching games

AU - Sanità, Laura

AU - Verberk, Lucy

PY - 2025/7

Y1 - 2025/7

N2 - 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.

AB - 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.

KW - 2-matching

KW - Cooperative matching games

KW - Core

UR - http://www.scopus.com/inward/record.url?scp=105003304155&partnerID=8YFLogxK

U2 - 10.1016/j.orl.2025.107299

DO - 10.1016/j.orl.2025.107299

M3 - Article

AN - SCOPUS:105003304155

SN - 0167-6377

VL - 61

JO - Operations Research Letters

JF - Operations Research Letters

M1 - 107299

ER -

A note on the core of 2-matching games

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this