Decomposing random mechanisms
From MaRDI portal
Publication:898659
DOI10.1016/j.jmateco.2015.06.002zbMath1368.91110OpenAlexW2101358450MaRDI QIDQ898659
Publication date: 18 December 2015
Published in: Journal of Mathematical Economics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmateco.2015.06.002
individual rationalitystrategy-proofnesssingle-peaked preferencestotal unimodularityrandom mechanismsuniversal truthfulness
Related Items (19)
Interdistrict school choice: a theory of student assignment ⋮ Constrained random matching ⋮ Continuity and incentive compatibility in cardinal mechanisms ⋮ On the equivalence of strategy-proofness and upper contour strategy-proofness for randomized social choice functions ⋮ The decomposition of strategy-proof random social choice functions on dichotomous domains ⋮ Strategy-proof stochastic assignment ⋮ Formation of Committees Through Random Voting Rules ⋮ On endowments and indivisibility: partial ownership in the Shapley-Scarf model ⋮ On mechanisms eliciting ordinal preferences ⋮ On strategy-proofness and semilattice single-peakedness ⋮ Probabilistic strategy-proof rules over single-peaked domains ⋮ Foundations of pseudomarkets: Walrasian equilibria for discrete resources ⋮ A unified characterization of the randomized strategy-proof rules ⋮ On random social choice functions with the tops-only property ⋮ Random dictatorship domains ⋮ A characterization of random min-max domains and its applications ⋮ Efficient mixtures of priority rules for assigning objects ⋮ Group strategy-proof probabilistic voting with single-peaked preferences ⋮ Recent Results on Strategy-Proofness of Random Social Choice Functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An extreme point characterization of random strategy-proof social choice functions: the two alternative case
- The structure of strategy-proof random social choice functions over product domains and lexicographically separable preferences
- Strategy-proof probabilistic decision schemes for one-dimensional single-peaked preferences
- Approval voting and strategy analysis: A Venetian example
- Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
- House allocation with existing tenants
- A sufficient condition for the equivalence of strategy-proofness and nonmanipulability by preferences adjacent to the sincere one
- Random dictatorship domains
- Size versus truthfulness in the house allocation problem
- Probabilistic strategy-proof rules over single-peaked domains
- Algorithmic mechanism design (extended abstract)
- When Are Local Incentive Constraints Sufficient?
- Probabilistic Social Choice Based on Simple Voting Comparisons
- The Impossibility of Bayesian Group Decision Making with Separate Aggregation of Beliefs and Values
- Manipulation of Voting Schemes: A General Result
- Manipulation of Schemes that Mix Voting with Chance
- Straightforwardness of Game Forms with Lotteries as Outcomes
- Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
- Strategyproof Assignment by Hierarchical Exchange
- Integer Programming and Arrovian Social Welfare Functions
- A new solution to the random assignment problem.
This page was built for publication: Decomposing random mechanisms
