An approval-voting polytope for linear orders
From MaRDI portal
Publication:1368384
DOI10.1006/jmps.1997.1155zbMath0892.90044OpenAlexW2094743151WikidataQ52262810 ScholiaQ52262810MaRDI QIDQ1368384
Jean-Paul Doignon, Michel Regenwetter
Publication date: 3 August 1998
Published in: Journal of Mathematical Psychology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jmps.1997.1155
Related Items (max. 100)
Binary choice, subset choice, random utility, and ranking: a unified perspective using the permutahedron ⋮ The facets and the symmetries of the approval-voting polytope ⋮ A lexicographic semiorder polytope and probabilistic representations of choice ⋮ The Polytope ofm-Subspaces of a Finite Affine Space ⋮ The repeated insertion model for rankings: missing link between two subset choice models ⋮ The biorder polytope ⋮ Determining the automorphism group of the linear ordering polytope ⋮ Regular choice systems: a general technique to represent them by random variables ⋮ Good Clusterings Have Large Volume ⋮ The choice probabilities of the latent-scale model satisfy the size-independent model when \(n\) is small. ⋮ Signed orders, choice probabilities, and linear polytopes ⋮ Random relations, random utilities, and random functions ⋮ On the combinatorial structure of the approval-voting polytope ⋮ Random utility models and their applications: Recent developments ⋮ On the model dependence of majority preference relations reconstructed from ballot or survey data
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Induced binary probabilities and the linear ordering polytope: A status report
- Geometric and combinatorial properties of the polytope of binary choice probabilities
- Parallel concepts in graph theory
- Random utility representation of binary choice probabilities: Critical graphs yielding critical necessary conditions
- On the irredundant generation of knowledge spaces
- Choosing subsets: a size-independent probabilistic model and the quest for a social welfare ordering
- A random utility model for approval voting
- Random utility representations of finite \(m\)-ary relations
- Approval Voting, Borda Winners, and Condorcet Winners: Evidence from Seven Elections
- A Polynomial Time Algorithm for Unidimensional Unfolding Representations
- Lectures on Polytopes
- A Possibility Theorem on Majority Decisions
This page was built for publication: An approval-voting polytope for linear orders
