Tight bounds for the maximum acyclic subgraph problem
Journal of Algorithms
Online computation and competitive analysis
Online computation and competitive analysis
Best-fit bin-packing with random order
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Rank aggregation methods for the Web
Proceedings of the 10th international conference on World Wide Web
Ordering by weighted number of wins gives a good ranking for weighted tournaments
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
SIAM Journal on Discrete Mathematics
The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
Combinatorics, Probability and Computing
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Matroids, secretary problems, and online mechanisms
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On the Advantage over Random for Maximum Acyclic Subgraph
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Yet another algorithm for dense max cut: go greedy
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Probabilistic computations: Toward a unified measure of complexity
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Aggregating inconsistent information: Ranking and clustering
Journal of the ACM (JACM)
The adwords problem: online keyword matching with budgeted bidders under random permutations
Proceedings of the 10th ACM conference on Electronic commerce
Computing slater rankings using similarities among candidates
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
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.