An approval-voting polytope for linear orders
From MaRDI portal
Recommendations
- On the combinatorial structure of the approval-voting polytope
- The facets and the symmetries of the approval-voting polytope
- New Facets of the Linear Ordering Polytope
- Facets of the linear ordering polytope
- A note on small linear-ordering polytopes
- Signed orders, choice probabilities, and linear polytopes
- Strong Condorcet criterion for the linear ordering problem
- Axiomatizations of approval voting
- Approximation and parameterized complexity of minimax approval voting
- Linear extension majority cycles on partial orders
Cites work
- scientific article; zbMATH DE number 3163006 (Why is no real title available?)
- scientific article; zbMATH DE number 3854738 (Why is no real title available?)
- scientific article; zbMATH DE number 3261280 (Why is no real title available?)
- A Polynomial Time Algorithm for Unidimensional Unfolding Representations
- A Possibility Theorem on Majority Decisions
- A historical and contemporary perspective on random scale representations of choice probabilities and reaction times in the context of Cohen and Falmagne's (1990, Journal of Mathematical Psychology, 34) results
- A random utility model for approval voting
- Approval voting, Borda winners, and Condorcet winners: evidence from seven elections
- Choosing subsets: a size-independent probabilistic model and the quest for a social welfare ordering
- Geometric and combinatorial properties of the polytope of binary choice probabilities
- Induced binary probabilities and the linear ordering polytope: A status report
- Lectures on Polytopes
- On the irredundant generation of knowledge spaces
- Parallel concepts in graph theory
- Random utility representation of binary choice probabilities: Critical graphs yielding critical necessary conditions
- Random utility representations of finite \(m\)-ary relations
Cited in
(15)- Random utility models and their applications: Recent developments
- On the model dependence of majority preference relations reconstructed from ballot or survey data
- Determining the automorphism group of the linear ordering polytope
- The choice probabilities of the latent-scale model satisfy the size-independent model when \(n\) is small.
- Signed orders, choice probabilities, and linear polytopes
- A lexicographic semiorder polytope and probabilistic representations of choice
- Regular choice systems: a general technique to represent them by random variables
- The polytope of \(m\)-subspaces of a finite affine space
- Random relations, random utilities, and random functions
- The biorder polytope
- The facets and the symmetries of the approval-voting polytope
- Good clusterings have large volume
- 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: An approval-voting polytope for linear orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1368384)
