The facets and the symmetries of the approval-voting polytope
From MaRDI portal
Publication:1880786
DOI10.1016/j.jctb.2004.04.001zbMath1060.52005OpenAlexW2036922239MaRDI QIDQ1880786
Samuel Fiorini, Jean-Paul Doignon
Publication date: 1 October 2004
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.2004.04.001
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorics of partially ordered sets (06A07) Symmetry properties of polytopes (52B15)
Related Items (6)
Binary choice, subset choice, random utility, and ranking: a unified perspective using the permutahedron ⋮ A lexicographic semiorder polytope and probabilistic representations of choice ⋮ The repeated insertion model for rankings: missing link between two subset choice models ⋮ \textsc{QTest} 2.1: quantitative testing of theories of binary choice using Bayesian inference ⋮ On the combinatorial structure of the approval-voting polytope ⋮ Random utility models and their applications: Recent developments
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An approval-voting polytope for linear orders
- On certain polytopes associated with graphs
- On the combinatorial structure of the approval-voting polytope
- Anti-blocking polyhedra
- Normal hypergraphs and the perfect graph conjecture
- A random utility model for approval voting
- A decomposition theorem for partially ordered sets
- Combinatorial Optimization
- Lectures on Polytopes
- On the facial structure of set packing polyhedra
- Connectivity of transitive graphs
- Eine Eigenschaft der Atome endlicher Graphen
This page was built for publication: The facets and the symmetries of the approval-voting polytope