In shared-constraint resource allocation games, the worst-case efficiency of both generalized Nash and variational equilibria is zero, and generalized Nash equilibria stay arbitrarily inefficient even when every variational equilibrium is efficient.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
The Efficiency of Generalized Nash and Variational Equilibria
In shared-constraint resource allocation games, the worst-case efficiency of both generalized Nash and variational equilibria is zero, and generalized Nash equilibria stay arbitrarily inefficient even when every variational equilibrium is efficient.