Market equilibrium computation

Market equilibrium computation (also called competitive equilibrium computation or clearing-prices computation) is a computational problem in the intersection of economics and computer science. The input to this problem is a market, consisting of a set of resources and a set of agents. There are various kinds of markets, such as Fisher market and Arrow–Debreu market, with divisible or indivisible resources. The required output is a competitive equilibrium, consisting of a price-vector (a price for each resource), and an allocation (a resource-bundle for each agent), such that each agent gets the best bundle possible (for him) given the budget, and the market clears (all resources are allocated).

Market equilibrium computation is interesting due to the fact that a competitive equilibrium is always Pareto efficient. The special case of a Fisher market, in which all buyers have equal incomes, is particularly interesting, since in this setting a competitive equilibrium is also envy-free. Therefore, market equilibrium computation is a way to find an allocation which is both fair and efficient.

Definitions

The input to the market-equilibrium-computation consists of the following ingredients:^{[1]: chap.5}

1. A set of ${\displaystyle m}$  resources with pre-specified supplies. The resources can be divisible (in which case, their supply is w.l.o.g. normalized to 1), or indivisible .
   • A bundle is represented by a vector ${\displaystyle \mathbf {x} =x_{1},\dots ,x_{m}}$ , where ${\displaystyle x_{j}}$  is the quantity of resource ${\displaystyle j}$ . When resources are indivisible, all x_j are integers; when resources are divisible, the x_j can be arbitrarily real numbers (usually normalized to [0,1]).
2. A set of ${\displaystyle n}$  agents. For each agent, there is a preference relation over bundles, which can be represented by a utility function. The utility function of agent ${\displaystyle i}$  is denoted by ${\displaystyle u_{i}}$ .
3. An initial endowment for each agent.
   • In a Fisher market, the endowment is a budget ${\displaystyle B_{i}}$  of "fiat money" - a money that has no value outside the market, and thus does not enter the utility function. Since the agents come with money only, they are often called buyers.
   • In an Arrow–Debreu market, the endowment is an arbitrary bundle ${\displaystyle \mathbf {e} ^{i}}$ ; in this model, agents can be both buyers and sellers.

The required output should contain the following ingredients:

1. A price-vector ${\displaystyle \mathbf {p} =p_{1},\dots ,p_{m}}$ ; a price for each resource. The price of a bundle is the sum of the prices of the resources in the, so the price of a bundle ${\displaystyle \mathbf {x} }$  is ${\displaystyle \mathbf {p} \cdot \mathbf {x} =\sum _{j=1}^{m}p_{j}\cdot x_{j}}$ .
2. An allocation - a bundle ${\displaystyle \mathbf {x} ^{i}}$  for each agent i.

The output should satisfy the following requirements:

1. The bundle ${\displaystyle \mathbf {x} ^{i}}$  should be affordable to i, that is, its price should be at most the price of agent i's endowment.
   • In a Fisher market, this means that ${\displaystyle \mathbf {p} \cdot \mathbf {x} ^{i}\leq B_{i}}$ .
   • In an Arrow-Debreu market, this means that ${\displaystyle \mathbf {p} \cdot \mathbf {x} ^{i}\leq \mathbf {p} \cdot \mathbf {e} ^{i}}$ .
2. The bundle ${\displaystyle \mathbf {x} ^{i}}$  should be in the demand set of i: ${\displaystyle \mathbf {x} ^{i}\in {\text{Demand}}_{i}(\mathbf {p} )}$ , defined as the set of bundles maximizing the agent's utility among all affordable bundles (regardless of supply), e.g., in a Fisher market: ${\displaystyle {\text{Demand}}_{i}(\mathbf {p} ):=\arg \max _{\mathbf {p} \mathbf {x} \leq B_{i}}u_{i}(\mathbf {x} )}$ 
3. The market clears, i.e., all resources are allocated. The corresponding prices are called market-clearing prices.

