Structured preferences: a literature survey
From MaRDI portal
Publication:2096158
DOI10.1134/S0005117922090016zbMath1501.91054OpenAlexW4313149530MaRDI QIDQ2096158
Publication date: 16 November 2022
Published in: Automation and Remote Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0005117922090016
Research exposition (monographs, survey articles) pertaining to game theory, economics, and finance (91-02) Group preferences (91B10) Individual preferences (91B08) Matching models (91B68)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computational complexity of manipulation: a survey
- Condorcet domains of tiling type
- Enumeration of \((0.1)\)-matrices avoiding some \(2 \times 2\) matrices
- The complexity of manipulative attacks in nearly single-peaked electorates
- Independence of clones as a criterion for voting rules
- A characterization of the single-peaked domain
- The shield that never was: societies with single-peaked preferences are more open to manipulation and control
- Patterns in permutations and words.
- Strategic party formation on a circle and Duverger's law
- A necessary and sufficient single-profile condition for transitivity of the majority rule relation
- Circular domains
- The likelihood of single-peaked preferences under classic and new probability distribution assumptions
- Recognizing one-dimensional Euclidean preference profiles
- Dictatorial domains in preference aggregation
- The structure of strategy-proof social choice. I: General characterization and possibility results on median spaces
- On the number of reduced decompositions of elements of Coxeter groups
- Recognizing single-peaked preferences on a tree
- Single-peaked orders on a tree
- Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Finding sharper distinctions for conditions of transitivity of the majority method.
- Arrovian aggregation models
- A simple characterization of majority rule
- On the uniqueness of stable marriage matchings
- Another characterization of the majority rule.
- Dictatorship on top-circular domains
- On the likelihood of single-peaked preferences
- On the number of single-peaked narcissistic or single-crossing narcissistic preference profiles
- A necessary and sufficient condition for uniqueness consistency in the stable marriage matching problem
- The single-peaked domain revisited: a simple global characterization
- Stable matching with preferences derived from a psychological model
- Special domains and nonmanipulability
- A new characterization of the majority rule
- Maximal Condorcet domains
- Cambrian acyclic domains: counting \(c\)-singletons
- A characterization of preference domains that are single-crossing and maximal Condorcet
- Small one-dimensional Euclidean preference profiles
- Recognizing single-peaked preferences on an arbitrary graph: complexity and algorithms
- Random assignments on sequentially dichotomous domains
- A characterization of the single-peaked single-crossing domain
- Majority rule on rhombus tilings and Condorcet super-domains
- Towards a classification of maximal peak-pit Condorcet domains
- Parameterized complexity of voter control in multi-peaked elections
- Condorcet domains, median graphs and the single-crossing property
- Condorcet domains satisfying Arrow's single-peakedness
- Random assignments on preference domains with a tier structure
- Fair sharing under dichotomous preferences
- Acyclic sets of linear orders
- The one-dimensional Euclidean domain: finitely many obstructions are not enough
- Justified representation in approval-based committee voting
- The control complexity of \(r\)-Approval: from the single-peaked case to the general case
- Single-peaked compatible preference profiles: Some combinatorial results
- A characterization of the single-crossing domain
- Acyclic sets of linear orders via the Bruhat orders
- Collective choice under dichotomous preferences
- The complexity of fully proportional representation for single-crossing electorates
- A structure theorem for the consecutive 1's property
- Are there any nicely structured preference profiles nearby?
- Recognizing 1-Euclidean Preferences: An Alternative Approach
- Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates
- Computational Aspects of Nearly Single-Peaked Electorates
- A Faster Algorithm for Finding Minimum Tucker Submatrices
- Manipulation of Voting Schemes: A General Result
- Incomplete Directed Perfect Phylogeny
- Circularly Compatible Ones, $D$-Circularity, and Proper Circular-Arc Bigraphs
- Preferences Single-Peaked on a Tree: Multiwinner Elections and Structural Results
- Enhancing the connections between patterns in permutations and forbidden configurations in restricted elections
- Incomplete Preferences in Single-Peaked Electorates
- Preferences Single-Peaked on a Circle
- Random Matching Under Dichotomous Preferences
- Condorcet’s Paradox
- A Possibility Theorem on Majority Decisions
- The Simple Majority Decision Rule
- An Exploration in the Theory of Optimum Income Taxation
- A Set of Independent Necessary and Sufficient Conditions for Simple Majority Decision
- College Admissions and the Stability of Marriage
This page was built for publication: Structured preferences: a literature survey
