Online Ranking for Tournament Graphs

We study the problem of producing a global ranking of items given pairwise ranking information, when the items to be ranked arrive in an online fashion. We study both the maximization and the minimization versions of the problem on tournaments (max acyclic subgraph, feedback arc set). We also study the case when the items arrive in random order.

• Type: Journal
• Year: 2010
• Where: WAOA
• Authors: Claire Mathieu, Adrian Vladu
• Keywords: Algorithms, Global Ranking, Max Acyclic Subgraph, Pairwise Ranking, WAOA 2010