Stabilization of capacitated matching games

DOI10.1007/S10107-024-02169-XMaRDI QIDQ7019068zbMATH OpenFDO

Authors Matthew Gerstbrein, Laura Sanità, Lucy Verberk

Publication date 5 March 2025

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://research.tue.nl/en/publications/85cfb89e-7df6-4e30-95b3-a1ac3ea22c4c

zbMATH Keywords

cooperative matching gamesgame theorymatchingnetwork bargaining

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Combinatorial games (91A46)

Cites work

• Additive stabilizers for unstable graphs
• Algorithmic Aspects of the Core of Combinatorial Optimization Games
• Approximating the minimum maximal independence number
• Efficient stabilization of cooperative matching games
• Finding small stabilizers for unstable graphs
• Graph stabilization: a survey
• scientific article; zbMATH DE number 5485541 (Why is no real title available?)
• Network bargaining: using approximate blocking sets to stabilize unstable instances
• On solution concepts for matching games
• Some APX-completeness results for cubic graphs
• Stabilizing network bargaining games by blocking players
• Stabilizing weighted graphs
• The assignment game. I: The core
• The bargaining problem
• The cooperative game theory foundations of network bargaining games
• The stable fixtures problem with payments

This page was built for publication: Stabilization of capacitated matching games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7019068)