A price and allocation satisfying these requirements are called a competitive equilibrium (CE) or a market equilibrium; the prices are also called equilibrium prices or clearing prices.

Kinds of utility functions

Market equilibrium computation has been studied under various assumptions regarding the agents' utility functions.

• Concavity: the most general assumption (made by Fisher and Arrow&Debreu) is that the agents' utilities are concave functions, i.e., display diminishing returns.
• Homogeneity: In some cases, it is assumed that the utilities are homogeneous functions. This includes, in particular, utilities with constant elasticity of substitution.
• Separability: A utility function is called separable if the utility of a bundle is the sum of the utilities of the individual resources in the bundle, i.e., ${\displaystyle u_{i}(\mathbf {x} )=\sum _{j=1}^{m}u_{i,j}(x_{j})}$ .
• Piecewise-linearity is a special case of separability, in which the utility function for each individual resource, ${\displaystyle u_{i,j}(x_{j})}$ , is a piecewise linear function of xj.
• Linearity is an even more special case, in which the utility function for each individual resource is a linear function. That is, ${\displaystyle u_{i}(\mathbf {x} )=\sum _{j=1}^{m}u_{i,j}\cdot x_{j}}$ , where ${\displaystyle u_{i,j}}$  are constants.

Utilities that are piecewise-linear and concave are often called PLC; if they are also separable, then they are called SPLC.

Main results

Approximate algorithms

Scarf^[2] was the first to show the existence of a CE using Sperner's lemma (see Fisher market). He also gave an algorithm for computing an approximate CE.

Merrill^[3] gave an extended algorithm for approximate CE.

Kakade, Kearns and Ortiz^[4] gave algorithms for approximate CE in a generalized Arrow-Debreu market in which agents are located on a graph and trade may occur only between neighboring agents. They considered non-linear utilities.

Hardness results

In some cases, computing an approximate CE is PPAD-hard:

• Devanur and Kannan^[5] proved PPAD-hardness in an Arrow-Debreu market with Leontief utilities - a special case of PLC utilities.
• Chen, Dai, Du and Teng^[6] proved PPAD-hardness in an Arrow-Debreu market with SPLC utilities. Their proof shows that this market-equilibrium problem does not have an FPTAS unless PPAD is in P.
• Chen and Teng^[7] proved PPAD-hardness in a Fisher market with SPLC utilities.
• Chaudhury, Garg, McGlaughlin and Mehta^[8] proved PPAD-hardness in a Exchange (Arrow-Debreu) market with bads and linear utilities, even under a certain condition that guarantees CE existence.

Exact algorithms

Devanur, Papadimitriou, Saberi and Vazirani^[9] gave a polynomial-time algorithm for exactly computing an equilibrium for Fisher markets with linear utility functions. Their algorithm uses the primal–dual paradigm in the enhanced setting of KKT conditions and convex programs. Their algorithm is weakly-polynomial: it solves${\displaystyle O((n+m)^{5}\log(u_{\max })+(n+m)^{4}\log {B_{\max }})}$  maximum flow problems, and thus it runs in time ${\displaystyle O((n+m)^{8}\log(u_{\max })+(n+m)^{7}\log {B_{\max }})}$ , where u_max and B_max are the maximum utility and budget, respectively.

Orlin^[10] gave an improved algorithm for a Fisher market model with linear utilities, running in time ${\displaystyle O((n+m)^{4}\log(u_{\max })+(n+m)^{3}B_{\max })}$ . He then improved his algorithm to run in strongly-polynomial time: ${\displaystyle O((m+n)^{4}\log(m+n))}$ .

Devanur and Kannan^[5] gave algorithms for Arrow-Debreu markets with concave utility functions, where all resources are goods (the utilities are positive):

