The Division Problem with Single-Peaked Preferences: A Characterization of the Uniform Allocation Rule
From MaRDI portal
Publication:5753712
DOI10.2307/2938268zbMath0721.90012OpenAlexW2078793241MaRDI QIDQ5753712
Publication date: 1991
Published in: Econometrica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2938268
efficiencystrategy-proofnessdivision problemsharing rulesperfectly divisible commoditysingle- peaked preferences
Related Items (only showing first 100 items - show all)
The replacement principle in networked economies with single-peaked preferences ⋮ Introduction to the special issue in honor of William Thomson ⋮ Efficient, fair, and strategy-proof (re)allocation under network constraints ⋮ A graph theoretic approach to the slot allocation problem ⋮ Incentive-compatible simple mechanisms ⋮ A graph-based approach to inequality assessment ⋮ Sharing sequential values in a network ⋮ A simple characterization of the uniform rule ⋮ Single-peaked choice ⋮ Coalitionally strategy-proof rules in allotment economies with homogeneous indivisible goods ⋮ Top dominance and the possibility of strategy-proof stable solutions to matching problems ⋮ Probabilistic fixed ballot rules and hybrid domains ⋮ Secure implementation in allotment economies ⋮ Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems ⋮ Fairness in group identification ⋮ The crawler: three equivalence results for object (re)allocation problems when preferences are single-peaked ⋮ A preference-based, multi-unit auction for pricing and capacity allocation ⋮ Strategy-proof allotment rules ⋮ Voting under constraints ⋮ The replacement principle in economies with single-peaked preferences ⋮ On recursive solutions to simple allocation problems ⋮ Strategy-proofness and ``median voters ⋮ Two characterizations of the uniform rule for division problems with single-peaked preferences ⋮ A maximal domain for the existence of strategy-proof rules ⋮ Implementing efficient graphs in connection networks ⋮ Arrow on domain conditions: a fruitful road to travel ⋮ One-sided population monotonicity, separability, and the uniform rule ⋮ Fairness and efficiency in cake-cutting with single-peaked preferences ⋮ Resource allocation mechanisms based on strategy-proof symmetrical anonymous voting procedures with delegation ⋮ Groupstrategyproofness of the egalitarian mechanism for constrained rationing problems ⋮ Conditions for incentive compatibility in models with multidimensional allocation functions and one-dimensional types ⋮ Routing-proofness in congestion-prone networks ⋮ Two derivations of the uniform rule and an application to bankruptcy ⋮ Strategy-proof division of a private good when preferences are single-dipped ⋮ The uniform rule with several commodities: a generalization of Sprumont's characterization ⋮ Nash implementation in exchange economies with single-peaked preferences ⋮ Stable partitions in many division problems: the proportional and the sequential dictator solutions ⋮ Strategic behavior in regressions: an experimental study ⋮ A new approach for bounding awards in bankruptcy problems ⋮ Multidimensional mechanism design in single peaked type spaces ⋮ Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: a survey. ⋮ The separability principle in single-peaked economies with participation constraints ⋮ Strategy-proof assignment of multiple resources ⋮ Bribe-proofness for single-peaked preferences: characterizations and maximality-of-domains results ⋮ Two necessary conditions for strategy-proofness: on what domains are they also sufficient? ⋮ A common ground for resource and welfare egalitarianism ⋮ The division problem with voluntary participation ⋮ Characterizing Vickrey allocation rule by anonymity ⋮ Strategy-proofness, tops-only, and the uniform rule ⋮ A revealed preference analysis of solutions to simple allocation problems ⋮ Filling a multicolor urn: An axiomatic analysis. ⋮ A revelation principle for obviously strategy-proof implementation ⋮ A characterization of the uniform rule based on new robustness properties ⋮ Representing a sequential allotment rule in the form of a strategy-proof mechanism of multicriteria active expertise ⋮ Sharing a resource with concave benefits ⋮ Allocation rules on networks ⋮ Assigning agents to a line ⋮ Fair reallocation in economies with single-peaked preferences ⋮ Equal-quantile rules in resource allocation with uncertain needs ⋮ Distributional properties of the uniform rule in economies with single-peaked preferences ⋮ An alternative characterization of the equal-distance rule for allocation problems with single-peaked preferences ⋮ Indifference and the uniform rule ⋮ A note on strategyproofness in Edgeworth-Box economies ⋮ Incentive compatibility and strategy-proofness of mechanisms of organizational behavior control: retrospective, state of the art, and prospects of theoretical research ⋮ Proportional rules for state contingent claims ⋮ Flexible majority rules in democracyville: a guided tour ⋮ Local incentive compatibility with transfers ⋮ On random social choice functions with the tops-only property ⋮ Pareto optimality, anonymity, and strategy-proofness in location problems ⋮ A mechanism design approach to allocating central government funds among regional development agencies ⋮ The positive consequence of strategic manipulation in indivisible good allocation ⋮ Continuous selections from the Pareto correspondence and non-manipulability in exchange economies ⋮ Maximal domain of preferences in the division problem ⋮ Implementation of solutions to the problem of fair division when preferences are single-peaked ⋮ Preference revelation games and strong cores of allocation problems with indivisibilities ⋮ Up methods in the allocation of indivisibilities when preferences are single-peaked ⋮ Dominance of truthtelling and the lattice structure of Nash equilibria ⋮ Uniform trade rules for uncleared markets ⋮ Strategy-proof group selection under single-peaked preferences over group size ⋮ Population-monotonic solutions to the problem of fair division when preferences are single-peaked ⋮ Strategy-proof voting on compact ranges ⋮ When too little is as good as nothing at all: rationing a disposable good among satiable people with acceptance thresholds ⋮ Consistency and its converse: an introduction ⋮ Rationing a commodity along fixed paths ⋮ Allocating multiple estates among agents with single-peaked preferences ⋮ Influence in private-goods allocation ⋮ Efficiency and income redistribution in the single-peaked preferences model with several commodities ⋮ Strategy-proof multi-object mechanism design: ex-post revenue maximization with non-quasilinear preferences ⋮ The permissible and the forbidden ⋮ Cheating by groups and cheating over time in surplus sharing problems ⋮ Shared irrigation costs: An empirical and axiomatic analysis ⋮ Nash implementation and double implementation: Equivalence theorems ⋮ A simple and procedurally fair game form for Nash implementation of the No-envy solution ⋮ The replacement principle in public good economies with single-peaked preferences ⋮ The division problem under constraints ⋮ Design and analysis of multi-hospital kidney exchange mechanisms using random graphs ⋮ Single-peaked preferences, endowments and population-monotonicity. ⋮ On fixed-path rationing methods. ⋮ Implementation by self-relevant mechanisms: Applications. ⋮ Parametric rationing methods
This page was built for publication: The Division Problem with Single-Peaked Preferences: A Characterization of the Uniform Allocation Rule