Binary choice, subset choice, random utility, and ranking: a unified perspective using the permutahedron
From MaRDI portal
Publication:1877595
DOI10.1016/j.jmp.2003.12.002zbMath1097.91509OpenAlexW2140340330MaRDI QIDQ1877595
Publication date: 19 August 2004
Published in: Journal of Mathematical Psychology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmp.2003.12.002
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Utility theory (91B16) Combinatorial probability (60C05)
Related Items
Statistical ranking and combinatorial Hodge theory, Geometric representation of association between categories, Learning intransitive reciprocal relations with kernel methods, Extreme points of the credal sets generated by comparative probabilities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Random utility representation of binary choice probabilities: A new class of necessary conditions
- The Borda dictionary
- Necessary and sufficient conditions for a resolution of the social choice paradox
- Asymptotic theory for measures of concordance with special reference to average Kendall tau
- Intergroup diversity and concordance for ranking data: An approach via metrics for permutations
- Social choice and the topology of spaces of preferences
- Probability models on rankings
- A selective review of recent characterizations of stochastic choice models using distribution and functional equation techniques
- Induced binary probabilities and the linear ordering polytope: A status report
- Geometric and combinatorial properties of the polytope of binary choice probabilities
- Millions of election outcomes from a single profile
- Fiber polytopes
- Probability models and statistical analyses for ranking data. Papers presented at the AMS-IMS-SIAM conference, Amherst, MA, USA, June 1990
- Convex polyhedra of doubly stochastic matrices. II: Graph of Omega sub(n)
- Convex polyhedra of doubly stochastic matrices. IV
- Convex polyhedra of doubly stochastic matrices. I: Applications of the permanent function
- Convex polyhedra of doubly stochastic matrices III. Affine and combinatorial properties of \(\Omega\)
- Means on ordered sets
- Unifying impossibility theorems: A topological approach
- Copeland method. II: Manipulation, monotonicity, and paradoxes
- Social choice and resource allocation: a topological perspective
- An approval-voting polytope for linear orders
- Aggregation of utility and social choice: a topological characterization.
- Topological social choice
- Random relations, random utilities, and random functions
- On the combinatorial structure of the approval-voting polytope
- A general concept of majority rule
- The facets and the symmetries of the approval-voting polytope
- Random utility representation of binary choice probabilities: Critical graphs yielding critical necessary conditions
- The Copeland method. I: Relationships and the dictionary
- On isotopic dictators and homological manipulators
- Choosing subsets: a size-independent probabilistic model and the quest for a social welfare ordering
- A random utility model for approval voting
- Approval Voting, Borda Winners, and Condorcet Winners: Evidence from Seven Elections
- On the Assignment Polytope
- NON-NULL RANKING MODELS. I
- A Data Envelopment Model for Aggregating Preference Rankings
- On the Borda-Kendall Consensus Method for Priority Ranking Problems
- Adjacent Vertices on a Permutohedron
- Lectures on Polytopes
- Social Choice Scoring Functions
- New Facets of the Linear Ordering Polytope
- On Zonotopes
- Permutation Polyhedra
- An Inequality
