Signed orders, choice probabilities, and linear polytopes
From MaRDI portal
Publication:1598972
DOI10.1006/jmps.1999.1288zbMath1051.91085OpenAlexW1973971930WikidataQ52068551 ScholiaQ52068551MaRDI QIDQ1598972
Publication date: 2001
Published in: Journal of Mathematical Psychology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jmps.1999.1288
Related Items (3)
Sufficient conditions making lexicographic rules over the power set satisfy extensibility ⋮ Facets of linear signed order polytopes. ⋮ The repeated insertion model for rankings: missing link between two subset choice models
Uses Software
Cites Work
- 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
- Conjointness as a derived property
- Signed orders and power set extensions
- Induced binary probabilities and the linear ordering polytope: A status report
- Mixtures of order matrices and generalized order matrices
- Binary interactions and subset choice
- Probabilistic preferences and topset voting
- Subset preferences in linear and nonlinear utility theory
- More facets from fences for linear ordering and acyclic subgraph polytopes
- Ranking opportunity sets: An axiomatic approach
- An approval-voting polytope for linear orders
- The skeleton of the symmetric Traveling Salesman Polytope
- A necessary but insufficient condition for the stochastic binary choice problem
- Random utility representation of binary choice probabilities: Critical graphs yielding critical necessary conditions
- Facets of the \(k\)-partition polytope
- Continuous extensions of an order on a set to the power set
- A completeness result for extending signed orders
- Preference extension rules for ranking sets of alternatives with a fixed cardinality
- A note on small linear-ordering polytopes
- Choosing subsets: a size-independent probabilistic model and the quest for a social welfare ordering
- A random utility model for approval voting
- Ranking opportunity sets and Arrow impossibility theorems: Correspondence results
- Approval Voting, Borda Winners, and Condorcet Winners: Evidence from Seven Elections
- On the acyclic subgraph polytope
- Facets of the linear ordering polytope
- Facets of the Asymmetric Traveling Salesman Polytope
- The Circuit Polytope: Facets
- Multiattribute signed orders
- Polytopes, graphs, and complexes
- Characterizations of the Dimension for Classes of Concordant Polytopes
This page was built for publication: Signed orders, choice probabilities, and linear polytopes
