A Note on the Core of 2-Matching Games
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866915145226125312 |
|---|---|
| author | Sanità, Laura Verberk, Lucy |
| author_facet | Sanità, Laura Verberk, Lucy |
| contents | 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 \leq 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_19227 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Note on the Core of 2-Matching Games Sanità, Laura Verberk, Lucy Computer Science and Game Theory Discrete Mathematics 91A12, 05C70 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 \leq 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. |
| title | A Note on the Core of 2-Matching Games |
| topic | Computer Science and Game Theory Discrete Mathematics 91A12, 05C70 |
| url | https://arxiv.org/abs/2411.19227 |