A Polynomial Time Algorithm for Unidimensional Unfolding Representations
From MaRDI portal
Publication:4285910
DOI10.1006/jagm.1994.1010zbMath0797.68081OpenAlexW2004142419MaRDI QIDQ4285910
Jean-Paul Doignon, Jean-Claude Falmagne
Publication date: 22 March 1994
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1994.1010
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Combinatorics of partially ordered sets (06A07) Voting theory (91B12)
Related Items (23)
Are there any nicely structured preference profiles nearby? ⋮ Weighted majority tournaments and Kemeny ranking with 2-dimensional Euclidean preferences ⋮ Testing a mixture model of single-peaked preferences ⋮ Well-graded families of relations ⋮ An approval-voting polytope for linear orders ⋮ The one-dimensional Euclidean domain: finitely many obstructions are not enough ⋮ A characterization of the single-peaked single-crossing domain ⋮ Multidimensional Manhattan preferences ⋮ The shield that never was: societies with single-peaked preferences are more open to manipulation and control ⋮ Structure of single-peaked preferences ⋮ Measuring nearly single-peakedness of an electorate: some new insights ⋮ Computing kemeny rankings from \(d\)-Euclidean preferences ⋮ Unnamed Item ⋮ On the number of single-peaked narcissistic or single-crossing narcissistic preference profiles ⋮ The complexity of manipulative attacks in nearly single-peaked electorates ⋮ Campaign management under approval-driven voting rules ⋮ Recognizing single-peaked preferences on an arbitrary graph: complexity and algorithms ⋮ Exact algorithms for weighted and unweighted Borda manipulation problems ⋮ Small one-dimensional Euclidean preference profiles ⋮ Omnipotence in stretchable two-dimensional scaling ⋮ Parameterized complexity of voter control in multi-peaked elections ⋮ Preferences Single-Peaked on a Tree: Multiwinner Elections and Structural Results ⋮ On the combinatorial structure of the approval-voting polytope
This page was built for publication: A Polynomial Time Algorithm for Unidimensional Unfolding Representations
