Pages that link to "Item:Q1820991"

The following pages link to Stable matching with preferences derived from a psychological model (Q1820991):

Displaying 37 items.

• The complexity of manipulative attacks in nearly single-peaked electorates (Q490458) (← links)
• Campaign management under approval-driven voting rules (Q513294) (← links)
• A characterization of the single-peaked domain (Q622583) (← links)
• The shield that never was: societies with single-peaked preferences are more open to manipulation and control (Q627120) (← links)
• Recognizing one-dimensional Euclidean preference profiles (Q845009) (← links)
• Geometric stable roommates (Q976079) (← links)
• Recognizing single-peaked preferences on a tree (Q1122456) (← links)
• Linear programming brings marital bliss (Q1122480) (← links)
• A maximum \(b\)-matching problem arising from median location models with applications to the roommates problem (Q1380926) (← links)
• On the existence of stable roommate matchings (Q1592723) (← links)
• Allocating group housing (Q1638025) (← links)
• Testing a mixture model of single-peaked preferences (Q1642168) (← links)
• On the number of single-peaked narcissistic or single-crossing narcissistic preference profiles (Q1709516) (← links)
• Consistency and its converse for roommate markets (Q2013333) (← links)
• Single peaked domains with tree-shaped spectra (Q2021339) (← links)
• Structured preferences: a literature survey (Q2096158) (← links)
• Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters (Q2105427) (← links)
• Pareto rationalizability by two single-peaked preferences (Q2153911) (← links)
• A characterization of the single-peaked single-crossing domain (Q2179455) (← links)
• Subjective homophily and the fixtures problem (Q2221249) (← links)
• Combinatorial voter control in elections (Q2346381) (← links)
• The one-dimensional Euclidean domain: finitely many obstructions are not enough (Q2397665) (← links)
• Subquadratic algorithms for succinct stable matching (Q2415371) (← links)
• The complexity of fully proportional representation for single-crossing electorates (Q2513672) (← links)
• Are there any nicely structured preference profiles nearby? (Q2634484) (← links)
• Measuring nearly single-peakedness of an electorate: some new insights (Q2695423) (← links)
• (Q5015388) (← links)
• Preferences Single-Peaked on a Tree: Multiwinner Elections and Structural Results (Q5026258) (← links)
• On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization) (Q5062116) (← links)
• Exact algorithms for weighted and unweighted Borda manipulation problems (Q5964076) (← links)
• Recognizing single-peaked preferences on an arbitrary graph: complexity and algorithms (Q6124439) (← links)
• Structure of single-peaked preferences (Q6195534) (← links)
• Popularity on the roommate diversity problem (Q6606193) (← links)
• Recovering single-crossing preferences from approval ballots (Q6609139) (← links)
• Revealed preference domains from random choice (Q6634123) (← links)
• Strategic voting and strategic candidacy (Q6637499) (← links)
• Popularity on the roommate diversity problem (Q6652435) (← links)