On multi-level apportionment

2025-11-11

Theory and Decision

AI Summary

This paper studies multi-level seat allocation under hierarchical population structures, aiming to simultaneously satisfy strengthened upper and lower quota constraints at every level of the hierarchy. Unlike conventional single-level proportional apportionment, we propose the first formal multi-level apportionment framework and rigorously define hierarchical quota conditions. We prove that iteratively applying Adams’ method guarantees the upper quota, Jefferson’s method ensures the lower quota, and the Quota method—introduced here for hierarchical settings—satisfies both simultaneously. This work establishes, for the first time, the fairness-preserving extensibility of classical proportional apportionment methods to hierarchical structures. The results provide a theoretically rigorous and scalable paradigm for real-world applications requiring layered fairness, including political representation, organizational governance, and resource distribution across nested administrative or demographic units.

Technology Category

• Game Theory and Economic Paradigms: Fair Division
• Multiagent Systems: Mechanism Design
• Knowledge Representation and Reasoning: Preferences

Application Category

• Economics, Online Markets and Human Computation: Incentives in network design for Web infrastructures and ecosystems
• Graph Algorithms and Modeling for the Web: Algorithms and analysis for heterogeneous, signed, attributed, multi-relational, temporal, higher-order, and annotated Web-related graphs
• Web Mining and Content Analysis: Robustness and generalizability of Web mining methods

Abstract

Apportionment refers to the well-studied problem of allocating legislative seats among parties or groups with different entitlements. We present a multi-level generalization of apportionment where the groups form a hierarchical structure, which gives rise to stronger versions of the upper and lower quota notions. We show that running Adams’ method level-by-level satisfies upper quota, while running Jefferson’s method or the quota method level-by-level guarantees lower quota. Moreover, we prove that both quota notions can always be fulfilled simultaneously.

Problem

• Generalizing apportionment to hierarchical multi-level structures
• Strengthening upper and lower quota guarantees in allocations
• Proving simultaneous fulfillment of both quota conditions

Innovation

• Multi-level hierarchical generalization of apportionment
• Adams' method level-by-level satisfies upper quota
• Jefferson's method level-by-level guarantees lower quota