Nash equilibria in stabilizing systems

16Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The objective of this paper is three-fold. First, we specify what it means for a fixed point of a stabilizing distributed system to be a Nash equilibrium. Second, we present methods that can be used to verify whether or not a given fixed point of a given stabilizing distributed system is a Nash equilibrium. Third, we argue that in a stabilizing distributed system, whose fixed points are all Nash equilibria, no process has an incentive to perturb its local state, after the system reaches one fixed point, in order to force the system to reach another fixed point where the perturbing process achieves a better gain. If the fixed points of a stabilizing distributed system are all Nash equilibria, then we refer to the system as perturbation-proof. Otherwise, we refer to the system as perturbation-prone. We identify four natural classes of perturbation-(proof/ prone) systems. We present system examples for three of these classes of systems, and show that the fourth class is empty. © 2009 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Gouda, M. G., & Acharya, H. B. (2009). Nash equilibria in stabilizing systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5873 LNCS, pp. 311–324). https://doi.org/10.1007/978-3-642-05118-0_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free