Pages that link to "Item:Q996379"
From MaRDI portal
The following pages link to The structure of strategy-proof social choice. I: General characterization and possibility results on median spaces (Q996379):
Displaying 44 items.
- Condorcet domains, median graphs and the single-crossing property (Q2323590) (← links)
- Majority rule in the absence of a majority (Q2324800) (← links)
- Truth-tracking judgment aggregation over interconnected issues (Q2325663) (← links)
- Strategyproof judgment aggregation under partial information (Q2325667) (← links)
- Majority judgment and strategy-proofness: a characterization (Q2329416) (← links)
- Dictatorship versus manipulability (Q2334835) (← links)
- Unanimity in attribute-based preference domains (Q2340261) (← links)
- Efficient and strategy-proof voting rules: A characterization (Q2371154) (← links)
- Parameterized complexity classes beyond para-NP (Q2396719) (← links)
- On single-peaked domains and min-max rules (Q2417386) (← links)
- Strategy-proof aggregation rules and single peakedness in bounded distributive lattices (Q2417403) (← links)
- Random mechanism design on multidimensional domains (Q2419590) (← links)
- Single-crossing, strategic voting and the median choice rule (Q2432496) (← links)
- Community standards (Q2434242) (← links)
- Strategy-proof preference aggregation: possibilities and characterizations (Q2442846) (← links)
- Lifting integrity constraints in binary aggregation (Q2446586) (← links)
- On domains that admit well-behaved strategy-proof social choice functions (Q2447057) (← links)
- Single-peakedness and strategy-proofness of generalized median voter schemes (Q2567906) (← links)
- On the implementation of the median (Q2668985) (← links)
- A taxonomy of non-dictatorial unidimensional domains (Q2681509) (← links)
- Measuring nearly single-peakedness of an electorate: some new insights (Q2695423) (← links)
- Ontology Merging as Social Choice (Q3092301) (← links)
- Introduction to Judgment Aggregation (Q3166990) (← links)
- Plurality solutions on graphs and injective metric spaces (Q3995362) (← links)
- Judgement aggregation in non-classical logics (Q4586224) (← links)
- ON STRATEGY‐PROOFNESS AND THE SALIENCE OF SINGLE‐PEAKEDNESS (Q4634427) (← links)
- Unanimous and Strategy-Proof Probabilistic Rules for Single-Peaked Preference Profiles on Graphs (Q5000656) (← links)
- Preferences in Abstract Convex Structures (Q5132600) (← links)
- The Complexity Landscape of Outcome Determination in Judgment Aggregation (Q5139591) (← links)
- Social Choice Theory (Q5150296) (← links)
- On the Computational Complexity of Non-Dictatorial Aggregation (Q5154769) (← links)
- Solidarity in preference aggregation: improving on a status quo (Q5964690) (← links)
- Convex preferences: an abstract approach (Q6079438) (← links)
- Preference restrictions for simple and strategy-proof rules: local and weakly single-peaked domains (Q6100490) (← links)
- Aggregating Credences into Beliefs: Agenda Conditions for Impossibility Results (Q6118739) (← links)
- New characterizations of strategy-proofness under single-peakedness (Q6120945) (← links)
- Stable outcomes in simple cooperative games (Q6121899) (← links)
- Recognizing single-peaked preferences on an arbitrary graph: complexity and algorithms (Q6124439) (← links)
- Undominated rules with three alternatives in an almost unrestricted domain (Q6168822) (← links)
- Structure of single-peaked preferences (Q6195534) (← links)
- Strategy-proof budgeting via a VCG-like mechanism (Q6546309) (← links)
- Maximal Condorcet domains. A further progress report (Q6565055) (← links)
- Aggregating individual credences into collective binary beliefs: an impossibility result (Q6592877) (← links)
- Collective argumentation: the case of aggregating support-relations of bipolar argumentation frameworks (Q6642568) (← links)
