How to rank with few errors 论文

2007引用 228

Game Theory and Voting SystemsComplexity and Algorithms in GraphsAuction Theory and Applications

Auction Theory and Applications Complexity and Algorithms in Graphs Game Theory and Voting Systems

相关技术:Complexity and Algorithms in Graphs

作者

摘要

We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for Kemeny-Young rank aggregation.

作者查看全部 (2)

Warren Schudy

Claire Kenyon-Mathieu

How to rank with few errors 论文

摘要

作者查看全部 (2)

相关技术查看全部 (1)

相关事件

相关文章