Fisher Markets

In 1891, the economist Irving Fisher dreamed up a hydraulic machine — tanks, pipes and floats — that would compute the prices at which supply and demand balance. A century later that same model is the engine inside Google's ad auction and every course-allocation system used by business schools.

The setup is deliberately simple: a market holds some goods (bandwidth, courses, ad slots), and each buyer arrives with a budget — money to spend, not to save. Each buyer has utilities: how much they value a fraction of each good. They spend their entire budget on whatever mix of goods gives them the highest utility.

The central question is: do prices exist that clear the market? That is, prices at which every buyer is satisfied spending exactly their budget and every good is exactly sold out. The answer is yes, and computing those prices is surprisingly tractable — a result that sets Fisher markets apart from the general equilibrium problems that can be PPAD-hard.

In 1959, Eisenberg and Gale showed that the equilibrium prices are the solution of a single convex program — a maximum over a concave objective. That means the equilibrium can be found efficiently with standard convex solvers, and it is unique (prices are unique; allocations may tie, but utilities are unique).

Below is a Fisher market with 3 buyers (Alice, Bob, Carol) and 3 goods (A, B, C). Each buyer has a budget and utility weights for the goods. The demo runs the Eisenberg-Gale convex program via gradient ascent to find prices that clear the market.

<p class="hint">{{hint}}</p>
<div id="controls"></div>
<button id="btn-compute" type="button">{{btn_compute}}</button>
<button id="btn-reset" type="button" class="ghost">{{btn_reset}}</button>
<div id="results" class="results hidden"></div>

* { box-sizing: border-box; }
body { font-family: system-ui, sans-serif; color: #222; margin: 0; font-size: 14px; }
.hint { font-size: .88rem; color: #444; margin: 0 0 .8rem; line-height: 1.5; }
#controls { display: grid; grid-template-columns: 1fr 1fr 1fr; gap: .6rem 1rem; margin-bottom: .8rem; }
.buyer-block { background: #f0f4f8; border-radius: 10px; padding: .6rem .8rem; }
.buyer-block h4 { margin: 0 0 .4rem; font-size: .9rem; color: #1d3557; }
label { display: block; font-size: .8rem; color: #555; margin-top: .35rem; }
input[type=range] { width: 100%; accent-color: #1d3557; }
.val { font-weight: 700; color: #1d3557; }
button { font: 600 13px system-ui; padding: .4rem .85rem; border: 1px solid #1d3557;
         background: #1d3557; color: #fff; border-radius: 8px; cursor: pointer; margin-right: .4rem; }
button.ghost { background: #fff; color: #1d3557; }
.results { margin-top: .9rem; }
.results.hidden { display: none; }
.price-row { display: flex; gap: .5rem; margin-bottom: .5rem; flex-wrap: wrap; }
.price-chip { background: #1d3557; color: #fff; border-radius: 8px; padding: .3rem .65rem; font-size: .82rem; font-weight: 700; }
table { width: 100%; border-collapse: collapse; margin-top: .4rem; font-size: .82rem; }
th { background: #dce6ee; color: #1d3557; padding: .3rem .5rem; text-align: left; }
td { padding: .28rem .5rem; border-bottom: 1px solid #eef1f4; }
tr:last-child td { border-bottom: none; }
.ok { color: #0a7d33; font-weight: 700; }
.section-label { font-weight: 700; color: #1d3557; font-size: .85rem; margin: .6rem 0 .2rem; }

// Code not found

Edit the sliders to change budgets and utilities, then click Compute Equilibrium to see the prices and how each buyer spends their budget. Notice that every buyer exhausts their budget and every good is exactly sold out — that is the definition of a competitive equilibrium.

How hard is it to find market-clearing prices? The answer depends sharply on the model.

• General equilibrium (Arrow-Debreu) can be PPAD-complete — computing a Nash equilibrium in disguise. Finding it may be no easier than Nash equilibrium in general games.
• Fisher markets are special. Because buyers spend budgets (not endowments that change with prices), the problem has extra structure. Eisenberg and Gale (1959) showed the equilibrium maximizes the weighted sum of log-utilities subject to market-clearing constraints — a strictly concave objective over a convex feasible set.
• Convex programs are tractable. Strictly concave maximization has a unique optimum reachable by interior-point methods in polynomial time. The equilibrium is provably solvable — it sits firmly in P for linear utilities.
• What about other utility functions? Arrow-Debreu utilities (with substitutes) remain tractable; complementarities push the problem toward hardness. Fisher markets with Leontief (perfect-complement) utilities are also in P via a different convex program.

The key insight is that the market-clearing condition is a convex constraint and the buyers' rational behavior is a concave objective — the two combine into a single convex program that algorithms can solve efficiently and uniquely. This is a rare win: a model from economics that is both realistic and computationally friendly.

The Fisher market model is not just a textbook exercise — it runs live systems used by millions:

• Internet advertising: Google, Meta, and Microsoft run generalized Fisher market auctions to allocate ad impressions. Advertisers have budgets; the platform finds prices that maximize revenue while exhausting each budget. The Eisenberg-Gale framework underpins the theoretical analysis of these mechanisms.
• Fair division: "Divide the inheritance so everyone is happy" is a Fisher market where each heir gets an equal budget. The equilibrium allocation is envy-free (no one prefers another's share) and Pareto-optimal — an impossibility in many other fair-division models.
• Course allocation: Business schools (Wharton, Harvard) let students bid with fake currency on courses. The equilibrium allocation maximizes student welfare and is strategy-proof under mild conditions.
• Bandwidth and cloud scheduling: ISPs and data-center schedulers use weighted max-min fairness, which is exactly the Fisher market equilibrium with equal utilities for each user's share.
• Theoretical economics: Fisher markets are the simplest complete model where one can formally study how prices emerge from individual optimization, making them central to teaching general equilibrium theory.

Understand Fisher markets and you hold the key to linear programming duality, fair division, and the economics of the internet.

Fisher markets are one of the rare places where economic theory and algorithmic tractability align perfectly. Buyers maximize utility, every good sells out, and every budget is spent — and the prices that make it happen are the unique optimum of a convex program that any standard solver can find in polynomial time.

The 1959 insight of Eisenberg and Gale transformed a hydraulic metaphor into a mathematical theorem, and that theorem now runs inside ad exchanges, course bidding systems, and fair-division algorithms every day.

The next time you see a targeted ad or bid for a business school course, remember: behind the interface is a convex program silently finding the prices that make everyone's budget balance. See also linear programming and Nash equilibrium for the broader landscape of tractable and intractable equilibrium problems.