Proportional response (PR) dynamics is a decentralized iterative process that, if used by buyers in a Fisher market, converges (under certain assumptions) to a competitive equilibrium. In a Fisher market, each buyer i has a fixed budget Bi and a utility function over bundles of divisible goods; sellers supply fixed quantities of each good. The market equilibrium is a set of prices and allocations where each buyer maximizes utility subject to their budget and all goods clear (supply equals demand). PR dynamics provides a simple, distributed algorithm for reaching such equilibrium without central coordination.
PR dynamics were introduced by Wu and Zhang to explain the success of bandwidth sharing in peer-to-peer networks such as BitTorrent.[1] They were later adapted by Zhang to Fisher markets.[2]
Description
editEach buyer i comes to the market with a fixed budget bi. Each buyer also has a utility function ui.
At each discrete round t, each buyer distributes its entire budget among the available goods, allocating bij(t) to each good j, such that all budget is allocated:
Each good's price is the sum of bids it receives:
Each buyer then receives a share of the good proportional to their bid:
Let uij(t) be the utility buyer i derives from good j at round t. The updated bid in the next round is:
This ensures buyers spend more on goods that yielded higher utility for them.[2]
Example
editConsider two buyers (A, B) and two goods (1, 2). Each buyer has budget 1. The buyers have linear utility functions, and their valuations are:
- A: vA1 = 2, vA2 = 1
- B: vB1 = 1, vB2 = 2
Round 0
editBoth buyers split bids equally: 0.5 per good. Prices: p1 = 1.0, p2 = 1.0. Allocations:
- A: xA1 = 0.5, xA2 = 0.5
- B: xB1 = 0.5, xB2 = 0.5
Utilities:
- A derives utility 1 from good 1 and utility 0.5 from good 2;
- B derives utility 1 from good 2 and utility 0.5 from good 1.
Round 1
editA bids in ratio 2:1 → bids 2/3 on good 1, 1/3 on good 2. B does the reverse. Prices remain 1.0 for both goods. Allocations:
- A gets 2/3 of good 1, 1/3 of good 2.
- B gets 1/3 of good 1, 2/3 of good 2
Utilities:
- A derives utility 4/3 from good 1 and utility 1/3 from good 2.
- B derives utility 1/3 from good 1 and utility 4/3 from good 2.
Round 2
editA bids in ratio 4:1 → bids 4/5 on good 1, 1/5 on good 2. B does the reverse. Prices remain 1.0 for both goods. Allocations:
- A gets 4/5 of good 1, 1/5 of good 2.
- B gets 1/5 of good 1, 4/5 of good 2
We see that the allocation approaches the equilibrium allocation, in which A receives all of good 1 and B receives all of good 2, and their prices are 1.
Main results
editZhang[2]: Thm.4 proved that PR converges whe each agent i has a CES utility function with parameter . The convergence rates depend on the maximum parameter, :
- When (corresponding to strictly concave utility functions), a strong ε-approximate market equilibrium is attained after steps, where W is a parameter related to the maximum size of the coefficients in the agents' utility functions.
- When (corresponding to linear utility functions), an ε-approximate market equilibrium is attained after steps.
Birnbaum et al[3] showed that PR is equivalent to mirror descent on a convex program due to Shmyrev.[4] They also generalized the convergence results to agents with linear utilities with spending constraints.
Cheung, Cole and Tao[5] studied two generalizations of PR. One of them a damped generalized PR. They prove that it has a linear rate of convergence for agents with "strict" CES utilities (excluding the linear and Leontief utilities). When linear and Leontief are included, the empirical convergence rate is O(1/T).
Cheung, Hoefer and Nakhe[6] adapted the convergence results of PR to dynamic markets, in which the parameters of agents and goods may change over time.
Yang, Li, Chen and Lin[7] introduce the online PR auction for periodic Fisher markets, in which the properties of goods change over time. They show an upper bound on the buyers' regret.
Kolumbus, Levy and Nisan[8] studied asynchronous PR, where agents update their bids asynchronously with adversarial scheduling (each time, an adversary chooses a subset of the agents and they update their bids). They show convergence when the utilities are linear.
Li and Tang[9] extended PR to a setting in which several goods may belong to the same seller. They show that it still converges. However, the sellers may have an incentive to manipulate the rule.
Brânzei, Mehta and Nisan[10] study PR in a production economy. They proved that PR converges to an unbounded growth process, with users learning the production cycles in a distributed way; but it also leads to high inequality.
Cheung, Cole and Tao[11] showed convergence of PR when agents have gross substitute valuations.
See also
edit- Dynamic pricing: PR adapts to utility/supply changes.
- Market equilibrium computation
- Tatonnement: PR is large-step and discrete; contrast with price adjustment
- Walrasian equilibrium
References
edit- ^ Wu, Fang; Zhang, Li (2007). "Proportional response dynamics leads to market equilibrium". Proceedings of the thirty-ninth annual ACM symposium on Theory of computing. pp. 354–363. doi:10.1145/1250790.1250844. ISBN 978-1-59593-631-8.
- ^ a b c Zhang, Li (2011). "Proportional response dynamics in the Fisher market". Theoretical Computer Science. 412 (24): 2691–2698. doi:10.1016/j.tcs.2010.06.021.
- ^ Baruch A. Birnbaum, Nikhil R. Devanur, and Lin Xiao. (2011). Distributed Algorithms via Gradient Descent for Fisher Markets. In Proceedings of the 12th ACM Conference on Electronic Commerce (EC '11).
- ^ Shmyrev, V. I. (2009-10-01). "An algorithm for finding equilibrium in the linear exchange model with fixed budgets". Journal of Applied and Industrial Mathematics. 3 (4): 505–518. doi:10.1134/S1990478909040097.
- ^ Cheung, Yun Kuen; Cole, Richard; Tao, Yixin (2018). "Dynamics of Distributed Updating in Fisher Markets". Proceedings of the 2018 ACM Conference on Economics and Computation. pp. 351–368. doi:10.1145/3219166.3219189. ISBN 978-1-4503-5829-3.
- ^ Yun Kuen Cheung; Hoefer, Martin; Nakhe, Paresh (2018). "Tracing Equilibrium in Dynamic Markets via Distributed Adaptation". arXiv:1804.08017 [cs.GT].
- ^ Yang, Yongge; Lee, Yu-Ching; Chen, Po-An; Lin, Chuang-Chieh (2024). "Robustness of Online Proportional Response in Stochastic Online Fisher Markets: A Decentralized Approach". arXiv:2406.00160 [cs.GT].
- ^ Yotam Kolumbus, Moshe Levy, and Noam Nisan. (2023). Asynchronous Proportional Response Dynamics: Convergence in Markets with Adversarial Scheduling. In Advances in Neural Information Processing Systems (NeurIPS '23).
- ^ Li, Juncheng; Tang, Pingzhong (2024). "Proportional Dynamics in Linear Fisher Markets with Auto-bidding: Convergence, Incentives and Fairness". arXiv:2407.11872 [cs.GT].
- ^ Branzei, Simina; Mehta, Ruta; Nisan, Noam (2018). "Universal Growth in Production Economies". Advances in Neural Information Processing Systems. 31. Curran Associates, Inc.
- ^ Yun Kuen Cheung; Cole, Richard; Tao, Yixin (2025). "Proportional Response Dynamics in Gross Substitutes Markets". arXiv:2506.02852 [cs.GT].