An algorithm for finding the nucleolus of assignment games
International Journal of Game Theory
The nucleon of cooperative games and an algorithm for matching games
Mathematical Programming: Series A and B
Data structures for weighted matching and nearest common ancestors with linking
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Algorithmic Aspects of the Core of Combinatorial Optimization Games
Mathematics of Operations Research
Stable outcomes of the roommate game with transferable utility
International Journal of Game Theory
Matching games: the least core and the nucleolus
Mathematics of Operations Research
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
“Almost stable” matchings in the roommates problem
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Network bargaining: using approximate blocking sets to stabilize unstable instances
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
| Hi-index | 0.00 |
A matching game is a cooperative game (N,v) defined on a graph G=(N,E) with an edge weighting $w: E\to {\mathbb R}_+$ The player set is N and the value of a coalition S⊆N is defined as the maximum weight of a matching in the subgraph induced by S First we present an O(nm+n2logn) algorithm that tests if the core of a matching game defined on a weighted graph with n vertices and m edges is nonempty and that computes a core allocation if the core is nonempty This improves previous work based on the ellipsoid method Second we show that the nucleolus of an n-player matching game with nonempty core can be computed in O(n4) time This generalizes the corresponding result of Solymosi and Raghavan for assignment games Third we show that determining an imputation with minimum number of blocking pairs is an NP-hard problem, even for matching games with unit edge weights.