A Polynomial Time Algorithm for Unidimensional Unfolding Representations
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 177223
- A permutation-translation simulated annealing algorithm for \(L_{1}\) and \(L_{2}\) unidimensional scaling
- Least squares metric, unidimensional unfolding
- scientific article; zbMATH DE number 3984365
- GENFOLD 2: A set of models and algorithms for the GENeral unFOLDing analysis of preference/dominance data
Cited in
(30)- Omnipotence in stretchable two-dimensional scaling
- Well-graded families of relations
- An approval-voting polytope for linear orders
- Testing a mixture model of single-peaked preferences
- On the number of single-peaked narcissistic or single-crossing narcissistic preference profiles
- On the combinatorial structure of the approval-voting polytope
- Small one-dimensional Euclidean preference profiles
- Weighted majority tournaments and Kemeny ranking with 2-dimensional Euclidean preferences
- A characterization of the single-peaked single-crossing domain
- Parameterized complexity of voter control in multi-peaked elections
- The one-dimensional Euclidean domain: finitely many obstructions are not enough
- Are there any nicely structured preference profiles nearby?
- Measuring nearly single-peakedness of an electorate: some new insights
- Computing kemeny rankings from d-Euclidean preferences
- scientific article; zbMATH DE number 177223 (Why is no real title available?)
- The complexity of manipulative attacks in nearly single-peaked electorates
- Single-peaked consistency for weak orders is easy
- Preferences single-peaked on a tree: multiwinner elections and structural results
- Campaign management under approval-driven voting rules
- Exact algorithms for weighted and unweighted Borda manipulation problems
- Multidimensional Manhattan preferences
- Recognizing single-peaked preferences on an arbitrary graph: complexity and algorithms
- Structure of single-peaked preferences
- The shield that never was: societies with single-peaked preferences are more open to manipulation and control
- Recovering single-crossing preferences from approval ballots
- Euclidean preferences in the plane under \(\ell_1,\ell_2\) and \(\ell_\infty\) norms
- Revealed preference domains from random choice
- Jérôme Lang's contributions at the interface of economic theory with artificial intelligence
- Stable marriage with multi-modal preferences
- Geometric realizations of dichotomous ordinal graphs
This page was built for publication: A Polynomial Time Algorithm for Unidimensional Unfolding Representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4285910)
