自私顶点匹配的代价
计算几何
2015-03-19 v4
摘要
我们通过无政府状态代价与稳定性代价的视角，分析了带有自私顶点的最小费用完美匹配问题。用于此分析的基本解概念是 Gale-Shapley 稳定匹配概念，其中偏好的设定使得每个参与者（顶点）希望最小化其自身匹配边的费用。
引用
@article{arxiv.1112.4632,
title = {The Price of Matching Selfish Vertices},
author = {Yuval Emek and Tobias Langner and Roger Wattenhofer},
journal= {arXiv preprint arXiv:1112.4632},
year = {2015}
}
备注
We changed the perspective of our paper and now look at the minimum-cost perfect matching problem through the price of anarchy (PoA) and price of stability (PoS) lens. Our previous results can be seen as analyzing the PoS of minimum-cost perfect matching and we now added an analysis of the PoA of this problem