Sign in

The General Graph Matching Game: Approximate Core

By Vijay Vazirani
The classic paper of Shapley and Shubik \cite{Shapley1971assignment} characterized the core of the assignment game using ideas from matching theory and LP-duality theory and their highly non-trivial interplay. Whereas the core of the assignment game is always non-empty, that of the general graph matching game can be empty. This paper... Show more
January 21, 2021
=
0
Loading PDF…
Loading full text...
Similar articles
Loading recommendations...
=
0
x1
The General Graph Matching Game: Approximate Core
Click on play to start listening