Browsing Mathematics (Faculty of) by Subject "Network Bargaining"
Now showing items 1-2 of 2
-
Network Bargaining: Creating Stability Using Blocking Sets
(University of Waterloo, 2012-01-20)Bargaining theory seeks to answer the question of how to divide a jointly generated surplus between multiple agents. John Nash proposed the Nash Bargaining Solution to answer this question for the special case of two agents. ... -
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 ...