Ranking tournaments with no errors. II: Minimax relation

DOI10.1016/J.JCTB.2019.10.004zbMATH Open1437.05085OpenAlexW2981646601MaRDI QIDQ1985451FDOQ1985451

Authors: Guoli Ding, Wenan Zang, Xujin Chen, Qiu-Lan Zhao 

Publication date: 7 April 2020

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2019.10.004

Recommendations

• Ranking tournaments with no errors. I: Structural description
• Some impossibilities of ranking in generalized tournaments
• On the Minimum Violations Ranking of a Tournament
• A Min-Max Theorem on Tournaments
• A note on min-max pair in tournaments
• The first-order approach in rank-order tournaments
• Tournament Ranking with Expected Profit in Polynomial Time
• scientific article
• An alternative interpretation of random noise in rank-order tournaments
• On negative dependence inequalities and maximal scores in round-robin tournaments

zbMATH Keywords

algorithmdualityfeedback arc settournamentintegrality

Mathematics Subject Classification ID

Linear programming (90C05) Directed graphs (digraphs), tournaments (05C20) Signed and weighted graphs (05C22)

Cites Work

• Title not available (Why is that?)
• The ellipsoid method and its consequences in combinatorial optimization
• Packing cycles in graphs. II
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Title not available (Why is that?)
• A Minimax Theorem for Directed Graphs
• The matroids with the max-flow min-cut property
• Packing odd circuits in Eulerian graphs
• Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes
• Packing cycles in graphs
• An approximation algorithm for feedback vertex sets in tournaments
• Packing circuits in eulerian digraphs
• Packing directed circuits exactly
• Integral infeasibility and testing total dual integrality
• Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs
• A short proof of Seymour's characterization of the matroids with the max-flow min-cut property
• Ranking tournaments with no errors. I: Structural description
• Title not available (Why is that?)

Cited In (3)

• Ranking tournaments with no errors. I: Structural description
• An alternative interpretation of random noise in rank-order tournaments
• Isolation number versus Boolean rank in tournaments

This page was built for publication: Ranking tournaments with no errors. II: Minimax relation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1985451)