Stabilizing Weighted Graphs

An edge-weighted graph G 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 network bargaining games and cooperative matching games, because they characterize instances that admit stable outcome...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Mathematics of operations research 2020-11, Vol.45 (4), p.1318-1341
Hauptverfasser:	Koh, Zhuan Khye, Sanità, Laura
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Apexes Approximation Bargaining Combinatorial analysis Game theory Games Graph matching Graph theory Graphs matching Mathematical analysis network bargaining Operations research Polynomials Primary: 05C70, 90C27, 91A43 Primary: graphs/matching, games/bargaining Ratios secondary: 68Q25, 68R10, 68W25, 90C05 secondary: programming/linear Weight
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!