Description
Each agent is supposed to have a linear ranking on all bundles of items. The agents are queried in a round-robin fashion: each agent, in turn, reports his next bundle in the ranking, going from the best to the worst. After each report, the procedure checks whether it is possible to construct a complete partition of the items based on the reports made so far. If it is possible, then the procedure stops and returns one such partition. If there is more than one partition, then a Pareto-efficient one is returned. The procedure produces "balanced" allocations, that is, allocations which maximize the rank in the preference ordering of the bundle obtained by the worst-off agent.Limitations
The procedure requires the agents to rank bundles of items. This is feasible when the number of items is small, but may be difficult when the number of items is large, since the number of bundles grows exponentially with the number of items. The procedure does not guarantee envy-freeness; see envy-free item assignment for procedures that do guarantee it. However, for two agents, if an envy-free allocation exists, it will be found.Axiomatization
The allocation returned by the Decreasing Demand procedure - the maximin-rank allocation - satisfies certain natural axioms when there are two agents: * Pareto-efficiency; * Anonymity; * Envy-freeness-if-possible; * Monotonicity w.r.t. changes in the preferences (more different preferences means a higher utility).See also
* Undercut procedure and envy-graph procedure - two additional procedures based on the ordinal ranking of bundles.References
{{reflist Fair division protocols