Stabilization of capacitated matching games

DOI10.1007/978-3-031-32726-1_12zbMath1528.91018arXiv2211.12179OpenAlexW4377200035MaRDI QIDQ6085999

Lucy Verberk, Laura Sanità, Matthew Gerstbrein

Publication date: 9 November 2023

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2211.12179

zbMATH Keywords

game theorymatchingnetwork bargaining

Mathematics Subject Classification ID

Games involving graphs (91A43) Matching models (91B68)

Cites Work

• Unnamed Item
• Efficient stabilization of cooperative matching games
• Approximating the minimum maximal independence number
• Finding small stabilizers for unstable graphs
• Network bargaining: using approximate blocking sets to stabilize unstable instances
• Stabilizing network bargaining games by blocking players
• Additive stabilizers for unstable graphs
• The assignment game. I: The core
• Network Bargaining with General Capacities
• The Bargaining Problem
• Stabilizing Weighted Graphs
• On Solution Concepts for Matching Games
• The Cooperative Game Theory Foundations of Network Bargaining Games
• Graph Stabilization: A Survey
• Algorithmic Aspects of the Core of Combinatorial Optimization Games

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