Pages that link to "Item:Q2485952"

The following pages link to Collective choice under dichotomous preferences (Q2485952):

Displaying 43 items.

• Aggregation of binary evaluations: a Borda-like approach (Q258936) (← links)
• Power set extensions of dichotomous preferences (Q325026) (← links)
• Random aggregation without the Pareto principle (Q427548) (← links)
• An extreme point characterization of random strategy-proof social choice functions: the two alternative case (Q433712) (← links)
• Allocating chances of success in finite and infinite societies: the utilitarian criterion (Q451060) (← links)
• Collectively rational voting rules for simple preferences (Q553521) (← links)
• The structure of strategy-proof random social choice functions over product domains and lexicographically separable preferences (Q690970) (← links)
• Universal Pareto dominance and welfare for plausible utility functions (Q745015) (← links)
• Truthful fair division without free disposal (Q826615) (← links)
• Approval voting on dichotomous preferences (Q866924) (← links)
• Scoring rules on dichotomous preferences (Q930485) (← links)
• Strategy-proof social choice with exogenous indifference classes (Q1005762) (← links)
• Fully sincere voting (Q1036599) (← links)
• On the tradeoff between efficiency and strategyproofness (Q1651219) (← links)
• The impossibility of extending random dictatorship to weak preferences (Q1668159) (← links)
• The decomposition of strategy-proof random social choice functions on dichotomous domains (Q1680094) (← links)
• Evaluationwise strategy-proofness (Q1682726) (← links)
• Strategy-proofness of scoring allocation correspondences for indivisible goods (Q1707112) (← links)
• Pareto efficient combinatorial auctions: dichotomous preferences without quasilinearity (Q1995288) (← links)
• Truthful aggregation of budget proposals (Q2025032) (← links)
• Group strategy-proof probabilistic voting with single-peaked preferences (Q2092786) (← links)
• Defense coordination in security games: equilibrium analysis and mechanism design (Q2093398) (← links)
• Approval voting under dichotomous preferences: a catalogue of characterizations (Q2095260) (← links)
• Structured preferences: a literature survey (Q2096158) (← links)
• Approximating Nash social welfare under binary XOS and binary subadditive valuations (Q2152132) (← links)
• Multi-unit assignment under dichotomous preferences (Q2173167) (← links)
• Democratic fair allocation of indivisible goods (Q2289012) (← links)
• Matching with partners and projects (Q2334133) (← links)
• Fair sharing under dichotomous preferences (Q2343801) (← links)
• The computational complexity of random serial dictatorship (Q2453028) (← links)
• Strategy-proofness of the randomized Condorcet voting system (Q2628714) (← links)
• Funding public projects: a case for the Nash product rule (Q2668980) (← links)
• Strategyproof social choice when preferences and outcomes may contain ties (Q2673159) (← links)
• The vigilant eating rule: a general approach for probabilistic economic design with constraints (Q2675446) (← links)
• Portioning using ordinal preferences: fairness and efficiency (Q2680774) (← links)
• A characterization of maximum Nash welfare for indivisible goods (Q2681826) (← links)
• Collective Choice for Simple Preferences (Q2829677) (← links)
• Axiomatizations of Approval Voting (Q2829678) (← links)
• On the Indecisiveness of Kelly-Strategyproof Social Choice Functions (Q5076342) (← links)
• A theory of measuring, electing, and ranking (Q5385912) (← links)
• On reaching social consent (Q6146457) (← links)
• Envy-free matchings in bipartite graphs and their applications to fair division (Q6154777) (← links)
• Approval-based apportionment (Q6201936) (← links)