• When the utilities are SPLC and either n or m is a constant, their algorithm is polynomial in the other parameter. The technique is decomposing the space of possible prices into cells using a constant number of hyperplanes, so that in each cell, each buyer’s threshold marginal utility is known (when both n and m are variable, it was left open whether a polytime algorithm exists).
• When the utilities are PLC (not necessarily separable) and m is constant, their algorithm is polynomial in n. When both m and n are variable, finding a CE is PPAD-hard even for Leontief utilities, which are a special case of PLC utilities (when n is constant but m is variable, it was left open whether a polytime algorithm exists).

Codenotti, McCune, Penumatcha and Varadarajan^[11] gave an algorithm for Arrow-Debreu markes with CES utilities where the elasticity of substitution is at least 1/2.

Bads and mixed manna

Bogomolnaia and Moulin and Sandomirskiy and Yanovskaia studied the existence and properties of CE in a Fisher market with bads (items with negative utilities)^[12] and with a mixture of goods and bads.^[13] In contrast to the setting with goods, when the resources are bads the CE does not solve any convex optimization problem even with linear utilities. CE allocations correspond to local minima, local maxima, and saddle points of the product of utilities on the Pareto frontier of the set of feasible utilities. The CE rule becomes multivalued. This work has led to several works on algorithms of finding CE in such markets:

• Branzei and Sandomirskiy^[14] gave an algorithm for finding all the CE in a Fisher market with bads and linear utilities. Their algorithm runs in strongly-polynomial time if either n or m is fixed. Their approach combines three ideas: all consumption graphs of PO allocations can be listed in polynomial time; for a given consumption graph, a CE candidate can be constructed via explicit formula; and a given allocation can be checked for being a CE using a maximum flow computation.
• Garg and McGlaughlin^[15] gave an algorithm for computing all the CE in a Fisher market with mixed manna and linear utilities. Their algorithm runs in polynomial time if either n or m is fixed.
• Chaudhury, Garg, McGlaughlin and Mehta^[16] gave an algorithm for computing a single CE in a Fisher market with mixed manna and SPLC utilities. Their algorithm is simplex-like and based on Lemke's scheme. While its worst-case runtime is not polynomial (the problem is PPAD-hard even with goods^[7]), it runs fast on random instances. It also proves that the problem is in PPAD, the solutions are rational-valued, and the number of solutions is odd. Their algorithm runs in polynomial time in the special case in which all utilities are negative.

If both n and m are variable, the problem becomes computationally hard:

• Chaudhury, Garg, McGlaughlin and Mehta^[8]: Thm.3 show that, in a Fisher market with bads and linear utilities, it is NP-hard to decide whether a CE exists. The same hardness holds even for finding an (11/12+δ)-CE for any δ>0, and even with equal incomes. They also prove a sufficient condition, based on graph connectivity, to the existence of a CE. With this condition, a CE always exists, but finding it is PPAD-hard.^[8]: Thm.5

Main techniques

Bang-for-buck

When the utilities are linear, the bang-per-buck of agent i (also called BPB or utility-per-coin) is defined as the utility of i divided by the price paid. The BPB of a single resource is ${\displaystyle bpb_{i,j}:={\frac {u_{i,j}}{p_{j}}}}$ ; the total BPB is ${\displaystyle bpb_{i,total}:={\frac {\sum _{j=1}^{m}u_{i,j}\cdot x_{i,j}}{B_{i}}}}$ .

A key observation for finding a CE in a Fisher market with linear utilities is that, in any CE and for any agent i:^[1]

• The total BPB is weakly larger than the BPB from any individual resource, ${\displaystyle \forall j:bpb_{i,j}\leq bpb_{i,total}}$ .
• Agent i consumes only resources with the maximum possible BPB, i.e., ${\displaystyle \forall j:x_{i,j}>0\implies bpb_{i,j}=bpb_{i,total}}$ .

Assume that every product ${\displaystyle j}$  has a potential buyer - a buyer ${\displaystyle i}$  with ${\displaystyle u_{i,j}>0}$ . Then, the above inequalities imply that ${\displaystyle p_{j}>0}$ , i.e, all prices are positive.

