The following pages link to Decomposing random mechanisms (Q898659):
Displaying 19 items.
- Strategy-proof stochastic assignment (Q402069) (← links)
- The decomposition of strategy-proof random social choice functions on dichotomous domains (Q1680094) (← links)
- On random social choice functions with the tops-only property (Q1753301) (← links)
- Random dictatorship domains (Q2016232) (← links)
- Efficient mixtures of priority rules for assigning objects (Q2078057) (← links)
- Group strategy-proof probabilistic voting with single-peaked preferences (Q2092786) (← links)
- Interdistrict school choice: a theory of student assignment (Q2138086) (← links)
- Constrained random matching (Q2155237) (← links)
- Continuity and incentive compatibility in cardinal mechanisms (Q2178581) (← links)
- On endowments and indivisibility: partial ownership in the Shapley-Scarf model (Q2205990) (← links)
- On strategy-proofness and semilattice single-peakedness (Q2212751) (← links)
- Foundations of pseudomarkets: Walrasian equilibria for discrete resources (Q2231384) (← links)
- A unified characterization of the randomized strategy-proof rules (Q2231399) (← links)
- A characterization of random min-max domains and its applications (Q2305047) (← links)
- Probabilistic strategy-proof rules over single-peaked domains (Q2452222) (← links)
- On the equivalence of strategy-proofness and upper contour strategy-proofness for randomized social choice functions (Q2668984) (← links)
- On mechanisms eliciting ordinal preferences (Q4612470) (← links)
- Recent Results on Strategy-Proofness of Random Social Choice Functions (Q5022149) (← links)
- Formation of Committees Through Random Voting Rules (Q5111109) (← links)
