The “Price of Anarchy” Under Nonlinear and Asymmetric Costs

Abstract

In this paper we characterize the “price of anarchy,” i.e., the inefficiency between user and system optimal solutions, when costs are nonseparable, asymmetric and nonlinear, generalizing earlier work that has addressed “the price of anarchy” under separable costs. The results in this paper apply primarily to nonatomic games such as the traffic equilibrium problem, but also in competitive multiperiod pricing and competitive supply chain settings. The bounds established in this paper are tight and explicitly account for the degree of asymmetry and nonlinearity of the cost function. We first provide a proof method for problems with a positive definite Jacobian matrix. Subsequently, we use ideas from semidefinite optimization in order to account for problems with a positive semidefinite Jacobian matrix (where the first approach does not apply). This latter connection also provides a different application of semidefinite optimization.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 93 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.