The following pages link to Voting by Committees (Q3362064):
Displayed 50 items.
- The blocking lemma and group incentive compatibility for matching with contracts (Q309845) (← links)
- Power set extensions of dichotomous preferences (Q325026) (← links)
- Strategy-proof partitioning (Q380879) (← links)
- Efficient and strategy-proof social choice when preferences are single-dipped (Q403970) (← links)
- Two necessary conditions for strategy-proofness: on what domains are they also sufficient? (Q423715) (← links)
- An extreme point characterization of random strategy-proof social choice functions: the two alternative case (Q433712) (← links)
- Group strategy-proofness and voting between two alternatives (Q433814) (← links)
- Complexities of electing diverse committees (Q483536) (← links)
- Strategy-proofness on restricted separable domains (Q483577) (← links)
- On the operation of multiple matching markets (Q516981) (← links)
- The blocking lemma and strategy-proofness in many-to-many matchings (Q523460) (← links)
- Strategy-proof coalition formation (Q532687) (← links)
- A framework for reasoning under uncertainty based on non-deterministic distance semantics (Q541819) (← links)
- Simplified forms of computerized reasoning with distance semantics (Q545150) (← links)
- On strategy-proofness and symmetric single-peakedness (Q550194) (← links)
- Collectively rational voting rules for simple preferences (Q553521) (← links)
- The blocking lemma for a many-to-one matching model (Q617603) (← links)
- A characterization of the single-peaked domain (Q622583) (← links)
- Generalizing the Gibbard-Satterthwaite theorem: partial preferences, the degree of manipulation, and multi-valuedness (Q647541) (← links)
- Priorities in the location of multiple public facilities (Q665078) (← links)
- The structure of strategy-proof random social choice functions over product domains and lexicographically separable preferences (Q690970) (← links)
- A characterization of the plurality rule (Q694893) (← links)
- Coalitional strategy-proof house allocation (Q697840) (← links)
- Strategic manipulation in voting games when lotteries and ties are permitted (Q697934) (← links)
- Maximal domain of preferences in the division problem (Q700081) (← links)
- Reduction-consistency in collective choice problems (Q855361) (← links)
- Strategy-proof voting on the full preference domain (Q859595) (← links)
- Manipulation via endowments in exchange markets with indivisible goods (Q866940) (← links)
- Strategy-proof social choice on multiple and multi-dimensional single-peaked domains (Q894024) (← links)
- Ranking sets additively in decisional contexts: an axiomatic characterization (Q928756) (← links)
- How to choose a non-controversial list with \(k\) names (Q930481) (← links)
- Scoring rules on dichotomous preferences (Q930485) (← links)
- Abstract Arrowian aggregation (Q969114) (← links)
- Disjunctive merging: quota and Gmin merging operators (Q991021) (← links)
- Efficient and strategy-proof voting over connected coalitions: a possibility result (Q991326) (← links)
- Set choice problems with incomplete information about the preferences of the decision maker (Q992615) (← links)
- On the rule of \(k\) names (Q993784) (← links)
- The structure of strategy-proof social choice. I: General characterization and possibility results on median spaces (Q996379) (← links)
- Strategy-proofness of the plurality rule over restricted domains (Q1014329) (← links)
- Size approval voting (Q1017790) (← links)
- Choosers as extension axioms (Q1036106) (← links)
- Signed orders and power set extensions (Q1183692) (← links)
- Binary interactions and subset choice (Q1268247) (← links)
- Strategy-proof voting on compact ranges (Q1272626) (← links)
- Almost all equilibria in dominant strategies are coalition-proof (Q1275113) (← links)
- Consensus rules for committee elections (Q1296465) (← links)
- Strategy-proof social choice with continuous separable preferences (Q1304442) (← links)
- Top dominance and the possibility of strategy-proof stable solutions to matching problems (Q1341500) (← links)
- Strategy-proof social choice correspondences. (Q1347821) (← links)
- Aggregating ordinal probabilities on finite sets (Q1368879) (← links)