1
Competitive Equilibrium for Dynamic Multi-Agent
Systems: Social Shaping and Price Trajectories
Zeinab Salehi, Yijun Chen, Elizabeth L. Ratnam, Ian R. Petersen, and Guodong Shi
Abstract—In this paper, we consider dynamic multi-agent
systems (MAS) for decentralized resource allocation. The MAS
operates at a competitive equilibrium to ensure supply and
demand are balanced. First, we investigate the MAS over a finite
horizon. The utility functions of agents are parameterized to
incorporate individual preferences. We shape individual prefer-
ences through a set of utility functions to guarantee the resource
price at a competitive equilibrium remains socially acceptable,
i.e., the price is upper-bounded by an affordability threshold.
We show this problem is solvable at the conceptual level. Next,
we consider quadratic MAS and formulate the associated social
shaping problem as a multi-agent linear quadratic regulator
(LQR) problem which enables us to propose explicit utility sets
using quadratic programming and dynamic programming. Then,
a numerical algorithm is presented for calculating a tight range of
the preference function parameters which guarantees a socially
accepted price. We investigate the properties of a competitive
equilibrium over an infinite horizon. Considering general utility
functions, we show that under feasibility assumptions, any com-
petitive equilibrium maximizes the social welfare. Then, we prove
that for sufficiently small initial conditions, the social welfare
maximization solution constitutes a competitive equilibrium with
zero price. We also prove for general feasible initial conditions,
there exists a time instant after which the optimal price, corre-
sponding to a competitive equilibrium, becomes zero. Finally, we
specifically focus on quadratic MAS and propose explicit results.
Index Terms—Competitive equilibrium, multi-agent systems,
resource allocation, social welfare optimization, dynamic pro-
gramming, linear quadratic regulator (LQR).
I. INTRODUCTION
EFFICIENT resource allocation is a fundamental prob-
lem in the literature that can be addressed by MAS
approaches [1], [2]. Resource allocation problems are of great
importance when the total demand must equal the total supply
for safe and secure system operation [3]–[5]. Depending on
the application, there exist two common approaches: (i) social
welfare where agents collaborate to maximize the total agents’
utilities [6]–[8]; (ii) competitive equilibrium in which agents
compete to maximize their individual payoffs [9], [15]. At
the competitive equilibrium, the resource price along with
the allocated resources provides an effective solution to the
allocation problem, thereby clearing the market [10].
Z. Salehi, E. L. Ratnam, and I. R. Petersen are with the Research
School of Engineering, The Australian National University, Canberra,
Australia (e-mail: zeinab.salehi@anu.edu.au; elizabeth.ratnam@anu.edu.au;
ian.petersen@anu.edu.au).
Y. Chen and G. Shi are with the Australian Center for Field Robotics,
School of Aerospace, Mechanical and Mechatronic Engineering, The Uni-
versity of Sydney, NSW, Australia (e-mail: yijun.chen@sydney.edu.au;
guodong.shi@sydney.edu.au).
Some preliminary results of this paper are accepted for presentation at
the 61st IEEE Conference on Decision and Control [24], and the 12th IFAC
Symposium on Nonlinear Control Systems [25].
A fundamental theorem in classical welfare economics
states that the competitive equilibrium is Pareto optimal,
meaning that no agent can deviate from the equilibrium to
increase profits without reducing another’s payoff [11]–[14].
It is also proved that under some convexity assumptions,
the competitive equilibrium maximizes social welfare [15]–
[17]. Mechanism design is a well-known approach to social
welfare maximization [18]–[20]. The key point in achieving
a competitive equilibrium is efficient resource pricing that
depends on the utility of each agent. The corresponding price,
however, is not guaranteed to be affordable for all agents. If
some participants select their utility functions aggressively,
the price potentially increases to the point that it becomes
unaffordable to other agents who have no alternative but to
leave the system [21], [22]. A recent example is the Texas
power outage disaster in February 2021, when some citizens
who had access to electricity during the period of rolling power
outages received inflated (and in some cases, unaffordable)
electricity bills for their daily power usage [23].
In this paper, we consider MAS with distributed resources
and linear time-invariant (LTI) dynamics. Over a finite horizon,
we achieve affordability by parameterizing utility functions
and proposing some limits on the parameters such that the
resource price at a competitive equilibrium never exceeds a
given threshold, leading to the concept of social shaping. We
design an optimization problem and propose a conceptual
scheme, based on dynamic programming, which shows how
the social shaping problem is solvable implicitly for general
classes of utility functions. Next, the social shaping problem is
reformulated for quadratic MAS, leading to an LQR problem.
Solving the LQR problem using quadratic programming and
dynamic programming, we propose two explicit sets for the
utility function parameters such that they lead to socially
acceptable resource prices. Then, a numerical algorithm based
on the bisection method is presented that provides accurate and
practical bounds on the utility function parameters, followed
by some convergence results.
Over an infinite horizon, we examine the behavior of
resource price under a competitive equilibrium. We extend our
previous work in [15] which considered a finite horizon, by
showing that in the infinite horizon problem, the competitive
equilibrium maximizes social welfare if feasibility assump-
tions are satisfied. We also prove that for sufficiently small
initial conditions, the social welfare maximization constitutes
a competitive equilibrium with zero price; implying adequate
resources are available in the network to meet the demand
of all agents. Furthermore, we show for any feasible initial
condition, there exists a time instant after which the optimal
arXiv:2210.11064v1 [eess.SY] 20 Oct 2022