Cell decomposition

Cell decomposition^[5] is a process of partitioning the space of possible prices ${\displaystyle \mathbb {R} _{+}^{m}}$  into small "cells", either by hyperplanes or, more generally, by polynomial surfaces. A cell is defined by specifying on which side of each of these surfaces it lies (with polynomial surfaces, the cells are also known as semialgebraic sets). For each cell, we either find a market-clearing price-vector (i.e., a price in that cell for which a market-clearing allocation exists), or verify that the cell does not contain a market-clearing price-vector. The challenge is to find a decomposition with the following properties:

• The total number of cells is polynomial in the size of the input. This uses the fact that any collection of k hyperplanes in ${\displaystyle \mathbb {R} _{+}^{m}}$  partitions the space into ${\displaystyle O(k^{m})}$  cells.^[5]: Thm.2 This is polynomial if m is fixed. Moreover, any collection of k polynomial surfaces of degree at most d partitions the space into ${\displaystyle O(k^{m+1}\cdot d^{O(m)})}$  non-empty cells, and they can be enumerated in time linear in the output size.^[17]
• Finding a market-clearing price-vector in each cell can be done in polynomial time, e.g., using linear programming.

Convex optimization: homogeneous utilities

If the utilities of all agents are homogeneous functions, then the equilibrium conditions in the Fisher model can be written as solutions to a convex optimization program called the Eisenberg-Gale convex program.^[18] This program finds an allocation that maximizes the weighted geometric mean of the buyers' utilities, where the weights are determined by the budgets. Equivalently, it maximizes the weighted arithmetic mean of the logarithms of the utilities:

Maximize ${\displaystyle \sum _{i=1}^{n}\left(B_{i}\cdot \log {(u_{i})}\right)}$ 

Subject to:

Non-negative quantities: For every buyer ${\displaystyle i}$  and product ${\displaystyle j}$ : ${\displaystyle x_{i,j}\geq 0}$ 

Sufficient supplies: For every product ${\displaystyle j}$ : ${\displaystyle \sum _{i=1}^{n}x_{i,j}\leq 1}$ 

(since supplies are normalized to 1).

This optimization problem can be solved using the Karush–Kuhn–Tucker conditions (KKT). These conditions introduce Lagrangian multipliers that can be interpreted as the prices, ${\displaystyle p_{1},\dots ,p_{m}}$ . In every allocation that maximizes the Eisenberg-Gale program, every buyer receives a demanded bundle. I.e, a solution to the Eisenberg-Gale program represents a market equilibrium.^{[1]: 141–142}

Vazirani's algorithm: linear utilities, weakly polynomial-time

A special case of homogeneous utilities is when all buyers have linear utility functions. We assume that each resource has a potential buyer - a buyer that derives positive utility from that resource. Under this assumption, market-clearing prices exist and are unique. The proof is based on the Eisenberg-Gale program. The KKT conditions imply that the optimal solutions (allocations ${\displaystyle x_{i,j}}$  and prices ${\displaystyle p_{j}}$ ) satisfy the following inequalities:

1. All prices are non-negative: ${\displaystyle p_{j}\geq 0}$ .
2. If a product has a positive price, then all its supply is exhausted: ${\displaystyle p_{j}>0\implies \sum _{i=1}^{n}x_{i,j}=1}$ .
3. The total BPB is weakly larger than the BPB from any individual resource, ${\displaystyle \forall j:bpb_{i,j}\leq bpb_{i,total}}$ .
4. Agent i consumes only resources with the maximum possible BPB, i.e., ${\displaystyle \forall j:x_{i,j}>0\implies bpb_{i,j}=bpb_{i,total}}$ .

