This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "Balance" apportionment – news · newspapers · books · scholar · JSTOR (December 2021) (Learn how and when to remove this message)

Balance^[1]: 144 or balancedness^[2]: 75 is a property of apportionment methods, which are methods of allocating identical items between among agens, such as dividing seats in a parliament among political parties or federal states. The property says that, if two agents have exactly the same entitlements, then the number of items they receive should differ by at most one. So if two parties win the same number of votes, or two states have the same populations, then the number of seats they receive should differ by at most one.

Ideally, agents with identical entitlements should receive an identical number of items, but this may be impossible due to the indivisibility of the items. Balancedness requires that the difference between identical-entitlement agents should be the smallest difference allowed by the indivisibility, which is 1. For example, if there are 2 equal-entitlement agents and 9 items, then the allocations (4,5) and (5,4) are both allowed, but the allocations (3,6) or (6,3) are not - a difference of 3 is not justified even by indivisibility.

There is a resource to allocate, denoted by ${\displaystyle h}$. For example, it can be an integer representing the number of seats in a house of representatives. The resource should be allocated between some ${\displaystyle n}$ agents, such as states or parties. The agents have different entitlements, denoted by a vector ${\displaystyle t_{1},\ldots ,t_{n}}$. For example, t_i can be the fraction of votes won by party i. An allocation is a vector ${\displaystyle a_{1},\ldots ,a_{n}}$ with ${\displaystyle \sum _{i=1}^{n}a_{i}=h}$. An allocation rule is a rule that, for any ${\displaystyle h}$ and entitlement vector ${\displaystyle t_{1},\ldots ,t_{n}}$, returns an allocation vector ${\displaystyle a_{1},\ldots ,a_{n}}$.

An allocation rule is called balanced if ${\displaystyle t_{i}=t_{j}}$ implies ${\displaystyle |a_{i}-a_{j}|\leq 1}$ for all i,j. Equivalently, ${\displaystyle t_{i}=t_{j}}$ implies ${\displaystyle a_{i}\geq a_{j}-1}$ for all i,j.

All known apportionment methods are balanced. In particular, both Highest averages methods and Largest remainder methods are balanced.

Every apportionment method that is anonymous, exact and coherent, is also balanced.^{[3][4]: Lem.2.1, p.7 [5]: 112}