Sciweavers

2 search results - page 1 / 1
» Fixed Parameter Polynomial Time Algorithms for Maximum Agree...
Sort
View
CORR
2008
Springer
92views Education» more  CORR 2008»
13 years 5 months ago
Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees
Consider a set of labels L and a set of trees T = {T (1) , T (2) , . . . , T (k) } where each tree T (i) is distinctly leaf-labeled by some subset of L. One fundamental problem is ...
Viet Tung Hoang, Wing-Kin Sung
CORR
2010
Springer
182views Education» more  CORR 2010»
13 years 5 months ago
Fast Convergence of Natural Bargaining Dynamics in Exchange Networks
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
Yashodhan Kanoria, Mohsen Bayati, Christian Borgs,...