Assume that every product ${\displaystyle j}$  has a potential buyer - a buyer ${\displaystyle i}$  with ${\displaystyle u_{i,j}>0}$ . Then, inequality 3 implies that ${\displaystyle p_{j}>0}$ , i.e, all prices are positive. Then, inequality 2 implies that all supplies are exhausted. Inequality 4 implies that all buyers' budgets are exhausted. I.e, the market clears. Since the log function is a strictly concave function, if there is more than one equilibrium allocation then the utility derived by each buyer in both allocations must be the same (a decrease in the utility of a buyer cannot be compensated by an increase in the utility of another buyer). This, together with inequality 4, implies that the prices are unique.^[1]: 107

Vazirani^{[1]: 109–121} presented an algorithm for finding equilibrium prices and allocations in a linear Fisher market. The algorithm is based on condition 4 above. The condition implies that, in equilibrium, every buyer buys only products that give him maximum BPB. Let's say that a buyer "likes" a product, if that product gives him maximum BPB in the current prices. Given a price-vector, construct a flow network in which the capacity of each edge represents the total money "flowing" through that edge. The network is as follows:

• There is a source node, s.
• There is a node for each product; there is an edge from s to each product j, with capacity ${\displaystyle p_{j}}$  (this is the maximum amount of money that can be expended on product j, since the supply is normalized to 1).
• There is a node for each buyer; there is an edge from a product to a buyer, with infinite capacity, iff the buyer likes the product (in the current prices).
• There is a target node, t; there is an edge from each buyer i to t, with capacity ${\displaystyle B_{i}}$  (the maximum expenditure of i).

The price-vector p is an equilibrium price-vector, if and only if the two cuts ({s},V\{s}) and (V\{t},{t}) are min-cuts. Hence, an equilibrium price-vector can be found using the following scheme:

• Start with very low prices, which are guaranteed to be below the equilibrium prices; in these prices, buyers have some budget left (i.e, the maximum flow does not reach the capacity of the nodes into t).
• Continuously increase the prices and update the flow-network accordingly, until all budgets are exhausted.

There is an algorithm that solves this problem in weakly polynomial time.

See also

• Efficient envy-free division
• Efficient approximately-fair item allocation

References

