The facets and the symmetries of the approval-voting polytope
DOI10.1016/J.JCTB.2004.04.001zbMATH Open1060.52005OpenAlexW2036922239MaRDI QIDQ1880786FDOQ1880786
Authors: Jean-Paul Doignon, Samuel Fiorini 
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
Recommendations
- An approval-voting polytope for linear orders
- On the combinatorial structure of the approval-voting polytope
- Binary choice, subset choice, random utility, and ranking: a unified perspective using the permutahedron
- Combinatoric and geometric aspects of some probabilistic choice models -- a review
- Characterizing approval voting
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorics of partially ordered sets (06A07) Symmetry properties of polytopes (52B15)
Cites Work
- Title not available (Why is that?)
- Lectures on Polytopes
- Title not available (Why is that?)
- Normal hypergraphs and the perfect graph conjecture
- On certain polytopes associated with graphs
- On the facial structure of set packing polyhedra
- Title not available (Why is that?)
- A decomposition theorem for partially ordered sets
- Combinatorial optimization. Packing and covering
- Connectivity of transitive graphs
- Anti-blocking polyhedra
- An approval-voting polytope for linear orders
- A random utility model for approval voting
- Title not available (Why is that?)
- Title not available (Why is that?)
- Eine Eigenschaft der Atome endlicher Graphen
- Title not available (Why is that?)
- On the combinatorial structure of the approval-voting polytope
- Title not available (Why is that?)
Cited In (9)
- Random utility models and their applications: Recent developments
- \textsc{QTest} 2.1: quantitative testing of theories of binary choice using Bayesian inference
- A lexicographic semiorder polytope and probabilistic representations of choice
- Title not available (Why is that?)
- An approval-voting polytope for linear orders
- Convex decompositions
- Binary choice, subset choice, random utility, and ranking: a unified perspective using the permutahedron
- The repeated insertion model for rankings: missing link between two subset choice models
- On the combinatorial structure of the approval-voting polytope
This page was built for publication: The facets and the symmetries of the approval-voting polytope
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1880786)
