Ranking Tournaments

Authors:
Noga Alon
Affiliations:
-
Venue:
SIAM Journal on Discrete Mathematics
Year:
2006

Citing 0
Cited 52

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
Parameterized algorithms for feedback set problems and their duals in tournaments

Theoretical Computer Science - Parameterized and exact computation
Algorithms for discovering bucket orders from data

Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments

Combinatorics, Probability and Computing
Feedback arc set in bipartite tournaments is NP-complete

Information Processing Letters
How to rank with few errors

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Hardness of fully dense problems

Information and Computation
Aggregation of partial rankings, p-ratings and top-m lists

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
The computational complexity of choice sets

TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
Feedback arc set problem in bipartite tournaments

Information Processing Letters
Noisy sorting without resampling

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Robust reductions from ranking to classification

Machine Learning
Theory research at Google

ACM SIGACT News
Aggregating inconsistent information: Ranking and clustering

Journal of the ACM (JACM)
Label ranking by learning pairwise preferences

Artificial Intelligence
A Short Introduction to Computational Social Choice

SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Decision tree and instance-based learning for label ranking

ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
A New Instance-Based Label Ranking Approach Using the Mallows Model

ISNN '09 Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks
Fast FAST

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Computing slater rankings using similarities among candidates

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems

Mathematics of Operations Research
Hardness of edge-modification problems

Theoretical Computer Science
Fixed-parameter tractability results for feedback set problems in tournaments

Journal of Discrete Algorithms
On predictive accuracy and risk minimization in pairwise label ranking

Journal of Computer and System Sciences
Directed graphs without short cycles

Combinatorics, Probability and Computing
Note: A tournament of order 14 with disjoint Banks and Slater sets

Discrete Applied Mathematics
Feedback arc set problem in bipartite tournaments

TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Robust reductions from ranking to classification

COLT'07 Proceedings of the 20th annual conference on Learning theory
PageRank as a weak tournament solution

WINE'07 Proceedings of the 3rd international conference on Internet and network economics
New results on optimizing rooted triplets consistency

Discrete Applied Mathematics
Ordering by weighted number of wins gives a good ranking for weighted tournaments

ACM Transactions on Algorithms (TALG)
Minimal retentive sets in tournaments

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Comparing multiagent systems research in combinatorial auctions and voting

Annals of Mathematics and Artificial Intelligence
Learning to re-rank web search results with multiple pairwise features

Proceedings of the fourth ACM international conference on Web search and data mining
Online ranking for tournament graphs

WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Rank aggregation via nuclear norm minimization

Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Kernels for feedback arc set in tournaments

Journal of Computer and System Sciences
Conflict packing yields linear vertex-kernels for k-FAST, k-dense RTI and a related problem

MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Fixed-parameter tractability results for feedback set problems in tournaments

CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Additive approximation for edge-deletion problems

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
The complexity of computing minimal unidirectional covering sets

CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
An active learning algorithm for ranking from pairwise preferences with an almost optimal query complexity

The Journal of Machine Learning Research
A polynomial kernel for feedback arc set on bipartite tournaments

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
On the fixed-parameter tractability of composition-consistent tournament solutions

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Rigging tournament brackets for weaker players

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Uniqueness in Discrete Tomography: Three Remarks and a Corollary

SIAM Journal on Discrete Mathematics
Lot-based voting rules

Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
A quadratic vertex kernel for feedback arc set in bipartite tournaments

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Putting human assessments of machine translation systems in order

WMT '12 Proceedings of the Seventh Workshop on Statistical Machine Translation
Computing a profit-maximizing sequence of offers to agents in a social network

WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
It only takes a few: on the hardness of voting with a constant number of agents

Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments

Theory of Computing Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A tournament is an oriented complete graph. The feedback arc set problem for tournaments is the optimization problem of determining the minimum possible number of edges of a given input tournament T whose reversal makes T acyclic. Ailon, Charikar, and Newman showed that this problem is NP-hard under randomized reductions. Here we show that it is in fact NP-hard. This settles a conjecture of Bang-Jensen and Thomassen.