1. Vazirani, Vijay V.; Nisan, Noam; Roughgarden, Tim; Tardos, Éva (2007). "Chapter 5: Combinatorial Algorithms for Market Equilibria / Vijay V. Vazirani". Algorithmic Game Theory (PDF). Cambridge, UK: Cambridge University Press. ISBN 0-521-87282-0.
2. Scarf, Herbert E. (1967). "On the Computation of Equilibrium Prices". {{cite journal}}: Cite journal requires |journal= (help)
3. O. H. Merrill (1972). Applications and Extensions of an algorithm that computes fixed points of certain upper semi-continuous point to set mappings. PhD thesis.
4. Kakade, Sham M.; Kearns, Michael; Ortiz, Luis E. (2004). Shawe-Taylor, John; Singer, Yoram (eds.). "Graphical Economics". Learning Theory. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer. 3120: 17–32. doi:10.1007/978-3-540-27819-1_2. ISBN 978-3-540-27819-1.
5. Devanur, N. R.; Kannan, R. (2008-10-01). "Market Equilibria in Polynomial Time for Fixed Number of Goods or Agents". 2008 49th Annual IEEE Symposium on Foundations of Computer Science: 45–53. doi:10.1109/FOCS.2008.30. ISBN 978-0-7695-3436-7. S2CID 13992175.
6. Chen, X.; Dai, D.; Du, Y.; Teng, S. (2009-10-01). "Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities". 2009 50th Annual IEEE Symposium on Foundations of Computer Science: 273–282. arXiv:0904.0644. doi:10.1109/FOCS.2009.29. ISBN 978-1-4244-5116-6. S2CID 580788.
7. Chen, Xi; Teng, Shang-Hua (2009). Dong, Yingfei; Du, Ding-Zhu; Ibarra, Oscar (eds.). "Spending Is Not Easier Than Trading: On the Computational Equivalence of Fisher and Arrow-Debreu Equilibria". Algorithms and Computation. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer. 5878: 647–656. arXiv:0907.4130. doi:10.1007/978-3-642-10631-6_66. ISBN 978-3-642-10631-6. S2CID 7817966.
8. Chaudhury, Bhaskar Ray; Garg, Jugal; McGlaughlin, Peter; Mehta, Ruta (2020-08-01). "Dividing Bads is Harder than Dividing Goods: On the Complexity of Fair and Efficient Division of Chores". arXiv:2008.00285 [cs.GT].
9. Devanur, Nikhil R.; Papadimitriou, Christos H.; Saberi, Amin; Vazirani, Vijay V. (2008-11-05). "Market equilibrium via a primal--dual algorithm for a convex program". Journal of the ACM. 55 (5): 22:1–22:18. doi:10.1145/1411509.1411512. ISSN 0004-5411. S2CID 11836728.
10. Orlin, James B. (2010-06-05). "Improved algorithms for computing fisher's market clearing prices: computing fisher's market clearing prices". Proceedings of the Forty-Second ACM Symposium on Theory of Computing. STOC '10. Cambridge, Massachusetts, USA: Association for Computing Machinery: 291–300. doi:10.1145/1806689.1806731. hdl:1721.1/68009. ISBN 978-1-4503-0050-6. S2CID 8235905.
11. Codenotti, Bruno; McCune, Benton; Penumatcha, Sriram; Varadarajan, Kasturi (2005). Sarukkai, Sundar; Sen, Sandeep (eds.). "Market Equilibrium for CES Exchange Economies: Existence, Multiplicity, and Computation". FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer. 3821: 505–516. doi:10.1007/11590156_41. ISBN 978-3-540-32419-5.
12. Bogomolnaia, Anna; Moulin, Hervé; Sandomirskiy, Fedor; Yanovskaia, Elena (2019-03-01). "Dividing bads under additive utilities". Social Choice and Welfare. 52 (3): 395–417. doi:10.1007/s00355-018-1157-x. ISSN 1432-217X.
13. Bogomolnaia, Anna; Moulin, Hervé; Sandomirskiy, Fedor; Yanovskaya, Elena (2017). "Competitive Division of a Mixed Manna". Econometrica. 85 (6): 1847–1871. arXiv:1702.00616. doi:10.3982/ECTA14564. ISSN 1468-0262. S2CID 17081755.
14. Brânzei, Simina; Sandomirskiy, Fedor (2019-07-03). "Algorithms for Competitive Division of Chores". arXiv:1907.01766 [cs.GT].
15. Garg, Jugal; McGlaughlin, Peter (2020-05-05). "Computing Competitive Equilibria with Mixed Manna". Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems. AAMAS '20. Auckland, New Zealand: International Foundation for Autonomous Agents and Multiagent Systems: 420–428. ISBN 978-1-4503-7518-4.
16. Chaudhury, Bhaskar Ray; Garg, Jugal; McGlaughlin, Peter; Mehta, Ruta (2021-01-01), "Competitive Allocation of a Mixed Manna", Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), Proceedings, Society for Industrial and Applied Mathematics, pp. 1405–1424, doi:10.1137/1.9781611976465.85, ISBN 978-1-61197-646-5
17. Basu, Saugata; Pollack, Richard; Roy, Marie-Françoise (1998). Caviness, Bob F.; Johnson, Jeremy R. (eds.). "A New Algorithm to Find a Point in Every Cell Defined by a Family of Polynomials". Quantifier Elimination and Cylindrical Algebraic Decomposition. Texts and Monographs in Symbolic Computation. Vienna: Springer: 341–350. doi:10.1007/978-3-7091-9459-1_17. ISBN 978-3-7091-9459-1.
18. Eisenberg, E. (1961). . Management Science. 7 (4): 337–350. doi:10.1287/mnsc.7.4.337. Archived from the original on September 23, 2017.