Valuation Is Not the Deal

The Limits of Aggregation: Arrow’s Impossibility Theorem

In 1951, Kenneth Arrow formalized a problem that had been implicit in economics and political theory for decades. When multiple individuals hold different preferences over a set of alternatives, is it possible to construct a rule that converts those preferences into a single, consistent decision for the group? The question appears technical at first glance, but it sits at the center of how committees decide, how institutions allocate resources, and how markets coordinate outcomes across participants with conflicting objectives.

Arrow approached the problem with precision. Each individual is assumed to have a complete ranking over a set of alternatives. A decision rule, or social welfare function, takes those individual rankings and produces a collective ordering. Formally, the problem can be written as a function that takes individual preference orderings and produces a collective ranking:

F(P₁, P₂, …, P_##INLINE4##) = P

where each P_##INLINE7## represents the entire preference ordering of individual i, and P is the resulting group ordering. The ambition was modest in appearance: define a rule that respects a small set of conditions that most people would consider reasonable. If every participant prefers one alternative over another, the collective decision should reflect that agreement. The ranking between two alternatives should not depend on irrelevant third options. And no single participant should determine the outcome regardless of everyone else’s preferences.

Each of these conditions is intuitive on its own. Together they resemble the minimal structure of a fair decision system. Arrow proved that once the number of alternatives reaches three, no rule can satisfy all of them simultaneously. Any mechanism that aggregates preferences must violate at least one of these conditions. The limitation does not arise from poor design or insufficient information. It is embedded in the structure of the problem itself. The moment different participants rank outcomes differently, the system cannot produce a collective decision that preserves every property we would like it to have.

The result reshaped welfare economics because it replaced a search for the correct decision rule with a recognition that no such rule exists under those constraints. The implication is not that decisions cannot be made, but that any decision system necessarily embodies a tradeoff. Some condition must give way for the system to function.

Incompatible Preferences

The force of Arrow’s theorem becomes clearer when the problem is viewed without formal notation. Consider a group evaluating three alternatives. Different individuals rank those alternatives differently, but the group must produce a single ordering. It is natural to assume that a sufficiently well-designed rule will preserve the consistency of those rankings. Arrow’s contribution was to show that the expectation is misplaced. Once three or more alternatives are involved, the conditions that define a “reasonable” aggregation rule conflict with one another.

This conflict is not the result of irrational behavior. Even when every participant is perfectly rational, the aggregation of their preferences introduces contradictions. A rule that respects unanimous agreement may fail to preserve consistency when irrelevant alternatives are introduced. A rule that avoids those inconsistencies may concentrate decisive power in a way that violates the principle of non-dictatorship. The system cannot satisfy all conditions simultaneously because the conditions themselves are incompatible when applied together.

Here is the simplest intuition. Think of the voting paradox discovered by the Marquis de Condorcet, and imagine three voters and three alternatives: A, B, and C. Voter 1 ranks them A ≻ B ≻ C, voter 2 ranks them B ≻ C ≻ A, and voter 3 ranks them C ≻ A ≻ B. Now compare the options two at a time. Between A and B, voters 1 and 3 prefer A, so the group prefers A over B. Between B and C, voters 1 and 2 prefer B, so the group prefers B over C. Between C and A, voters 2 and 3 prefer C, so the group prefers C over A. The collective preference becomes A ≻ B, B ≻ C, and C ≻ A. The group prefers A to B, B to C, and C to A. The ranking is no longer transitive; it collapses into a cycle.

The implication is structural. The limitation does not disappear with better data, more sophisticated modeling, or more cooperative participants. It persists because it is built into the logic of preference aggregation. The expectation of a perfectly consistent and fair decision rule is therefore not simply unrealistic. It is mathematically impossible under the assumptions that define the problem.

The Structure of Every Deal

Transactions in finance operate inside the same logic. A sale process brings together participants whose objectives are not aligned but whose decisions must ultimately produce a single outcome. A seller may rank outcomes according to valuation, certainty of closing, and preservation of what has been built. A buyer evaluates the same set of possibilities through the lens of expected return, strategic fit, and risk. Lenders, when involved, focus on downside protection and the stability of cash flows. Each group enters the process with a distinct ordering of outcomes.

The transaction is the mechanism that collapses those rankings into a single outcome. At first glance it is tempting to assume that a sufficiently well-structured deal can satisfy every participant simultaneously. Experience shows otherwise. Increasing valuation tends to introduce elements of uncertainty such as earnouts or deferred payments. Eliminating uncertainty tends to compress valuation. Strengthening financing terms improves certainty of closing while imposing constraints elsewhere in the structure. Each adjustment improves one dimension of the outcome while weakening another.

Consider a company generating $8 million in EBITDA entering a sale process. The seller may believe the business supports a ten-times (10x) multiple, implying an enterprise value of $80 million. A buyer evaluating the same company may conclude that the appropriate multiple is closer to 8x EBITDA, or $64 million, based on its return requirements and risk assumptions. The difference between those positions is not abstract; it is a $16 million gap that must be resolved before a transaction can exist.

The disagreement is often framed as a question of valuation, but the structure of the problem reveals something deeper. The seller’s preference ranking places maximum weight on price. The buyer’s ranking places maximum weight on risk-adjusted return. If the buyer finances a portion of the transaction with debt and targets a specific internal rate of return, the amount of cash that can be paid at closing is constrained by those parameters. The conflict is therefore not simply a matter of perspective; it reflects the interaction of different preference systems operating under real constraints. Every deal is an optimization problem with incompatible constraints. The mistake is believing those constraints can be removed.

Designing at the Boundary

The work of a sell-side advisor takes place within this structure of incompatible preferences. The objective is not to construct a transaction that satisfies every participant equally, because the system rarely allows that outcome. The objective is to define the seller’s priorities with precision and design a structure that pushes those priorities as far as the constraints of the system permit.

In the example above, the gap between $64 and $80 million does not disappear through argument. It is addressed through structure. A portion of the purchase price may be tied to future performance through an earnout linked to revenue or EBITDA milestones. The seller may roll over a percentage of equity into the combined entity, preserving exposure to future upside while reducing the buyer’s upfront capital requirement. Seller financing may be introduced to bridge the gap between what the buyer can pay at closing and the valuation the seller seeks. Each of these mechanisms reshapes the set of feasible outcomes without eliminating the underlying tension between price and risk.

These structures do not resolve the disagreement in the sense of eliminating it. They convert the disagreement into a form that allows the transaction to exist. The seller’s objective approaches the boundary defined by the buyer’s constraints, but it does not override those constraints. Negotiation becomes a process of understanding where that boundary lies and designing within it. Once the constraint is visible, the discussion shifts from abstract valuation to concrete structure.

Choosing the Tradeoff

Arrow’s theorem forced economists to recognize that certain decision systems cannot satisfy all the conditions we would like them to meet. Transactions in finance encounter the same limitation in practice. When multiple stakeholders rank outcomes differently, no structure can maximize every objective simultaneously. The expectation that a deal can deliver the highest valuation, complete certainty, minimal risk, and full alignment across all participants is not simply optimistic, it is inconsistent with the structure of the problem.

Again, the consequence is not that decisions cannot be made. Decisions are made every day, and transactions close under a wide range of structures. The consequence is that every transaction embodies a choice among tradeoffs. One objective defines the outcome, and the others adjust around it. The role of the advisor is not to eliminate those tradeoffs but to understand them early and design the structure so that the chosen objective is achieved as fully as the system allows.

In practice, no deal satisfies everyone. The structure won’t allow it. The outcome is determined by which constraint binds and which objective is allowed to dominate. Once that is clear, the rest is execution.