Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Straightforwardness of Game Forms with Lotteries as Outcomes - MaRDI portal

Straightforwardness of Game Forms with Lotteries as Outcomes

From MaRDI portal
Publication:4147899

DOI10.2307/1914235zbMath0371.90128OpenAlexW2079761526MaRDI QIDQ4147899

Allan F. Gibbard

Publication date: 1978

Published in: Econometrica (Search for Journal in Brave)

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



Related Items

Strategic behaviour and a notion of ex ante efficiency in a voting model, Strategy-proofness of the randomized Condorcet voting system, Strategy-proof cardinal decision schemes, Threshold voting leads to type-revelation, The structure of decision schemes with cardinal preferences, Manipulation and the Pareto rule, False-name-proof voting with costs over two alternatives, Decomposing random mechanisms, Set-monotonicity implies Kelly-strategyproofness, Truthful ownership transfer with expert advice, Threats, counter-threats and strategic manipulation for non-binary group decision rules, Probabilistic assignment problem with multi-unit demands: a generalization of the serial rule and its characterization, Manipulation can be hard in tractable voting systems even for constant-sized coalitions, A social choice rule and its implementation in perfect equilibrium, Strategy-proof probabilistic decision schemes for one-dimensional single-peaked preferences, Collective choice under dichotomous preferences, Consistency in the probabilistic assignment model, Ordinal versus cardinal voting rules: a mechanism design approach, On a conjecture by Gale about one-sided matching problems, Incompatibility of efficiency and strategyproofness in the random assignment setting with indifferences, A new solution to the random assignment problem., Anonymous voting and minimal manipulability, A cardinal approach to straightforward probabilistic mechanisms, Fully sincere voting, Non-cooperative implementation: A survey of recent results, Strategy-proof probabilistic rules for expected utility maximizers, Social Choice Theory, Limited resoluteness and strategic voting: The case of linear sincere preference orderings, Strategy-proof probabilistic mechanisms in economies with pure public goods.