Browsing Combinatorics and Optimization by Subject "Network Bargaining"
Now showing items 1-1 of 1
-
Stabilizing Weighted Graphs
(University of Waterloo, 2017-08-29)An edge-weighted graph G = (V,E) is called stable if the value of a maximum-weight matching equals the value of a maximum-weight fractional matching. Stable graphs play an important role in some interesting game theory ...