The polytope of win vectors
DOI10.1007/BF02558460zbMATH Open0928.05058OpenAlexW2099172527MaRDI QIDQ1293440FDOQ1293440
D. J. A. Welsh, J. E. Bartels, John A. Mount
Publication date: 12 January 2000
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02558460
Recommendations
competitionpolytopeapproximate countinggamepolymatroidscore vectorrandom generationpolynomial randomized approximation schemewin vector
Applications of graph theory (05C90) Directed graphs (digraphs), tournaments (05C20) Asymptotic enumeration (05A16) Combinatorial aspects of matroids and geometric lattices (05B35) Games involving graphs (91A43)
Cites Work
- Decompositions of Rational Convex Polytopes
- Title not available (Why is that?)
- Random walks in a convex body and an improved volume algorithm
- On the computational complexity of the Jones and Tutte polynomials
- Title not available (Why is that?)
- Adjacency on polymatroids
- Combinatorial Properties of Associated Zonotopes
- Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Ranking of Incomplete Tournaments: A Mathematician's Guide to Popular Sports
- Forests and score vectors
- Competition Experiments
- A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs
Cited In (5)
This page was built for publication: The polytope of win vectors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1293440)
