Computational complexity of a cost allocation approach to a fixed cost spanning forest problem
Mathematics of Operations Research
On the complexity of cooperative solution concepts
Mathematics of Operations Research
An algorithm for finding the nucleolus of assignment games
International Journal of Game Theory
The kernel/nucleolus of a standard tree game
International Journal of Game Theory
On the complexity of testing membership in the core of min-cost spanning tree games
International Journal of Game Theory
The nucleon of cooperative games and an algorithm for matching games
Mathematical Programming: Series A and B
Characterization sets for the nucleolus
International Journal of Game Theory
Computing the nucleolus of min-cost spanning tree games is NP-hard
International Journal of Game Theory
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
Graph Theory With Applications
Graph Theory With Applications
Finding nucleolus of flow game
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Lexicographically Minimum and Maximum Load Linear Programming Problems
Operations Research
Encouraging Cooperation in Sharing Supermodular Costs
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Computing the nucleolus of weighted voting games
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
On the Core and f-Nucleolus of Flow Games
Mathematics of Operations Research
A Formal Theory of Cooperative TU-Games
MDAI '09 Proceedings of the 6th International Conference on Modeling Decisions for Artificial Intelligence
A Practical Combinatorial Clock Exchange for Spectrum Licenses
Decision Analysis
Monotone cooperative games and their threshold versions
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Operations Research
The cooperative game theory foundations of network bargaining games
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
On the complexity of core, kernel, and bargaining set
Artificial Intelligence
Complexity of coalition structure generation
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
On solution concepts for matching games
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Agent failures in totally balanced games and convex games
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
| Hi-index | 0.00 |
A matching game is a cooperative game defined by a graph G = (N, E). The player set is N and the value of a coalition S ⊆ N is defined as the size of a maximum matching in the subgraph induced by S. We show that the nucleolus of such games can be computed efficiently. The result is based on an alternative characterization of the least core, which may be of independent interest. The general case of weighted matching games remains unsolved.