The polytope of win vectors

DOI10.1007/BF02558460zbMath0928.05058OpenAlexW2099172527MaRDI QIDQ1293440

J. E. Bartels, Dominic J. A. Welsh, 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

zbMATH Keywords

competitionpolytopegamerandom generationapproximate countingpolymatroidscore vectorpolynomial randomized approximation schemewin vector

Mathematics Subject Classification ID

Applications of graph theory (05C90) Games involving graphs (91A43) Combinatorial aspects of matroids and geometric lattices (05B35) Asymptotic enumeration (05A16) Directed graphs (digraphs), tournaments (05C20)

Related Items

Unnamed Item, The Potts model and the Tutte polynomial, Partial graph orientations and the Tutte polynomial, Riemann-Roch theory for graph orientations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Forests and score vectors
• Adjacency on polymatroids
• The Ranking of Incomplete Tournaments: A Mathematician's Guide to Popular Sports
• Competition Experiments
• Decompositions of Rational Convex Polytopes
• Random walks in a convex body and an improved volume algorithm
• A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs
• On the computational complexity of the Jones and Tutte polynomials
• Combinatorial Properties of Associated Zonotopes
• Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case