Manipulation of Schemes that Mix Voting with Chance

From MaRDI portal
Publication:4140621

DOI10.2307/1911681zbMath0365.90006OpenAlexW3124207685MaRDI QIDQ4140621

Allan F. Gibbard

Publication date: 1977

Published in: Econometrica (Search for Journal in Brave)

Full work available at URL: http://www.kellogg.northwestern.edu/research/math/papers/175.pdf



Related Items

Manipulation of k-Approval Under De Re Knowledge, On the Indecisiveness of Kelly-Strategyproof Social Choice Functions, Vote swapping in irresolute two-tier voting procedures, On guarantees, vetoes, and random dictators, Characterizing the top cycle via strategyproofness, Uniform random dictatorship: a characterization without strategy-proofness, Committee formation under constraints through randomized voting rules on separable domains, The structure of (local) ordinal Bayesian incentive compatible random rules, Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship, Incentives in social decision schemes with pairwise comparison preferences, Formation of Committees Through Random Voting Rules, Ordinal Bayesian incentive compatibility in random assignment model, Mechanism design by observant and informed planners, Irresolute mechanism design: a new path to possibility, Truthful ownership transfer with expert advice, Another direct proof of the Gibbard-Satterthwaite theorem, Unnamed Item, A new perspective on implementation by voting trees, Incentive properties for ordinal mechanisms, Social Choice Theory, Recent Results on Strategy-Proofness of Random Social Choice Functions, Implementation in stochastic dominance Nash equilibria, Strategic candidacy for multivalued voting procedures, Strategy-proofness of the randomized Condorcet voting system, On the equivalence of coalitional and individual strategy-proofness properties, Probabilistic fixed ballot rules and hybrid domains, Condorcet-consistent and approximately strategyproof tournament rules, Strategy-proof social choice correspondences., A new approach to the implementation problem, Probabilistic assignment: an extension approach, On the tradeoff between efficiency and strategyproofness, Ordinal Bayesian incentive compatible representations of committees, Truthfulness in advertising? Approximation mechanisms for knapsack bidders, Strategy-proof cardinal decision schemes, Strategic manipulations of multi-valued solutions in economies with indivisibilities, The impossibility of extending random dictatorship to weak preferences, Fractional group identification, The structure of decision schemes with cardinal preferences, Continuity and incentive compatibility in cardinal mechanisms, Local global equivalence for unanimous social choice functions, An analytical and experimental comparison of maximal lottery schemes, Local vs. global strategy-proofness: a new equivalence result for ordinal 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, Impossibilities for strategy-proof committee selection mechanisms with vetoers, Strategyproof social choice when preferences and outcomes may contain ties, Manipulability of consular election rules, Manipulation and the Pareto rule, Comparing multiagent systems research in combinatorial auctions and voting, Random mechanism design on multidimensional domains, False-name-proof voting with costs over two alternatives, Randomized preference aggregation: Additivity of power and strategy proofness, Portioning using ordinal preferences: fairness and efficiency, Decomposing random mechanisms, Implementing efficient, anonymous and neutral social choice functions, Double deception: Two against one in three-person games, Set-monotonicity implies Kelly-strategyproofness, Random aggregation without the Pareto principle, Pairwise strategy-proofness and self-enforcing manipulation, Manipulation in elections with uncertain preferences, An extreme point characterization of random strategy-proof social choice functions: the two alternative case, The nonmanipulative vote-deficits of voting rules, On mechanisms eliciting ordinal preferences, Multivalued social choice functions and strategic manipulation with counterthreats, Threats, counter-threats and strategic manipulation for non-binary group decision rules, Outcomes of admissible Nash equilibria and sophisticated voting when decisions are based on pairwise comparisons, Probabilistic assignment of objects: characterizing the serial rule, Unnamed Item, The capacity constrained facility location problem, Strategy-proof preference aggregation: possibilities and characterizations, Strategic voting under minimally binary group decision functions, Allocation of public funds to R\&D: A portfolio choice-styled decision model and a biotechnology case study, Manipulation can be hard in tractable voting systems even for constant-sized coalitions, Some chance for consensus: voting methods for which consensus is an equilibrium, Probabilistic strategy-proof rules over single-peaked domains, Automated reasoning in social choice theory: some remarks, On the fairness of random procedures, The computational complexity of random serial dictatorship, Maximal domain for strategy-proof probabilistic rules in economies with one public good, Probabilistic assignment of indivisible goods with single-peaked preferences, Parametrized algorithms for random serial dictatorship, Implementation in undominated strategies by bounded mechanisms: the Pareto correspondence and a generalization, A unified characterization of the randomized strategy-proof rules, Truth-revealing voting rules for large populations, A social choice rule and its implementation in perfect equilibrium, An extreme point characterization of strategy-proof and unanimous probabilistic rules over binary restricted domains, On random social choice functions with the tops-only property, Matching with indifferences: a comparison of algorithms in the context of course allocation, The structure of strategy-proof random social choice functions over product domains and lexicographically separable preferences, Implementation in mixed Nash equilibrium, Strategy-proof probabilistic decision schemes for one-dimensional single-peaked preferences, Strategic manipulation in voting games when lotteries and ties are permitted, Collective choice under dichotomous preferences, Consistency in the probabilistic assignment model, Random dictatorship domains, Inefficiencies on linking decisions, Rank-dominant strategy and sincere voting, Towards a general and unified characterization of individual and collective choice functions under fuzzy and nonfuzzy preferences and majority via the ordered weighted average operators, Anonymous voting and minimal manipulability, Allan Gibbard, Preference aggregation with randomized social orderings, The role of ambiguity in manipulating voter behavior, A condition for Nash-stability under binary and democratic group decision functions, House allocation with existing tenants, A characterization of random min-max domains and its applications, Strategy-proof voting on compact ranges, A cardinal approach to straightforward probabilistic mechanisms, Probabilistic, fuzzy and rough concepts in social choice, The (sub-)optimality of the majority rule, Ordinally Bayesian incentive compatible probabilistic voting rules, Efficient mixtures of priority rules for assigning objects, A theory of sticky rents: search and bargaining with incomplete information, What proportion of sincere voters guarantees efficiency?, Non-cooperative implementation: A survey of recent results, Unanimous and Strategy-Proof Probabilistic Rules for Single-Peaked Preference Profiles on Graphs, Strategy-proof probabilistic rules for expected utility maximizers, Group strategy-proof probabilistic voting with single-peaked preferences, Random assignments on preference domains with a tier structure, Limited resoluteness and strategic voting: The case of linear sincere preference orderings, Fair sharing under dichotomous preferences, Strategy-proof probabilistic mechanisms in economies with pure public goods.