Solutions for the stable roommates problem with payments
From MaRDI portal
Publication:2453162
DOI10.1016/j.tcs.2013.03.027;zbMath1422.91546MaRDI QIDQ2453162
Péter Biró, Matthijs Bomhoff, Daniël Paulusma, Walter Kern, Petr A. Golovach
Publication date: 6 June 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://www.sciencedirect.com/science/article/pii/S030439751300251X/pdfft?isDTMRedir=true&download=true
Related Items (11)
The stable fixtures problem with payments ⋮ Stability properties of the core in a generalized assignment problem ⋮ Additive stabilizers for unstable graphs ⋮ Finding small stabilizers for unstable graphs ⋮ Unnamed Item ⋮ Dynamics in matching and coalition formation games with structural constraints ⋮ The importance of memory for price discovery in decentralized markets ⋮ Efficient stabilization of cooperative matching games ⋮ Stabilizing network bargaining games by blocking players ⋮ Stabilizing Weighted Graphs ⋮ The Stable Fixtures Problem with Payments
Cites Work
- Accessible outcomes versus absorbing outcomes
- Computing solutions for matching games
- Random paths to stability in the roommate problem
- The coalition structure core is accessible
- Some simplified NP-complete graph problems
- Stable outcomes of the roommate game with transferable utility
- The assignment game. I: The core
- Random Paths to Stability in Two-Sided Matching
- Approximation and Online Algorithms
- College Admissions and the Stability of Marriage
- Unnamed Item
- Unnamed Item
This page was built for publication: Solutions for the stable roommates problem with payments